/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/mix036_power.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:14:23,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:14:23,860 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:14:23,911 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:14:23,911 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:14:23,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:14:23,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:14:23,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:14:23,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:14:23,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:14:23,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:14:23,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:14:23,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:14:23,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:14:23,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:14:23,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:14:23,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:14:23,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:14:23,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:14:23,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:14:23,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:14:23,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:14:23,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:14:23,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:14:23,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:14:23,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:14:23,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:14:23,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:14:23,934 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:14:23,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:14:23,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:14:23,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:14:23,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:14:23,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:14:23,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:14:23,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:14:23,937 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:14:23,937 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:14:23,938 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:14:23,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:14:23,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:14:23,939 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:14:23,955 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:14:23,955 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:14:23,956 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:14:23,956 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:14:23,956 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:14:23,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:14:23,956 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:14:23,956 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:14:23,956 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:14:23,957 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:14:23,957 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:14:23,957 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:14:23,957 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:14:23,957 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:14:23,957 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:14:23,957 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:14:23,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:14:23,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:14:23,958 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:14:23,958 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:14:23,958 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:14:23,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:14:23,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:14:23,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:14:23,958 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:14:23,958 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:14:23,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:14:23,959 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:14:23,959 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:14:24,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:14:24,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:14:24,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:14:24,319 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:14:24,319 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:14:24,320 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_power.opt_rmo.opt.i [2022-12-06 04:14:25,429 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:14:25,635 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:14:25,636 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_power.opt_rmo.opt.i [2022-12-06 04:14:25,661 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91c23386a/4a05275b0e604f5391f241e420cfdf13/FLAG4ebe036ad [2022-12-06 04:14:25,687 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91c23386a/4a05275b0e604f5391f241e420cfdf13 [2022-12-06 04:14:25,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:14:25,691 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:14:25,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:14:25,692 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:14:25,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:14:25,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:14:25" (1/1) ... [2022-12-06 04:14:25,696 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c99e05f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:25, skipping insertion in model container [2022-12-06 04:14:25,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:14:25" (1/1) ... [2022-12-06 04:14:25,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:14:25,749 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:14:25,879 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/mix036_power.opt_rmo.opt.i[958,971] [2022-12-06 04:14:25,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:25,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:25,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:25,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:25,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:25,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:25,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:25,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:25,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:25,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:25,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:14:26,054 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:14:26,062 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/mix036_power.opt_rmo.opt.i[958,971] [2022-12-06 04:14:26,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:26,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:26,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:14:26,125 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:14:26,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:26 WrapperNode [2022-12-06 04:14:26,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:14:26,127 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:14:26,127 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:14:26,127 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:14:26,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:26" (1/1) ... [2022-12-06 04:14:26,149 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:26" (1/1) ... [2022-12-06 04:14:26,165 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2022-12-06 04:14:26,165 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:14:26,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:14:26,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:14:26,166 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:14:26,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:26" (1/1) ... [2022-12-06 04:14:26,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:26" (1/1) ... [2022-12-06 04:14:26,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:26" (1/1) ... [2022-12-06 04:14:26,174 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:26" (1/1) ... [2022-12-06 04:14:26,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:26" (1/1) ... [2022-12-06 04:14:26,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:26" (1/1) ... [2022-12-06 04:14:26,183 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:26" (1/1) ... [2022-12-06 04:14:26,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:26" (1/1) ... [2022-12-06 04:14:26,186 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:14:26,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:14:26,187 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:14:26,187 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:14:26,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:26" (1/1) ... [2022-12-06 04:14:26,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:14:26,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:14:26,218 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:14:26,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:14:26,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:14:26,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:14:26,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:14:26,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:14:26,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:14:26,272 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:14:26,272 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:14:26,272 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:14:26,272 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:14:26,272 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:14:26,272 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:14:26,273 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:14:26,273 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:14:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:14:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:14:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:14:26,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:14:26,276 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:14:26,461 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:14:26,463 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:14:26,739 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:14:26,830 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:14:26,830 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:14:26,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:14:26 BoogieIcfgContainer [2022-12-06 04:14:26,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:14:26,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:14:26,835 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:14:26,837 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:14:26,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:14:25" (1/3) ... [2022-12-06 04:14:26,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74292371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:14:26, skipping insertion in model container [2022-12-06 04:14:26,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:26" (2/3) ... [2022-12-06 04:14:26,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74292371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:14:26, skipping insertion in model container [2022-12-06 04:14:26,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:14:26" (3/3) ... [2022-12-06 04:14:26,840 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036_power.opt_rmo.opt.i [2022-12-06 04:14:26,853 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:14:26,854 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:14:26,854 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:14:26,894 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:14:26,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2022-12-06 04:14:26,980 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-06 04:14:26,980 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:14:26,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-06 04:14:26,986 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2022-12-06 04:14:26,994 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2022-12-06 04:14:26,995 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:27,010 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-06 04:14:27,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2022-12-06 04:14:27,046 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-06 04:14:27,047 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:14:27,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-06 04:14:27,051 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-06 04:14:27,051 INFO L188 LiptonReduction]: Number of co-enabled transitions 2954 [2022-12-06 04:14:31,055 INFO L203 LiptonReduction]: Total number of compositions: 100 [2022-12-06 04:14:31,082 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:14:31,089 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;@3c27de1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:14:31,090 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 04:14:31,094 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-06 04:14:31,095 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:14:31,095 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:31,095 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:31,096 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:31,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:31,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1981747642, now seen corresponding path program 1 times [2022-12-06 04:14:31,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:31,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883272211] [2022-12-06 04:14:31,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:31,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:31,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:31,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883272211] [2022-12-06 04:14:31,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883272211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:31,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:31,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:14:31,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587591966] [2022-12-06 04:14:31,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:31,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:14:31,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:31,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:14:31,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:14:31,546 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2022-12-06 04:14:31,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:31,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:31,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2022-12-06 04:14:31,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:32,083 INFO L130 PetriNetUnfolder]: 3519/5195 cut-off events. [2022-12-06 04:14:32,084 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-12-06 04:14:32,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10175 conditions, 5195 events. 3519/5195 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 29283 event pairs, 666 based on Foata normal form. 0/4702 useless extension candidates. Maximal degree in co-relation 10163. Up to 3826 conditions per place. [2022-12-06 04:14:32,111 INFO L137 encePairwiseOnDemand]: 27/32 looper letters, 33 selfloop transitions, 2 changer transitions 6/45 dead transitions. [2022-12-06 04:14:32,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 187 flow [2022-12-06 04:14:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:14:32,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:14:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-12-06 04:14:32,119 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2022-12-06 04:14:32,120 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 58 transitions. [2022-12-06 04:14:32,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 187 flow [2022-12-06 04:14:32,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 182 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:14:32,125 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 64 flow [2022-12-06 04:14:32,127 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2022-12-06 04:14:32,129 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2022-12-06 04:14:32,130 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:32,130 INFO L89 Accepts]: Start accepts. Operand has 40 places, 26 transitions, 64 flow [2022-12-06 04:14:32,132 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:32,132 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:32,132 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 26 transitions, 64 flow [2022-12-06 04:14:32,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 26 transitions, 64 flow [2022-12-06 04:14:32,144 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-12-06 04:14:32,144 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:14:32,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 26 events. 0/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 31 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:14:32,144 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 26 transitions, 64 flow [2022-12-06 04:14:32,144 INFO L188 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-06 04:14:32,243 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:14:32,246 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-06 04:14:32,246 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 64 flow [2022-12-06 04:14:32,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:32,246 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:32,246 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:32,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:14:32,249 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:32,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:32,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1120469441, now seen corresponding path program 1 times [2022-12-06 04:14:32,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:32,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606339365] [2022-12-06 04:14:32,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:32,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:32,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:32,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:32,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606339365] [2022-12-06 04:14:32,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606339365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:32,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:32,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:14:32,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951750910] [2022-12-06 04:14:32,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:32,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:14:32,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:32,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:14:32,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:14:32,420 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 04:14:32,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 64 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:32,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:32,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 04:14:32,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:33,014 INFO L130 PetriNetUnfolder]: 5895/8000 cut-off events. [2022-12-06 04:14:33,014 INFO L131 PetriNetUnfolder]: For 404/404 co-relation queries the response was YES. [2022-12-06 04:14:33,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16614 conditions, 8000 events. 5895/8000 cut-off events. For 404/404 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 34943 event pairs, 2395 based on Foata normal form. 16/8016 useless extension candidates. Maximal degree in co-relation 16604. Up to 7809 conditions per place. [2022-12-06 04:14:33,044 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 37 selfloop transitions, 5 changer transitions 0/42 dead transitions. [2022-12-06 04:14:33,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 188 flow [2022-12-06 04:14:33,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:14:33,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:14:33,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 04:14:33,046 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2022-12-06 04:14:33,046 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 64 flow. Second operand 3 states and 43 transitions. [2022-12-06 04:14:33,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 188 flow [2022-12-06 04:14:33,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:14:33,048 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 93 flow [2022-12-06 04:14:33,048 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2022-12-06 04:14:33,049 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, -6 predicate places. [2022-12-06 04:14:33,049 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:33,049 INFO L89 Accepts]: Start accepts. Operand has 38 places, 30 transitions, 93 flow [2022-12-06 04:14:33,050 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:33,050 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:33,050 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 30 transitions, 93 flow [2022-12-06 04:14:33,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 30 transitions, 93 flow [2022-12-06 04:14:33,061 INFO L130 PetriNetUnfolder]: 45/146 cut-off events. [2022-12-06 04:14:33,062 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:14:33,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 146 events. 45/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 622 event pairs, 23 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 229. Up to 76 conditions per place. [2022-12-06 04:14:33,063 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 30 transitions, 93 flow [2022-12-06 04:14:33,063 INFO L188 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-06 04:14:33,074 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:14:33,075 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 04:14:33,076 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 93 flow [2022-12-06 04:14:33,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:33,079 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:33,082 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:33,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:14:33,083 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:33,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:33,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1817758583, now seen corresponding path program 1 times [2022-12-06 04:14:33,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:33,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277554369] [2022-12-06 04:14:33,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:33,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:33,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:33,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:33,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277554369] [2022-12-06 04:14:33,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277554369] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:33,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:33,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:14:33,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133593353] [2022-12-06 04:14:33,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:33,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:14:33,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:33,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:14:33,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:14:33,220 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 04:14:33,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 93 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:33,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:33,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 04:14:33,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:33,738 INFO L130 PetriNetUnfolder]: 5431/7392 cut-off events. [2022-12-06 04:14:33,738 INFO L131 PetriNetUnfolder]: For 1407/1407 co-relation queries the response was YES. [2022-12-06 04:14:33,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17043 conditions, 7392 events. 5431/7392 cut-off events. For 1407/1407 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 31514 event pairs, 1667 based on Foata normal form. 144/7536 useless extension candidates. Maximal degree in co-relation 17032. Up to 5105 conditions per place. [2022-12-06 04:14:33,775 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 39 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2022-12-06 04:14:33,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 207 flow [2022-12-06 04:14:33,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:14:33,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:14:33,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-06 04:14:33,778 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 04:14:33,778 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 93 flow. Second operand 3 states and 39 transitions. [2022-12-06 04:14:33,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 207 flow [2022-12-06 04:14:33,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 202 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:14:33,780 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 99 flow [2022-12-06 04:14:33,781 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2022-12-06 04:14:33,781 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2022-12-06 04:14:33,782 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:33,782 INFO L89 Accepts]: Start accepts. Operand has 40 places, 30 transitions, 99 flow [2022-12-06 04:14:33,783 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:33,783 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:33,783 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 30 transitions, 99 flow [2022-12-06 04:14:33,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 30 transitions, 99 flow [2022-12-06 04:14:33,792 INFO L130 PetriNetUnfolder]: 29/95 cut-off events. [2022-12-06 04:14:33,792 INFO L131 PetriNetUnfolder]: For 13/19 co-relation queries the response was YES. [2022-12-06 04:14:33,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 95 events. 29/95 cut-off events. For 13/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 344 event pairs, 11 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 175. Up to 53 conditions per place. [2022-12-06 04:14:33,794 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 30 transitions, 99 flow [2022-12-06 04:14:33,794 INFO L188 LiptonReduction]: Number of co-enabled transitions 370 [2022-12-06 04:14:33,806 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:14:33,807 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 04:14:33,807 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 99 flow [2022-12-06 04:14:33,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:33,807 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:33,807 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:33,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:14:33,808 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:33,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:33,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1225100354, now seen corresponding path program 1 times [2022-12-06 04:14:33,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:33,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544679912] [2022-12-06 04:14:33,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:33,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:33,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:33,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:33,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544679912] [2022-12-06 04:14:33,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544679912] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:33,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:33,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:14:33,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157884807] [2022-12-06 04:14:33,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:33,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:14:33,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:33,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:14:33,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:14:33,927 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-06 04:14:33,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:33,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:33,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-06 04:14:33,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:34,353 INFO L130 PetriNetUnfolder]: 3055/4565 cut-off events. [2022-12-06 04:14:34,354 INFO L131 PetriNetUnfolder]: For 714/739 co-relation queries the response was YES. [2022-12-06 04:14:34,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10116 conditions, 4565 events. 3055/4565 cut-off events. For 714/739 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 24535 event pairs, 571 based on Foata normal form. 336/4756 useless extension candidates. Maximal degree in co-relation 10103. Up to 2966 conditions per place. [2022-12-06 04:14:34,373 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 54 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2022-12-06 04:14:34,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 71 transitions, 323 flow [2022-12-06 04:14:34,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:14:34,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:14:34,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2022-12-06 04:14:34,375 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6461538461538462 [2022-12-06 04:14:34,375 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 99 flow. Second operand 5 states and 84 transitions. [2022-12-06 04:14:34,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 71 transitions, 323 flow [2022-12-06 04:14:34,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 71 transitions, 317 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:14:34,377 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 168 flow [2022-12-06 04:14:34,377 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2022-12-06 04:14:34,378 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2022-12-06 04:14:34,378 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:34,378 INFO L89 Accepts]: Start accepts. Operand has 45 places, 39 transitions, 168 flow [2022-12-06 04:14:34,378 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:34,378 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:34,379 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 39 transitions, 168 flow [2022-12-06 04:14:34,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 39 transitions, 168 flow [2022-12-06 04:14:34,409 INFO L130 PetriNetUnfolder]: 254/510 cut-off events. [2022-12-06 04:14:34,409 INFO L131 PetriNetUnfolder]: For 279/447 co-relation queries the response was YES. [2022-12-06 04:14:34,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1379 conditions, 510 events. 254/510 cut-off events. For 279/447 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 2945 event pairs, 117 based on Foata normal form. 2/454 useless extension candidates. Maximal degree in co-relation 1366. Up to 318 conditions per place. [2022-12-06 04:14:34,413 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 39 transitions, 168 flow [2022-12-06 04:14:34,413 INFO L188 LiptonReduction]: Number of co-enabled transitions 508 [2022-12-06 04:14:34,430 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [500] L870-3-->L3: Formula: (and (= v_~main$tmp_guard0~0_44 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_151 4) 1 0)) 0 1)) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_17|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [448] L846-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#res.base_7| 0) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= |v_P3Thread1of1ForFork3_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_7|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] [2022-12-06 04:14:34,462 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [500] L870-3-->L3: Formula: (and (= v_~main$tmp_guard0~0_44 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_151 4) 1 0)) 0 1)) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_17|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [506] L760-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_177 (+ v_~__unbuffered_cnt~0_178 1)) (= |v_P0Thread1of1ForFork2_#res.offset_13| 0) (= |v_P0Thread1of1ForFork2_#res.base_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_178} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_177, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_13|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] [2022-12-06 04:14:34,492 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [500] L870-3-->L3: Formula: (and (= v_~main$tmp_guard0~0_44 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_151 4) 1 0)) 0 1)) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_17|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [471] L820-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#res#1.base_23| 0) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= |v_P2Thread1of1ForFork1_#res#1.offset_23| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116} OutVars{P2Thread1of1ForFork1_#res#1.offset=|v_P2Thread1of1ForFork1_#res#1.offset_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P2Thread1of1ForFork1_#res#1.base=|v_P2Thread1of1ForFork1_#res#1.base_23|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res#1.base] [2022-12-06 04:14:34,522 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [500] L870-3-->L3: Formula: (and (= v_~main$tmp_guard0~0_44 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_151 4) 1 0)) 0 1)) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_17|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [464] L788-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res.offset_15| 0) (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= |v_P1Thread1of1ForFork0_#res.base_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_15|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_15|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] [2022-12-06 04:14:34,566 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:14:34,567 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 04:14:34,567 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 178 flow [2022-12-06 04:14:34,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:34,567 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:34,567 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:34,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:14:34,568 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:34,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:34,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1613657730, now seen corresponding path program 1 times [2022-12-06 04:14:34,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:34,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965669480] [2022-12-06 04:14:34,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:34,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:34,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:34,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:34,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965669480] [2022-12-06 04:14:34,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965669480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:34,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:34,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:14:34,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815704706] [2022-12-06 04:14:34,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:34,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:14:34,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:34,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:14:34,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:14:34,672 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-06 04:14:34,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:34,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:34,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-06 04:14:34,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:34,993 INFO L130 PetriNetUnfolder]: 2164/3406 cut-off events. [2022-12-06 04:14:34,993 INFO L131 PetriNetUnfolder]: For 2445/2448 co-relation queries the response was YES. [2022-12-06 04:14:34,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10252 conditions, 3406 events. 2164/3406 cut-off events. For 2445/2448 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 18707 event pairs, 289 based on Foata normal form. 227/3540 useless extension candidates. Maximal degree in co-relation 10236. Up to 1301 conditions per place. [2022-12-06 04:14:35,008 INFO L137 encePairwiseOnDemand]: 19/30 looper letters, 64 selfloop transitions, 18 changer transitions 0/89 dead transitions. [2022-12-06 04:14:35,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 89 transitions, 512 flow [2022-12-06 04:14:35,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:14:35,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:14:35,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2022-12-06 04:14:35,010 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5944444444444444 [2022-12-06 04:14:35,010 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 178 flow. Second operand 6 states and 107 transitions. [2022-12-06 04:14:35,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 89 transitions, 512 flow [2022-12-06 04:14:35,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 89 transitions, 499 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 04:14:35,016 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 297 flow [2022-12-06 04:14:35,016 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=297, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2022-12-06 04:14:35,017 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2022-12-06 04:14:35,017 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:35,017 INFO L89 Accepts]: Start accepts. Operand has 51 places, 47 transitions, 297 flow [2022-12-06 04:14:35,018 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:35,018 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:35,018 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 47 transitions, 297 flow [2022-12-06 04:14:35,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 47 transitions, 297 flow [2022-12-06 04:14:35,052 INFO L130 PetriNetUnfolder]: 189/430 cut-off events. [2022-12-06 04:14:35,052 INFO L131 PetriNetUnfolder]: For 1032/1599 co-relation queries the response was YES. [2022-12-06 04:14:35,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1781 conditions, 430 events. 189/430 cut-off events. For 1032/1599 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2503 event pairs, 38 based on Foata normal form. 11/405 useless extension candidates. Maximal degree in co-relation 1764. Up to 309 conditions per place. [2022-12-06 04:14:35,056 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 47 transitions, 297 flow [2022-12-06 04:14:35,056 INFO L188 LiptonReduction]: Number of co-enabled transitions 644 [2022-12-06 04:14:35,108 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:14:35,109 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-06 04:14:35,109 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 289 flow [2022-12-06 04:14:35,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:35,109 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:35,109 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:35,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:14:35,110 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:35,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:35,110 INFO L85 PathProgramCache]: Analyzing trace with hash 401640072, now seen corresponding path program 1 times [2022-12-06 04:14:35,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:35,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158470554] [2022-12-06 04:14:35,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:35,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:35,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:35,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:35,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158470554] [2022-12-06 04:14:35,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158470554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:35,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:35,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:14:35,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152054802] [2022-12-06 04:14:35,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:35,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:14:35,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:35,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:14:35,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:14:35,259 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 04:14:35,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 289 flow. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:35,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:35,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 04:14:35,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:35,774 INFO L130 PetriNetUnfolder]: 3599/5391 cut-off events. [2022-12-06 04:14:35,774 INFO L131 PetriNetUnfolder]: For 11854/11854 co-relation queries the response was YES. [2022-12-06 04:14:35,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19631 conditions, 5391 events. 3599/5391 cut-off events. For 11854/11854 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 27688 event pairs, 521 based on Foata normal form. 46/5437 useless extension candidates. Maximal degree in co-relation 19611. Up to 2983 conditions per place. [2022-12-06 04:14:35,794 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 82 selfloop transitions, 10 changer transitions 39/131 dead transitions. [2022-12-06 04:14:35,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 131 transitions, 1047 flow [2022-12-06 04:14:35,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:14:35,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:14:35,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2022-12-06 04:14:35,796 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 04:14:35,796 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 289 flow. Second operand 6 states and 99 transitions. [2022-12-06 04:14:35,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 131 transitions, 1047 flow [2022-12-06 04:14:35,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 131 transitions, 907 flow, removed 47 selfloop flow, removed 3 redundant places. [2022-12-06 04:14:35,850 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 222 flow [2022-12-06 04:14:35,850 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2022-12-06 04:14:35,851 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2022-12-06 04:14:35,851 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:35,851 INFO L89 Accepts]: Start accepts. Operand has 55 places, 42 transitions, 222 flow [2022-12-06 04:14:35,852 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:35,852 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:35,852 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 42 transitions, 222 flow [2022-12-06 04:14:35,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 222 flow [2022-12-06 04:14:35,879 INFO L130 PetriNetUnfolder]: 200/448 cut-off events. [2022-12-06 04:14:35,879 INFO L131 PetriNetUnfolder]: For 924/1117 co-relation queries the response was YES. [2022-12-06 04:14:35,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1609 conditions, 448 events. 200/448 cut-off events. For 924/1117 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2509 event pairs, 60 based on Foata normal form. 12/426 useless extension candidates. Maximal degree in co-relation 1591. Up to 263 conditions per place. [2022-12-06 04:14:35,883 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 42 transitions, 222 flow [2022-12-06 04:14:35,883 INFO L188 LiptonReduction]: Number of co-enabled transitions 534 [2022-12-06 04:14:35,894 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [414] $Ultimate##0-->L772: Formula: (and (= v_~x~0_4 1) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] and [377] L810-->L813: 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-06 04:14:36,137 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [414] $Ultimate##0-->L772: Formula: (and (= v_~x~0_4 1) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] and [385] L833-->L836: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~a~0_1) InVars {~a~0=v_~a~0_1} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~a~0=v_~a~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0] [2022-12-06 04:14:36,171 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:14:36,172 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 321 [2022-12-06 04:14:36,172 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 222 flow [2022-12-06 04:14:36,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:36,172 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:36,172 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:36,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:14:36,173 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:36,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:36,173 INFO L85 PathProgramCache]: Analyzing trace with hash -877340024, now seen corresponding path program 2 times [2022-12-06 04:14:36,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:36,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171638360] [2022-12-06 04:14:36,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:36,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:36,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:36,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:36,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171638360] [2022-12-06 04:14:36,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171638360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:36,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:36,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:14:36,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18197725] [2022-12-06 04:14:36,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:36,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:14:36,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:36,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:14:36,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:14:36,345 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-06 04:14:36,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 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-06 04:14:36,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:36,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-06 04:14:36,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:36,692 INFO L130 PetriNetUnfolder]: 1455/2361 cut-off events. [2022-12-06 04:14:36,692 INFO L131 PetriNetUnfolder]: For 3005/3047 co-relation queries the response was YES. [2022-12-06 04:14:36,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7500 conditions, 2361 events. 1455/2361 cut-off events. For 3005/3047 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12613 event pairs, 231 based on Foata normal form. 166/2445 useless extension candidates. Maximal degree in co-relation 7479. Up to 750 conditions per place. [2022-12-06 04:14:36,708 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 66 selfloop transitions, 18 changer transitions 9/101 dead transitions. [2022-12-06 04:14:36,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 101 transitions, 665 flow [2022-12-06 04:14:36,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:14:36,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:14:36,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2022-12-06 04:14:36,711 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6059113300492611 [2022-12-06 04:14:36,711 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 222 flow. Second operand 7 states and 123 transitions. [2022-12-06 04:14:36,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 101 transitions, 665 flow [2022-12-06 04:14:36,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 101 transitions, 622 flow, removed 18 selfloop flow, removed 3 redundant places. [2022-12-06 04:14:36,723 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 341 flow [2022-12-06 04:14:36,723 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=341, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2022-12-06 04:14:36,724 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 13 predicate places. [2022-12-06 04:14:36,724 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:36,724 INFO L89 Accepts]: Start accepts. Operand has 57 places, 50 transitions, 341 flow [2022-12-06 04:14:36,726 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:36,726 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:36,726 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 50 transitions, 341 flow [2022-12-06 04:14:36,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 50 transitions, 341 flow [2022-12-06 04:14:36,754 INFO L130 PetriNetUnfolder]: 132/343 cut-off events. [2022-12-06 04:14:36,754 INFO L131 PetriNetUnfolder]: For 764/847 co-relation queries the response was YES. [2022-12-06 04:14:36,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1384 conditions, 343 events. 132/343 cut-off events. For 764/847 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1879 event pairs, 17 based on Foata normal form. 1/327 useless extension candidates. Maximal degree in co-relation 1364. Up to 210 conditions per place. [2022-12-06 04:14:36,758 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 50 transitions, 341 flow [2022-12-06 04:14:36,759 INFO L188 LiptonReduction]: Number of co-enabled transitions 606 [2022-12-06 04:14:36,766 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [500] L870-3-->L3: Formula: (and (= v_~main$tmp_guard0~0_44 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_151 4) 1 0)) 0 1)) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_17|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [506] L760-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_177 (+ v_~__unbuffered_cnt~0_178 1)) (= |v_P0Thread1of1ForFork2_#res.offset_13| 0) (= |v_P0Thread1of1ForFork2_#res.base_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_178} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_177, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_13|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] [2022-12-06 04:14:36,808 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [500] L870-3-->L3: Formula: (and (= v_~main$tmp_guard0~0_44 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_151 4) 1 0)) 0 1)) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_17|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [471] L820-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#res#1.base_23| 0) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= |v_P2Thread1of1ForFork1_#res#1.offset_23| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116} OutVars{P2Thread1of1ForFork1_#res#1.offset=|v_P2Thread1of1ForFork1_#res#1.offset_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P2Thread1of1ForFork1_#res#1.base=|v_P2Thread1of1ForFork1_#res#1.base_23|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res#1.base] [2022-12-06 04:14:36,848 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [500] L870-3-->L3: Formula: (and (= v_~main$tmp_guard0~0_44 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_151 4) 1 0)) 0 1)) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_17|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [464] L788-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res.offset_15| 0) (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= |v_P1Thread1of1ForFork0_#res.base_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_15|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_15|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] [2022-12-06 04:14:36,884 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [500] L870-3-->L3: Formula: (and (= v_~main$tmp_guard0~0_44 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_151 4) 1 0)) 0 1)) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_17|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [448] L846-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#res.base_7| 0) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= |v_P3Thread1of1ForFork3_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_7|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] [2022-12-06 04:14:37,297 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:14:37,299 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 575 [2022-12-06 04:14:37,299 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 349 flow [2022-12-06 04:14:37,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 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-06 04:14:37,299 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:37,299 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:37,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:14:37,300 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:37,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:37,300 INFO L85 PathProgramCache]: Analyzing trace with hash -164898386, now seen corresponding path program 1 times [2022-12-06 04:14:37,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:37,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950202518] [2022-12-06 04:14:37,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:37,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:37,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:37,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:37,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950202518] [2022-12-06 04:14:37,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950202518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:37,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:37,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:14:37,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478901482] [2022-12-06 04:14:37,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:37,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:14:37,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:37,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:14:37,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:14:37,509 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2022-12-06 04:14:37,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 349 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:37,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:37,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2022-12-06 04:14:37,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:37,852 INFO L130 PetriNetUnfolder]: 1809/2966 cut-off events. [2022-12-06 04:14:37,852 INFO L131 PetriNetUnfolder]: For 8692/8707 co-relation queries the response was YES. [2022-12-06 04:14:37,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11215 conditions, 2966 events. 1809/2966 cut-off events. For 8692/8707 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 16494 event pairs, 244 based on Foata normal form. 11/2887 useless extension candidates. Maximal degree in co-relation 11192. Up to 1531 conditions per place. [2022-12-06 04:14:37,865 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 90 selfloop transitions, 2 changer transitions 8/107 dead transitions. [2022-12-06 04:14:37,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 107 transitions, 1002 flow [2022-12-06 04:14:37,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:14:37,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:14:37,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-12-06 04:14:37,867 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6287878787878788 [2022-12-06 04:14:37,867 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 349 flow. Second operand 4 states and 83 transitions. [2022-12-06 04:14:37,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 107 transitions, 1002 flow [2022-12-06 04:14:37,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 107 transitions, 808 flow, removed 80 selfloop flow, removed 3 redundant places. [2022-12-06 04:14:37,894 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 291 flow [2022-12-06 04:14:37,895 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=291, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2022-12-06 04:14:37,897 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2022-12-06 04:14:37,897 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:37,897 INFO L89 Accepts]: Start accepts. Operand has 58 places, 50 transitions, 291 flow [2022-12-06 04:14:37,900 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:37,900 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:37,900 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 50 transitions, 291 flow [2022-12-06 04:14:37,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 50 transitions, 291 flow [2022-12-06 04:14:37,931 INFO L130 PetriNetUnfolder]: 224/514 cut-off events. [2022-12-06 04:14:37,931 INFO L131 PetriNetUnfolder]: For 846/859 co-relation queries the response was YES. [2022-12-06 04:14:37,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1704 conditions, 514 events. 224/514 cut-off events. For 846/859 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2966 event pairs, 21 based on Foata normal form. 1/481 useless extension candidates. Maximal degree in co-relation 1683. Up to 180 conditions per place. [2022-12-06 04:14:37,935 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 50 transitions, 291 flow [2022-12-06 04:14:37,935 INFO L188 LiptonReduction]: Number of co-enabled transitions 586 [2022-12-06 04:14:37,980 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:14:37,981 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 04:14:37,981 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 294 flow [2022-12-06 04:14:37,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:37,981 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:37,981 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:37,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:14:37,981 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:37,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:37,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2080897202, now seen corresponding path program 1 times [2022-12-06 04:14:37,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:37,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562909145] [2022-12-06 04:14:37,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:37,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:38,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:38,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:38,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562909145] [2022-12-06 04:14:38,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562909145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:38,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:38,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:14:38,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596322992] [2022-12-06 04:14:38,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:38,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:14:38,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:38,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:14:38,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:14:38,132 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2022-12-06 04:14:38,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 294 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:38,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:38,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2022-12-06 04:14:38,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:38,525 INFO L130 PetriNetUnfolder]: 2550/4178 cut-off events. [2022-12-06 04:14:38,526 INFO L131 PetriNetUnfolder]: For 7250/7285 co-relation queries the response was YES. [2022-12-06 04:14:38,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14642 conditions, 4178 events. 2550/4178 cut-off events. For 7250/7285 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 24673 event pairs, 572 based on Foata normal form. 11/4088 useless extension candidates. Maximal degree in co-relation 14618. Up to 1742 conditions per place. [2022-12-06 04:14:38,542 INFO L137 encePairwiseOnDemand]: 30/34 looper letters, 56 selfloop transitions, 2 changer transitions 37/101 dead transitions. [2022-12-06 04:14:38,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 101 transitions, 798 flow [2022-12-06 04:14:38,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:14:38,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:14:38,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-06 04:14:38,544 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5588235294117647 [2022-12-06 04:14:38,544 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 294 flow. Second operand 4 states and 76 transitions. [2022-12-06 04:14:38,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 101 transitions, 798 flow [2022-12-06 04:14:38,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 101 transitions, 793 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:14:38,571 INFO L231 Difference]: Finished difference. Result has 62 places, 46 transitions, 270 flow [2022-12-06 04:14:38,571 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=270, PETRI_PLACES=62, PETRI_TRANSITIONS=46} [2022-12-06 04:14:38,571 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 18 predicate places. [2022-12-06 04:14:38,572 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:38,572 INFO L89 Accepts]: Start accepts. Operand has 62 places, 46 transitions, 270 flow [2022-12-06 04:14:38,572 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:38,572 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:38,573 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 46 transitions, 270 flow [2022-12-06 04:14:38,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 46 transitions, 270 flow [2022-12-06 04:14:38,614 INFO L130 PetriNetUnfolder]: 281/679 cut-off events. [2022-12-06 04:14:38,614 INFO L131 PetriNetUnfolder]: For 1121/1152 co-relation queries the response was YES. [2022-12-06 04:14:38,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2272 conditions, 679 events. 281/679 cut-off events. For 1121/1152 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4309 event pairs, 35 based on Foata normal form. 1/634 useless extension candidates. Maximal degree in co-relation 2249. Up to 305 conditions per place. [2022-12-06 04:14:38,627 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 46 transitions, 270 flow [2022-12-06 04:14:38,628 INFO L188 LiptonReduction]: Number of co-enabled transitions 518 [2022-12-06 04:14:38,683 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:14:38,684 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-06 04:14:38,684 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 273 flow [2022-12-06 04:14:38,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:38,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:38,685 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:38,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:14:38,685 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:38,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:38,685 INFO L85 PathProgramCache]: Analyzing trace with hash -182227112, now seen corresponding path program 2 times [2022-12-06 04:14:38,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:38,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115310686] [2022-12-06 04:14:38,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:38,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:38,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:38,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115310686] [2022-12-06 04:14:38,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115310686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:38,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:38,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:14:38,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131372590] [2022-12-06 04:14:38,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:38,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:14:38,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:38,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:14:38,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:14:38,851 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-06 04:14:38,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 46 transitions, 273 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:38,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:38,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-06 04:14:38,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:39,223 INFO L130 PetriNetUnfolder]: 1820/2992 cut-off events. [2022-12-06 04:14:39,223 INFO L131 PetriNetUnfolder]: For 4391/4479 co-relation queries the response was YES. [2022-12-06 04:14:39,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10272 conditions, 2992 events. 1820/2992 cut-off events. For 4391/4479 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 17559 event pairs, 266 based on Foata normal form. 124/2983 useless extension candidates. Maximal degree in co-relation 10246. Up to 1009 conditions per place. [2022-12-06 04:14:39,234 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 30 selfloop transitions, 17 changer transitions 40/91 dead transitions. [2022-12-06 04:14:39,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 91 transitions, 627 flow [2022-12-06 04:14:39,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:14:39,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:14:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2022-12-06 04:14:39,235 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4875 [2022-12-06 04:14:39,236 INFO L175 Difference]: Start difference. First operand has 61 places, 46 transitions, 273 flow. Second operand 8 states and 117 transitions. [2022-12-06 04:14:39,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 91 transitions, 627 flow [2022-12-06 04:14:39,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 91 transitions, 596 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-06 04:14:39,280 INFO L231 Difference]: Finished difference. Result has 68 places, 37 transitions, 240 flow [2022-12-06 04:14:39,280 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=240, PETRI_PLACES=68, PETRI_TRANSITIONS=37} [2022-12-06 04:14:39,281 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 24 predicate places. [2022-12-06 04:14:39,281 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:39,281 INFO L89 Accepts]: Start accepts. Operand has 68 places, 37 transitions, 240 flow [2022-12-06 04:14:39,282 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:39,282 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:39,282 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 37 transitions, 240 flow [2022-12-06 04:14:39,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 37 transitions, 240 flow [2022-12-06 04:14:39,289 INFO L130 PetriNetUnfolder]: 35/97 cut-off events. [2022-12-06 04:14:39,289 INFO L131 PetriNetUnfolder]: For 135/148 co-relation queries the response was YES. [2022-12-06 04:14:39,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 97 events. 35/97 cut-off events. For 135/148 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 301 event pairs, 3 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 345. Up to 36 conditions per place. [2022-12-06 04:14:39,290 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 37 transitions, 240 flow [2022-12-06 04:14:39,290 INFO L188 LiptonReduction]: Number of co-enabled transitions 230 [2022-12-06 04:14:39,802 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 04:14:39,803 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 522 [2022-12-06 04:14:39,803 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 32 transitions, 230 flow [2022-12-06 04:14:39,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:39,804 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:39,804 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:39,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:14:39,804 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:39,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:39,804 INFO L85 PathProgramCache]: Analyzing trace with hash 976716421, now seen corresponding path program 1 times [2022-12-06 04:14:39,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:39,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81592840] [2022-12-06 04:14:39,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:39,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:40,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:40,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:40,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81592840] [2022-12-06 04:14:40,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81592840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:40,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:40,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:14:40,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876260002] [2022-12-06 04:14:40,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:40,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:14:40,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:40,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:14:40,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:14:40,588 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 04:14:40,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 32 transitions, 230 flow. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:40,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:40,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 04:14:40,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:40,845 INFO L130 PetriNetUnfolder]: 402/708 cut-off events. [2022-12-06 04:14:40,846 INFO L131 PetriNetUnfolder]: For 1884/1884 co-relation queries the response was YES. [2022-12-06 04:14:40,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2959 conditions, 708 events. 402/708 cut-off events. For 1884/1884 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3316 event pairs, 31 based on Foata normal form. 1/709 useless extension candidates. Maximal degree in co-relation 2931. Up to 308 conditions per place. [2022-12-06 04:14:40,853 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 36 selfloop transitions, 3 changer transitions 45/84 dead transitions. [2022-12-06 04:14:40,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 743 flow [2022-12-06 04:14:40,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:14:40,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:14:40,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-12-06 04:14:40,854 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.425 [2022-12-06 04:14:40,854 INFO L175 Difference]: Start difference. First operand has 57 places, 32 transitions, 230 flow. Second operand 6 states and 51 transitions. [2022-12-06 04:14:40,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 743 flow [2022-12-06 04:14:40,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 84 transitions, 588 flow, removed 31 selfloop flow, removed 12 redundant places. [2022-12-06 04:14:40,862 INFO L231 Difference]: Finished difference. Result has 52 places, 32 transitions, 175 flow [2022-12-06 04:14:40,862 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=175, PETRI_PLACES=52, PETRI_TRANSITIONS=32} [2022-12-06 04:14:40,863 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2022-12-06 04:14:40,863 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:40,863 INFO L89 Accepts]: Start accepts. Operand has 52 places, 32 transitions, 175 flow [2022-12-06 04:14:40,864 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:40,864 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:40,865 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 32 transitions, 175 flow [2022-12-06 04:14:40,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 32 transitions, 175 flow [2022-12-06 04:14:40,875 INFO L130 PetriNetUnfolder]: 36/100 cut-off events. [2022-12-06 04:14:40,875 INFO L131 PetriNetUnfolder]: For 115/116 co-relation queries the response was YES. [2022-12-06 04:14:40,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 100 events. 36/100 cut-off events. For 115/116 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 370 event pairs, 3 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 298. Up to 34 conditions per place. [2022-12-06 04:14:40,876 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 32 transitions, 175 flow [2022-12-06 04:14:40,876 INFO L188 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-06 04:14:40,878 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:14:40,878 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 04:14:40,878 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 32 transitions, 175 flow [2022-12-06 04:14:40,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:40,879 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:40,879 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:40,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:14:40,879 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:40,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:40,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1441436727, now seen corresponding path program 2 times [2022-12-06 04:14:40,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:40,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279658557] [2022-12-06 04:14:40,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:40,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:14:40,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:14:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:14:41,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:14:41,025 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:14:41,026 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 04:14:41,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 04:14:41,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 04:14:41,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 04:14:41,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 04:14:41,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 04:14:41,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 04:14:41,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:14:41,029 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:41,034 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:14:41,034 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:14:41,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:14:41 BasicIcfg [2022-12-06 04:14:41,140 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:14:41,141 INFO L158 Benchmark]: Toolchain (without parser) took 15450.08ms. Allocated memory was 216.0MB in the beginning and 692.1MB in the end (delta: 476.1MB). Free memory was 174.2MB in the beginning and 653.4MB in the end (delta: -479.2MB). Peak memory consumption was 403.5MB. Max. memory is 8.0GB. [2022-12-06 04:14:41,141 INFO L158 Benchmark]: CDTParser took 0.78ms. Allocated memory is still 216.0MB. Free memory was 192.6MB in the beginning and 192.5MB in the end (delta: 74.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:14:41,141 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.85ms. Allocated memory is still 216.0MB. Free memory was 174.2MB in the beginning and 146.4MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 04:14:41,141 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.13ms. Allocated memory is still 216.0MB. Free memory was 146.4MB in the beginning and 144.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:14:41,142 INFO L158 Benchmark]: Boogie Preprocessor took 20.97ms. Allocated memory is still 216.0MB. Free memory was 144.3MB in the beginning and 142.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:14:41,142 INFO L158 Benchmark]: RCFGBuilder took 645.99ms. Allocated memory is still 216.0MB. Free memory was 142.2MB in the beginning and 109.2MB in the end (delta: 33.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-06 04:14:41,142 INFO L158 Benchmark]: TraceAbstraction took 14305.25ms. Allocated memory was 216.0MB in the beginning and 692.1MB in the end (delta: 476.1MB). Free memory was 108.7MB in the beginning and 653.4MB in the end (delta: -544.8MB). Peak memory consumption was 337.4MB. Max. memory is 8.0GB. [2022-12-06 04:14:41,143 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.78ms. Allocated memory is still 216.0MB. Free memory was 192.6MB in the beginning and 192.5MB in the end (delta: 74.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 434.85ms. Allocated memory is still 216.0MB. Free memory was 174.2MB in the beginning and 146.4MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.13ms. Allocated memory is still 216.0MB. Free memory was 146.4MB in the beginning and 144.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.97ms. Allocated memory is still 216.0MB. Free memory was 144.3MB in the beginning and 142.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 645.99ms. Allocated memory is still 216.0MB. Free memory was 142.2MB in the beginning and 109.2MB in the end (delta: 33.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 14305.25ms. Allocated memory was 216.0MB in the beginning and 692.1MB in the end (delta: 476.1MB). Free memory was 108.7MB in the beginning and 653.4MB in the end (delta: -544.8MB). Peak memory consumption was 337.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 139 PlacesBefore, 44 PlacesAfterwards, 128 TransitionsBefore, 32 TransitionsAfterwards, 2954 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 45 TrivialYvCompositions, 53 ConcurrentYvCompositions, 1 ChoiceCompositions, 100 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2150, independent: 2084, independent conditional: 2084, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2150, independent: 2084, independent conditional: 0, independent unconditional: 2084, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2150, independent: 2084, independent conditional: 0, independent unconditional: 2084, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2150, independent: 2084, independent conditional: 0, independent unconditional: 2084, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1831, independent: 1788, independent conditional: 0, independent unconditional: 1788, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1831, independent: 1768, independent conditional: 0, independent unconditional: 1768, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 63, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 128, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2150, independent: 296, independent conditional: 0, independent unconditional: 296, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 1831, unknown conditional: 0, unknown unconditional: 1831] , Statistics on independence cache: Total cache size (in pairs): 2622, Positive cache size: 2579, Positive conditional cache size: 0, Positive unconditional cache size: 2579, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 37 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 332 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 177, independent: 151, independent conditional: 151, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 177, independent: 151, independent conditional: 11, independent unconditional: 140, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 177, independent: 151, independent conditional: 11, independent unconditional: 140, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 177, independent: 151, independent conditional: 11, independent unconditional: 140, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 159, independent: 138, independent conditional: 10, independent unconditional: 128, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 159, independent: 132, independent conditional: 0, independent unconditional: 132, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 96, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 91, dependent conditional: 14, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 177, independent: 13, independent conditional: 1, independent unconditional: 12, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 159, unknown conditional: 12, unknown unconditional: 147] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 138, Positive conditional cache size: 10, Positive unconditional cache size: 128, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 372 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 155, independent: 136, independent conditional: 136, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 155, independent: 136, independent conditional: 15, independent unconditional: 121, dependent: 19, dependent conditional: 8, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 155, independent: 136, independent conditional: 0, independent unconditional: 136, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 155, independent: 136, independent conditional: 0, independent unconditional: 136, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 8, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 155, independent: 129, independent conditional: 0, independent unconditional: 129, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 145, Positive conditional cache size: 10, Positive unconditional cache size: 135, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 370 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 147, independent: 127, independent conditional: 127, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 147, independent: 127, independent conditional: 15, independent unconditional: 112, dependent: 20, dependent conditional: 8, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 147, independent: 127, independent conditional: 0, independent unconditional: 127, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 147, independent: 127, independent conditional: 0, independent unconditional: 127, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 6, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 147, independent: 123, independent conditional: 0, independent unconditional: 123, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 149, Positive conditional cache size: 10, Positive unconditional cache size: 139, Negative cache size: 24, Negative conditional cache size: 2, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 45 PlacesBefore, 44 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 508 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 300, independent: 258, independent conditional: 258, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 300, independent: 258, independent conditional: 114, independent unconditional: 144, dependent: 42, dependent conditional: 12, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 300, independent: 258, independent conditional: 74, independent unconditional: 184, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 300, independent: 258, independent conditional: 74, independent unconditional: 184, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 6, independent unconditional: 4, 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: 12, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 300, independent: 248, independent conditional: 68, independent unconditional: 180, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 12, unknown conditional: 6, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 171, Positive conditional cache size: 16, Positive unconditional cache size: 155, Negative cache size: 26, Negative conditional cache size: 2, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 52, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 51 PlacesBefore, 51 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 644 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 303, independent: 253, independent conditional: 253, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 303, independent: 253, independent conditional: 89, independent unconditional: 164, dependent: 50, dependent conditional: 12, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 303, independent: 253, independent conditional: 65, independent unconditional: 188, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 303, independent: 253, independent conditional: 65, independent unconditional: 188, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 6, independent unconditional: 1, 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: 8, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 303, independent: 246, independent conditional: 59, independent unconditional: 187, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 8, unknown conditional: 6, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 178, Positive conditional cache size: 22, Positive unconditional cache size: 156, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 52 PlacesBefore, 51 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 534 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 323, independent: 281, independent conditional: 281, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 323, independent: 281, independent conditional: 121, independent unconditional: 160, dependent: 42, dependent conditional: 6, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 329, independent: 281, independent conditional: 76, independent unconditional: 205, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 329, independent: 281, independent conditional: 76, independent unconditional: 205, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 20, independent conditional: 9, independent unconditional: 11, 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: 21, independent: 20, independent conditional: 0, independent unconditional: 20, 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: 329, independent: 261, independent conditional: 67, independent unconditional: 194, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 21, unknown conditional: 9, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 259, Positive cache size: 231, Positive conditional cache size: 32, Positive unconditional cache size: 199, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 57, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 57 PlacesBefore, 56 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 606 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 441, independent: 392, independent conditional: 392, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 441, independent: 392, independent conditional: 222, independent unconditional: 170, dependent: 49, dependent conditional: 12, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 441, independent: 392, independent conditional: 174, independent unconditional: 218, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 441, independent: 392, independent conditional: 174, independent unconditional: 218, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 13, independent conditional: 10, independent unconditional: 3, 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: 15, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 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: 441, independent: 379, independent conditional: 164, independent unconditional: 215, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 15, unknown conditional: 10, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 309, Positive cache size: 279, Positive conditional cache size: 45, Positive unconditional cache size: 234, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 60, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 586 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 302, independent: 258, independent conditional: 258, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 302, independent: 258, independent conditional: 179, independent unconditional: 79, dependent: 44, dependent conditional: 12, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 302, independent: 258, independent conditional: 168, independent unconditional: 90, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 302, independent: 258, independent conditional: 168, independent unconditional: 90, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 302, independent: 255, independent conditional: 165, independent unconditional: 90, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 7, unknown conditional: 3, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 337, Positive cache size: 303, Positive conditional cache size: 49, Positive unconditional cache size: 254, Negative cache size: 34, Negative conditional cache size: 2, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 61 PlacesBefore, 61 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 518 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 146, independent: 116, independent conditional: 116, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 146, independent: 116, independent conditional: 76, independent unconditional: 40, dependent: 30, dependent conditional: 8, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 146, independent: 116, independent conditional: 66, independent unconditional: 50, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 146, independent: 116, independent conditional: 66, independent unconditional: 50, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 146, independent: 114, independent conditional: 66, independent unconditional: 48, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 357, Positive cache size: 321, Positive conditional cache size: 50, Positive unconditional cache size: 271, Negative cache size: 36, Negative conditional cache size: 2, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 62 PlacesBefore, 57 PlacesAfterwards, 37 TransitionsBefore, 32 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 107, independent: 85, independent conditional: 85, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 107, independent: 85, independent conditional: 43, independent unconditional: 42, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 107, independent: 85, independent conditional: 42, independent unconditional: 43, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 107, independent: 85, independent conditional: 42, independent unconditional: 43, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 107, independent: 83, independent conditional: 42, independent unconditional: 41, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 414, Positive cache size: 377, Positive conditional cache size: 52, Positive unconditional cache size: 325, Negative cache size: 37, Negative conditional cache size: 2, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, independent: 67, independent conditional: 67, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 76, independent: 67, independent conditional: 46, independent unconditional: 21, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, independent: 67, independent conditional: 46, independent unconditional: 21, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 76, independent: 67, independent conditional: 46, independent unconditional: 21, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 2, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 76, independent: 62, independent conditional: 44, independent unconditional: 18, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 419, Positive cache size: 382, Positive conditional cache size: 54, Positive unconditional cache size: 328, Negative cache size: 37, Negative conditional cache size: 2, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_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; [L724] 0 int b = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L731] 0 _Bool y$flush_delayed; [L732] 0 int y$mem_tmp; [L733] 0 _Bool y$r_buff0_thd0; [L734] 0 _Bool y$r_buff0_thd1; [L735] 0 _Bool y$r_buff0_thd2; [L736] 0 _Bool y$r_buff0_thd3; [L737] 0 _Bool y$r_buff0_thd4; [L738] 0 _Bool y$r_buff1_thd0; [L739] 0 _Bool y$r_buff1_thd1; [L740] 0 _Bool y$r_buff1_thd2; [L741] 0 _Bool y$r_buff1_thd3; [L742] 0 _Bool y$r_buff1_thd4; [L743] 0 _Bool y$read_delayed; [L744] 0 int *y$read_delayed_var; [L745] 0 int y$w_buff0; [L746] 0 _Bool y$w_buff0_used; [L747] 0 int y$w_buff1; [L748] 0 _Bool y$w_buff1_used; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L863] 0 pthread_t t941; [L864] FCALL, FORK 0 pthread_create(&t941, ((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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t941, ((void *)0), P0, ((void *)0))=-3, t941={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] [L865] 0 pthread_t t942; [L866] FCALL, FORK 0 pthread_create(&t942, ((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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t942, ((void *)0), P1, ((void *)0))=-2, t941={5:0}, t942={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] [L867] 0 pthread_t t943; [L868] FCALL, FORK 0 pthread_create(&t943, ((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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t943, ((void *)0), P2, ((void *)0))=-1, t941={5:0}, t942={6:0}, t943={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] [L869] 0 pthread_t t944; [L870] FCALL, FORK 0 pthread_create(&t944, ((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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t944, ((void *)0), P3, ((void *)0))=0, t941={5:0}, t942={6:0}, t943={7:0}, t944={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] [L799] 3 y$w_buff1 = y$w_buff0 [L800] 3 y$w_buff0 = 1 [L801] 3 y$w_buff1_used = y$w_buff0_used [L802] 3 y$w_buff0_used = (_Bool)1 [L803] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L803] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L804] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L805] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L806] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L807] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L808] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L809] 3 y$r_buff0_thd3 = (_Bool)1 [L812] 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}, b=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] [L829] 4 z = 1 [L832] 4 a = 1 [L835] 4 __unbuffered_p3_EAX = 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=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L838] 4 __unbuffered_p3_EBX = b 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}, b=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] [L756] 1 b = 1 [L759] 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}, b=1, 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] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L841] 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) [L842] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L843] 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 [L844] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L845] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_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}, b=1, 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] [L771] 2 x = 1 [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] 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) [L779] 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)) [L780] 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)) [L781] 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)) [L782] 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)) [L783] 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)) [L784] 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)) [L785] 2 __unbuffered_p1_EAX = y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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] [L815] 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) [L816] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L817] 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 [L818] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L819] 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 [\result={0:0}, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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] [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 2 return 0; [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L848] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L850] 4 return 0; [L872] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L874] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L874] RET 0 assume_abort_if_not(main$tmp_guard0) [L876] 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) [L877] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L878] 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 [L879] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L880] 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 [L883] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L885] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_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}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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: 868]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 866]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 168 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: 14.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 442 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 442 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1233 IncrementalHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 23 mSDtfsCounter, 1233 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred in iteration=7, InterpolantAutomatonStates: 55, 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, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 1098 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:14:41,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...