/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/mix004.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:17:08,808 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:17:08,810 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:17:08,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:17:08,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:17:08,852 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:17:08,853 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:17:08,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:17:08,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:17:08,860 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:17:08,861 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:17:08,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:17:08,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:17:08,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:17:08,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:17:08,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:17:08,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:17:08,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:17:08,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:17:08,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:17:08,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:17:08,873 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:17:08,877 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:17:08,878 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:17:08,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:17:08,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:17:08,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:17:08,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:17:08,886 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:17:08,887 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:17:08,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:17:08,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:17:08,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:17:08,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:17:08,889 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:17:08,889 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:17:08,889 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:17:08,890 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:17:08,890 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:17:08,890 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:17:08,891 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:17:08,895 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:17:08,921 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:17:08,922 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:17:08,923 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:17:08,923 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:17:08,924 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:17:08,924 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:17:08,924 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:17:08,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:17:08,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:17:08,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:17:08,925 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:17:08,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:17:08,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:17:08,926 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:17:08,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:17:08,926 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:17:08,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:17:08,926 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:17:08,926 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:17:08,927 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:17:08,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:17:08,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:17:08,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:17:08,927 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:17:08,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:17:08,927 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:17:08,927 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:17:08,928 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:17:08,928 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:17:08,928 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 09:17:09,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:17:09,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:17:09,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:17:09,182 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:17:09,182 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:17:09,183 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix004.oepc.i [2022-12-13 09:17:10,289 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:17:10,510 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:17:10,511 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix004.oepc.i [2022-12-13 09:17:10,543 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a71f74e4/d881042c94dd458a96531c9d34810a77/FLAGb03b834f9 [2022-12-13 09:17:10,557 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a71f74e4/d881042c94dd458a96531c9d34810a77 [2022-12-13 09:17:10,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:17:10,560 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:17:10,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:17:10,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:17:10,564 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:17:10,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:17:10" (1/1) ... [2022-12-13 09:17:10,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10606308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:10, skipping insertion in model container [2022-12-13 09:17:10,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:17:10" (1/1) ... [2022-12-13 09:17:10,570 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:17:10,621 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:17:10,759 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/mix004.oepc.i[945,958] [2022-12-13 09:17:10,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:10,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:10,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:10,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:10,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:10,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:10,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:10,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:10,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:10,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:10,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:10,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:10,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:10,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:10,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:10,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:10,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:10,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:10,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:10,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:10,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:10,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:17:10,952 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:17:10,963 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/mix004.oepc.i[945,958] [2022-12-13 09:17:10,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:10,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:10,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:10,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:10,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:10,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:10,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:10,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:11,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:11,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:11,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:11,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:11,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:11,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:11,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:11,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:11,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:11,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:11,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:11,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:11,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:11,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:11,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:11,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:11,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:11,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:11,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:11,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:11,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:11,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:11,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:11,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:11,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:11,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:11,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:11,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:11,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:17:11,065 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:17:11,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:11 WrapperNode [2022-12-13 09:17:11,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:17:11,067 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:17:11,067 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:17:11,068 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:17:11,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:11" (1/1) ... [2022-12-13 09:17:11,097 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:11" (1/1) ... [2022-12-13 09:17:11,127 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2022-12-13 09:17:11,128 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:17:11,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:17:11,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:17:11,130 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:17:11,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:11" (1/1) ... [2022-12-13 09:17:11,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:11" (1/1) ... [2022-12-13 09:17:11,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:11" (1/1) ... [2022-12-13 09:17:11,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:11" (1/1) ... [2022-12-13 09:17:11,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:11" (1/1) ... [2022-12-13 09:17:11,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:11" (1/1) ... [2022-12-13 09:17:11,157 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:11" (1/1) ... [2022-12-13 09:17:11,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:11" (1/1) ... [2022-12-13 09:17:11,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:17:11,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:17:11,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:17:11,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:17:11,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:11" (1/1) ... [2022-12-13 09:17:11,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:17:11,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:17:11,211 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:17:11,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:17:11,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:17:11,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:17:11,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:17:11,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:17:11,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:17:11,243 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:17:11,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:17:11,243 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:17:11,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:17:11,243 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 09:17:11,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 09:17:11,243 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 09:17:11,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 09:17:11,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:17:11,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:17:11,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:17:11,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:17:11,244 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:17:11,399 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:17:11,400 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:17:11,647 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:17:11,731 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:17:11,731 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:17:11,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:17:11 BoogieIcfgContainer [2022-12-13 09:17:11,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:17:11,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:17:11,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:17:11,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:17:11,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:17:10" (1/3) ... [2022-12-13 09:17:11,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65765d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:17:11, skipping insertion in model container [2022-12-13 09:17:11,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:11" (2/3) ... [2022-12-13 09:17:11,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65765d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:17:11, skipping insertion in model container [2022-12-13 09:17:11,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:17:11" (3/3) ... [2022-12-13 09:17:11,739 INFO L112 eAbstractionObserver]: Analyzing ICFG mix004.oepc.i [2022-12-13 09:17:11,751 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:17:11,751 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:17:11,751 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:17:11,820 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:17:11,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 288 flow [2022-12-13 09:17:11,914 INFO L130 PetriNetUnfolder]: 2/130 cut-off events. [2022-12-13 09:17:11,914 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:17:11,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-13 09:17:11,920 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 134 transitions, 288 flow [2022-12-13 09:17:11,925 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 130 transitions, 272 flow [2022-12-13 09:17:11,928 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:17:11,946 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 130 transitions, 272 flow [2022-12-13 09:17:11,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 272 flow [2022-12-13 09:17:11,986 INFO L130 PetriNetUnfolder]: 2/130 cut-off events. [2022-12-13 09:17:11,986 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:17:11,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-13 09:17:11,991 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 130 transitions, 272 flow [2022-12-13 09:17:11,991 INFO L226 LiptonReduction]: Number of co-enabled transitions 3286 [2022-12-13 09:17:17,077 INFO L241 LiptonReduction]: Total number of compositions: 102 [2022-12-13 09:17:17,093 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:17:17,100 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;@5ecaec25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:17:17,100 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 09:17:17,102 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 09:17:17,102 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:17:17,102 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:17:17,103 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 09:17:17,103 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:17:17,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:17:17,106 INFO L85 PathProgramCache]: Analyzing trace with hash 576591, now seen corresponding path program 1 times [2022-12-13 09:17:17,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:17:17,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940187732] [2022-12-13 09:17:17,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:17:17,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:17:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:17:17,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:17:17,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:17:17,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940187732] [2022-12-13 09:17:17,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940187732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:17:17,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:17:17,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:17:17,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918089223] [2022-12-13 09:17:17,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:17:17,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:17:17,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:17:17,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:17:17,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:17:17,419 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 83 [2022-12-13 09:17:17,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 83 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:17,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:17:17,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 83 [2022-12-13 09:17:17,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:17:24,593 INFO L130 PetriNetUnfolder]: 66790/93793 cut-off events. [2022-12-13 09:17:24,593 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2022-12-13 09:17:24,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182082 conditions, 93793 events. 66790/93793 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 4472. Compared 679595 event pairs, 37024 based on Foata normal form. 0/59826 useless extension candidates. Maximal degree in co-relation 182070. Up to 73765 conditions per place. [2022-12-13 09:17:24,908 INFO L137 encePairwiseOnDemand]: 79/83 looper letters, 48 selfloop transitions, 2 changer transitions 71/138 dead transitions. [2022-12-13 09:17:24,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 138 transitions, 537 flow [2022-12-13 09:17:24,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:17:24,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:17:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2022-12-13 09:17:24,916 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7108433734939759 [2022-12-13 09:17:24,918 INFO L175 Difference]: Start difference. First operand has 96 places, 83 transitions, 178 flow. Second operand 3 states and 177 transitions. [2022-12-13 09:17:24,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 138 transitions, 537 flow [2022-12-13 09:17:24,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 138 transitions, 530 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 09:17:24,924 INFO L231 Difference]: Finished difference. Result has 92 places, 45 transitions, 102 flow [2022-12-13 09:17:24,925 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=92, PETRI_TRANSITIONS=45} [2022-12-13 09:17:24,927 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -4 predicate places. [2022-12-13 09:17:24,928 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:17:24,928 INFO L89 Accepts]: Start accepts. Operand has 92 places, 45 transitions, 102 flow [2022-12-13 09:17:24,931 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:17:24,931 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:17:24,932 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 45 transitions, 102 flow [2022-12-13 09:17:24,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 45 transitions, 102 flow [2022-12-13 09:17:24,938 INFO L130 PetriNetUnfolder]: 0/45 cut-off events. [2022-12-13 09:17:24,938 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:17:24,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 45 events. 0/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 09:17:24,942 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 45 transitions, 102 flow [2022-12-13 09:17:24,942 INFO L226 LiptonReduction]: Number of co-enabled transitions 1218 [2022-12-13 09:17:25,089 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:17:25,090 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-13 09:17:25,090 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 102 flow [2022-12-13 09:17:25,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:25,091 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:17:25,091 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:17:25,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:17:25,091 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:17:25,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:17:25,091 INFO L85 PathProgramCache]: Analyzing trace with hash -567839096, now seen corresponding path program 1 times [2022-12-13 09:17:25,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:17:25,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719702101] [2022-12-13 09:17:25,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:17:25,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:17:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:17:25,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:17:25,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:17:25,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719702101] [2022-12-13 09:17:25,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719702101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:17:25,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:17:25,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:17:25,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777143063] [2022-12-13 09:17:25,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:17:25,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:17:25,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:17:25,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:17:25,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:17:25,269 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2022-12-13 09:17:25,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:25,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:17:25,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2022-12-13 09:17:25,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:17:27,736 INFO L130 PetriNetUnfolder]: 29395/40363 cut-off events. [2022-12-13 09:17:27,736 INFO L131 PetriNetUnfolder]: For 1559/1559 co-relation queries the response was YES. [2022-12-13 09:17:27,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81305 conditions, 40363 events. 29395/40363 cut-off events. For 1559/1559 co-relation queries the response was YES. Maximal size of possible extension queue 1205. Compared 228981 event pairs, 15975 based on Foata normal form. 0/32889 useless extension candidates. Maximal degree in co-relation 81295. Up to 38549 conditions per place. [2022-12-13 09:17:27,952 INFO L137 encePairwiseOnDemand]: 39/45 looper letters, 44 selfloop transitions, 5 changer transitions 2/62 dead transitions. [2022-12-13 09:17:27,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 246 flow [2022-12-13 09:17:27,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:17:27,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:17:27,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2022-12-13 09:17:27,957 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2022-12-13 09:17:27,957 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 102 flow. Second operand 3 states and 85 transitions. [2022-12-13 09:17:27,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 246 flow [2022-12-13 09:17:27,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:17:27,958 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 129 flow [2022-12-13 09:17:27,959 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2022-12-13 09:17:27,959 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -39 predicate places. [2022-12-13 09:17:27,959 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:17:27,959 INFO L89 Accepts]: Start accepts. Operand has 57 places, 48 transitions, 129 flow [2022-12-13 09:17:27,960 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:17:27,960 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:17:27,960 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 48 transitions, 129 flow [2022-12-13 09:17:27,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 48 transitions, 129 flow [2022-12-13 09:17:27,974 INFO L130 PetriNetUnfolder]: 45/220 cut-off events. [2022-12-13 09:17:27,975 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:17:27,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 220 events. 45/220 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1219 event pairs, 23 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 303. Up to 76 conditions per place. [2022-12-13 09:17:27,978 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 48 transitions, 129 flow [2022-12-13 09:17:27,978 INFO L226 LiptonReduction]: Number of co-enabled transitions 1240 [2022-12-13 09:17:28,039 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:17:28,042 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-13 09:17:28,044 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 129 flow [2022-12-13 09:17:28,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:28,045 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:17:28,045 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:17:28,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:17:28,046 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:17:28,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:17:28,047 INFO L85 PathProgramCache]: Analyzing trace with hash 495794761, now seen corresponding path program 1 times [2022-12-13 09:17:28,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:17:28,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262618967] [2022-12-13 09:17:28,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:17:28,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:17:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:17:28,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:17:28,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:17:28,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262618967] [2022-12-13 09:17:28,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262618967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:17:28,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:17:28,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:17:28,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289602990] [2022-12-13 09:17:28,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:17:28,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:17:28,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:17:28,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:17:28,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:17:28,311 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2022-12-13 09:17:28,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:28,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:17:28,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2022-12-13 09:17:28,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:17:29,749 INFO L130 PetriNetUnfolder]: 14737/21041 cut-off events. [2022-12-13 09:17:29,750 INFO L131 PetriNetUnfolder]: For 1480/1480 co-relation queries the response was YES. [2022-12-13 09:17:29,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43380 conditions, 21041 events. 14737/21041 cut-off events. For 1480/1480 co-relation queries the response was YES. Maximal size of possible extension queue 885. Compared 126187 event pairs, 4487 based on Foata normal form. 326/17269 useless extension candidates. Maximal degree in co-relation 43369. Up to 14895 conditions per place. [2022-12-13 09:17:29,856 INFO L137 encePairwiseOnDemand]: 41/44 looper letters, 41 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2022-12-13 09:17:29,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 245 flow [2022-12-13 09:17:29,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:17:29,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:17:29,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2022-12-13 09:17:29,857 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6742424242424242 [2022-12-13 09:17:29,857 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 129 flow. Second operand 3 states and 89 transitions. [2022-12-13 09:17:29,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 245 flow [2022-12-13 09:17:29,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 62 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:17:29,860 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 135 flow [2022-12-13 09:17:29,860 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2022-12-13 09:17:29,861 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -38 predicate places. [2022-12-13 09:17:29,862 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:17:29,862 INFO L89 Accepts]: Start accepts. Operand has 58 places, 48 transitions, 135 flow [2022-12-13 09:17:29,863 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:17:29,863 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:17:29,863 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 48 transitions, 135 flow [2022-12-13 09:17:29,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 48 transitions, 135 flow [2022-12-13 09:17:29,871 INFO L130 PetriNetUnfolder]: 29/143 cut-off events. [2022-12-13 09:17:29,871 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-13 09:17:29,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 143 events. 29/143 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 684 event pairs, 11 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 223. Up to 53 conditions per place. [2022-12-13 09:17:29,873 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 48 transitions, 135 flow [2022-12-13 09:17:29,873 INFO L226 LiptonReduction]: Number of co-enabled transitions 1236 [2022-12-13 09:17:29,880 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:17:29,884 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 09:17:29,884 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 135 flow [2022-12-13 09:17:29,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:29,884 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:17:29,884 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:17:29,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:17:29,884 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:17:29,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:17:29,885 INFO L85 PathProgramCache]: Analyzing trace with hash -234689101, now seen corresponding path program 1 times [2022-12-13 09:17:29,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:17:29,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612544982] [2022-12-13 09:17:29,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:17:29,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:17:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:17:30,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:17:30,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:17:30,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612544982] [2022-12-13 09:17:30,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612544982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:17:30,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:17:30,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:17:30,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911353402] [2022-12-13 09:17:30,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:17:30,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:17:30,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:17:30,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:17:30,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:17:30,015 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2022-12-13 09:17:30,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:30,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:17:30,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2022-12-13 09:17:30,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:17:31,591 INFO L130 PetriNetUnfolder]: 20471/28462 cut-off events. [2022-12-13 09:17:31,592 INFO L131 PetriNetUnfolder]: For 7284/7284 co-relation queries the response was YES. [2022-12-13 09:17:31,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63465 conditions, 28462 events. 20471/28462 cut-off events. For 7284/7284 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 161532 event pairs, 5239 based on Foata normal form. 360/24620 useless extension candidates. Maximal degree in co-relation 63452. Up to 21001 conditions per place. [2022-12-13 09:17:31,817 INFO L137 encePairwiseOnDemand]: 41/44 looper letters, 54 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2022-12-13 09:17:31,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 68 transitions, 300 flow [2022-12-13 09:17:31,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:17:31,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:17:31,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-12-13 09:17:31,818 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6590909090909091 [2022-12-13 09:17:31,818 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 135 flow. Second operand 3 states and 87 transitions. [2022-12-13 09:17:31,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 68 transitions, 300 flow [2022-12-13 09:17:31,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 68 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:17:31,843 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 140 flow [2022-12-13 09:17:31,843 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2022-12-13 09:17:31,845 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -37 predicate places. [2022-12-13 09:17:31,845 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:17:31,845 INFO L89 Accepts]: Start accepts. Operand has 59 places, 48 transitions, 140 flow [2022-12-13 09:17:31,846 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:17:31,846 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:17:31,846 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 48 transitions, 140 flow [2022-12-13 09:17:31,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 48 transitions, 140 flow [2022-12-13 09:17:31,855 INFO L130 PetriNetUnfolder]: 21/131 cut-off events. [2022-12-13 09:17:31,855 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-13 09:17:31,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 131 events. 21/131 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 617 event pairs, 7 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 207. Up to 41 conditions per place. [2022-12-13 09:17:31,857 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 48 transitions, 140 flow [2022-12-13 09:17:31,857 INFO L226 LiptonReduction]: Number of co-enabled transitions 1232 [2022-12-13 09:17:31,858 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:17:31,859 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 09:17:31,859 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 140 flow [2022-12-13 09:17:31,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:31,860 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:17:31,860 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:17:31,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:17:31,860 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:17:31,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:17:31,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1049725091, now seen corresponding path program 1 times [2022-12-13 09:17:31,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:17:31,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380679585] [2022-12-13 09:17:31,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:17:31,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:17:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:17:31,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:17:31,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:17:31,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380679585] [2022-12-13 09:17:31,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380679585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:17:31,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:17:31,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:17:31,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403144469] [2022-12-13 09:17:31,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:17:31,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:17:31,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:17:31,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:17:31,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:17:31,992 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2022-12-13 09:17:31,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:31,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:17:31,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2022-12-13 09:17:31,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:17:34,068 INFO L130 PetriNetUnfolder]: 22911/31678 cut-off events. [2022-12-13 09:17:34,068 INFO L131 PetriNetUnfolder]: For 8316/8826 co-relation queries the response was YES. [2022-12-13 09:17:34,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68713 conditions, 31678 events. 22911/31678 cut-off events. For 8316/8826 co-relation queries the response was YES. Maximal size of possible extension queue 1398. Compared 188476 event pairs, 7265 based on Foata normal form. 189/21909 useless extension candidates. Maximal degree in co-relation 68699. Up to 30475 conditions per place. [2022-12-13 09:17:34,245 INFO L137 encePairwiseOnDemand]: 30/44 looper letters, 46 selfloop transitions, 13 changer transitions 0/75 dead transitions. [2022-12-13 09:17:34,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 75 transitions, 318 flow [2022-12-13 09:17:34,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:17:34,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:17:34,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2022-12-13 09:17:34,246 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2022-12-13 09:17:34,247 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 140 flow. Second operand 3 states and 96 transitions. [2022-12-13 09:17:34,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 75 transitions, 318 flow [2022-12-13 09:17:34,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 75 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:17:34,250 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 223 flow [2022-12-13 09:17:34,250 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=223, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2022-12-13 09:17:34,250 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -36 predicate places. [2022-12-13 09:17:34,250 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:17:34,251 INFO L89 Accepts]: Start accepts. Operand has 60 places, 60 transitions, 223 flow [2022-12-13 09:17:34,251 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:17:34,251 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:17:34,251 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 60 transitions, 223 flow [2022-12-13 09:17:34,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 60 transitions, 223 flow [2022-12-13 09:17:34,391 INFO L130 PetriNetUnfolder]: 2216/3823 cut-off events. [2022-12-13 09:17:34,391 INFO L131 PetriNetUnfolder]: For 519/633 co-relation queries the response was YES. [2022-12-13 09:17:34,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7724 conditions, 3823 events. 2216/3823 cut-off events. For 519/633 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 29017 event pairs, 1167 based on Foata normal form. 3/1820 useless extension candidates. Maximal degree in co-relation 7712. Up to 3259 conditions per place. [2022-12-13 09:17:34,424 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 60 transitions, 223 flow [2022-12-13 09:17:34,424 INFO L226 LiptonReduction]: Number of co-enabled transitions 1522 [2022-12-13 09:17:34,463 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:17:34,465 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-13 09:17:34,465 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 60 transitions, 223 flow [2022-12-13 09:17:34,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:34,465 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:17:34,465 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:17:34,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:17:34,465 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:17:34,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:17:34,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1488096575, now seen corresponding path program 1 times [2022-12-13 09:17:34,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:17:34,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410964616] [2022-12-13 09:17:34,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:17:34,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:17:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:17:34,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:17:34,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:17:34,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410964616] [2022-12-13 09:17:34,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410964616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:17:34,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:17:34,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:17:34,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414207539] [2022-12-13 09:17:34,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:17:34,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:17:34,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:17:34,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:17:34,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:17:34,627 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2022-12-13 09:17:34,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 223 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:34,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:17:34,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2022-12-13 09:17:34,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:17:36,179 INFO L130 PetriNetUnfolder]: 15087/22066 cut-off events. [2022-12-13 09:17:36,179 INFO L131 PetriNetUnfolder]: For 6196/6430 co-relation queries the response was YES. [2022-12-13 09:17:36,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60380 conditions, 22066 events. 15087/22066 cut-off events. For 6196/6430 co-relation queries the response was YES. Maximal size of possible extension queue 1077. Compared 139893 event pairs, 2774 based on Foata normal form. 702/15998 useless extension candidates. Maximal degree in co-relation 60365. Up to 18064 conditions per place. [2022-12-13 09:17:36,321 INFO L137 encePairwiseOnDemand]: 30/44 looper letters, 59 selfloop transitions, 25 changer transitions 0/100 dead transitions. [2022-12-13 09:17:36,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 100 transitions, 505 flow [2022-12-13 09:17:36,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:17:36,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:17:36,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-12-13 09:17:36,322 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7556818181818182 [2022-12-13 09:17:36,322 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 223 flow. Second operand 4 states and 133 transitions. [2022-12-13 09:17:36,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 100 transitions, 505 flow [2022-12-13 09:17:36,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 100 transitions, 492 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:17:36,326 INFO L231 Difference]: Finished difference. Result has 63 places, 72 transitions, 358 flow [2022-12-13 09:17:36,326 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=358, PETRI_PLACES=63, PETRI_TRANSITIONS=72} [2022-12-13 09:17:36,327 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -33 predicate places. [2022-12-13 09:17:36,327 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:17:36,327 INFO L89 Accepts]: Start accepts. Operand has 63 places, 72 transitions, 358 flow [2022-12-13 09:17:36,327 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:17:36,327 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:17:36,328 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 72 transitions, 358 flow [2022-12-13 09:17:36,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 72 transitions, 358 flow [2022-12-13 09:17:36,452 INFO L130 PetriNetUnfolder]: 1754/3055 cut-off events. [2022-12-13 09:17:36,452 INFO L131 PetriNetUnfolder]: For 630/2181 co-relation queries the response was YES. [2022-12-13 09:17:36,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9043 conditions, 3055 events. 1754/3055 cut-off events. For 630/2181 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 22708 event pairs, 465 based on Foata normal form. 11/1565 useless extension candidates. Maximal degree in co-relation 9029. Up to 2557 conditions per place. [2022-12-13 09:17:36,481 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 72 transitions, 358 flow [2022-12-13 09:17:36,481 INFO L226 LiptonReduction]: Number of co-enabled transitions 1924 [2022-12-13 09:17:36,498 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:17:36,499 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-13 09:17:36,499 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 72 transitions, 358 flow [2022-12-13 09:17:36,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:36,499 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:17:36,499 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:17:36,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:17:36,499 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:17:36,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:17:36,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1317317184, now seen corresponding path program 1 times [2022-12-13 09:17:36,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:17:36,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779099653] [2022-12-13 09:17:36,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:17:36,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:17:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:17:36,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:17:36,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:17:36,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779099653] [2022-12-13 09:17:36,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779099653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:17:36,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:17:36,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:17:36,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132004402] [2022-12-13 09:17:36,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:17:36,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:17:36,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:17:36,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:17:36,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:17:36,630 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2022-12-13 09:17:36,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 72 transitions, 358 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:36,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:17:36,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2022-12-13 09:17:36,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:17:38,982 INFO L130 PetriNetUnfolder]: 22603/34233 cut-off events. [2022-12-13 09:17:38,982 INFO L131 PetriNetUnfolder]: For 23205/27691 co-relation queries the response was YES. [2022-12-13 09:17:39,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111005 conditions, 34233 events. 22603/34233 cut-off events. For 23205/27691 co-relation queries the response was YES. Maximal size of possible extension queue 1711. Compared 249009 event pairs, 4513 based on Foata normal form. 1800/29643 useless extension candidates. Maximal degree in co-relation 110988. Up to 18179 conditions per place. [2022-12-13 09:17:39,190 INFO L137 encePairwiseOnDemand]: 41/44 looper letters, 112 selfloop transitions, 3 changer transitions 0/139 dead transitions. [2022-12-13 09:17:39,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 139 transitions, 937 flow [2022-12-13 09:17:39,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:17:39,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:17:39,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2022-12-13 09:17:39,191 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7102272727272727 [2022-12-13 09:17:39,191 INFO L175 Difference]: Start difference. First operand has 63 places, 72 transitions, 358 flow. Second operand 4 states and 125 transitions. [2022-12-13 09:17:39,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 139 transitions, 937 flow [2022-12-13 09:17:39,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 139 transitions, 831 flow, removed 26 selfloop flow, removed 2 redundant places. [2022-12-13 09:17:39,198 INFO L231 Difference]: Finished difference. Result has 66 places, 74 transitions, 333 flow [2022-12-13 09:17:39,198 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=333, PETRI_PLACES=66, PETRI_TRANSITIONS=74} [2022-12-13 09:17:39,199 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -30 predicate places. [2022-12-13 09:17:39,199 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:17:39,199 INFO L89 Accepts]: Start accepts. Operand has 66 places, 74 transitions, 333 flow [2022-12-13 09:17:39,200 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:17:39,200 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:17:39,200 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 74 transitions, 333 flow [2022-12-13 09:17:39,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 74 transitions, 333 flow [2022-12-13 09:17:39,443 INFO L130 PetriNetUnfolder]: 3463/5938 cut-off events. [2022-12-13 09:17:39,444 INFO L131 PetriNetUnfolder]: For 1846/3046 co-relation queries the response was YES. [2022-12-13 09:17:39,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16658 conditions, 5938 events. 3463/5938 cut-off events. For 1846/3046 co-relation queries the response was YES. Maximal size of possible extension queue 981. Compared 47560 event pairs, 927 based on Foata normal form. 16/2827 useless extension candidates. Maximal degree in co-relation 16643. Up to 5131 conditions per place. [2022-12-13 09:17:39,488 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 74 transitions, 333 flow [2022-12-13 09:17:39,488 INFO L226 LiptonReduction]: Number of co-enabled transitions 1986 [2022-12-13 09:17:39,491 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [452] $Ultimate##0-->L807: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_~y~0_10 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_10, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~y~0] and [393] L787-->L790: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] [2022-12-13 09:17:39,614 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:17:39,615 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 416 [2022-12-13 09:17:39,615 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 74 transitions, 336 flow [2022-12-13 09:17:39,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:39,615 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:17:39,615 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:17:39,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:17:39,616 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:17:39,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:17:39,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1838111769, now seen corresponding path program 1 times [2022-12-13 09:17:39,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:17:39,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67591145] [2022-12-13 09:17:39,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:17:39,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:17:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:17:39,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:17:39,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:17:39,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67591145] [2022-12-13 09:17:39,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67591145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:17:39,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:17:39,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:17:39,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138527581] [2022-12-13 09:17:39,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:17:39,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:17:39,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:17:39,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:17:39,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:17:39,820 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2022-12-13 09:17:39,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 74 transitions, 336 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:39,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:17:39,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2022-12-13 09:17:39,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:17:45,017 INFO L130 PetriNetUnfolder]: 42967/63840 cut-off events. [2022-12-13 09:17:45,017 INFO L131 PetriNetUnfolder]: For 54740/60179 co-relation queries the response was YES. [2022-12-13 09:17:45,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199760 conditions, 63840 events. 42967/63840 cut-off events. For 54740/60179 co-relation queries the response was YES. Maximal size of possible extension queue 3025. Compared 479245 event pairs, 2783 based on Foata normal form. 2657/55140 useless extension candidates. Maximal degree in co-relation 199742. Up to 31299 conditions per place. [2022-12-13 09:17:45,381 INFO L137 encePairwiseOnDemand]: 37/45 looper letters, 122 selfloop transitions, 11 changer transitions 17/169 dead transitions. [2022-12-13 09:17:45,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 169 transitions, 1062 flow [2022-12-13 09:17:45,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:17:45,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:17:45,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 166 transitions. [2022-12-13 09:17:45,383 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6148148148148148 [2022-12-13 09:17:45,383 INFO L175 Difference]: Start difference. First operand has 66 places, 74 transitions, 336 flow. Second operand 6 states and 166 transitions. [2022-12-13 09:17:45,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 169 transitions, 1062 flow [2022-12-13 09:17:45,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 169 transitions, 1056 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:17:45,400 INFO L231 Difference]: Finished difference. Result has 74 places, 78 transitions, 396 flow [2022-12-13 09:17:45,400 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=396, PETRI_PLACES=74, PETRI_TRANSITIONS=78} [2022-12-13 09:17:45,400 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -22 predicate places. [2022-12-13 09:17:45,401 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:17:45,401 INFO L89 Accepts]: Start accepts. Operand has 74 places, 78 transitions, 396 flow [2022-12-13 09:17:45,402 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:17:45,402 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:17:45,403 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 78 transitions, 396 flow [2022-12-13 09:17:45,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 78 transitions, 396 flow [2022-12-13 09:17:46,157 INFO L130 PetriNetUnfolder]: 6650/12092 cut-off events. [2022-12-13 09:17:46,158 INFO L131 PetriNetUnfolder]: For 6461/10568 co-relation queries the response was YES. [2022-12-13 09:17:46,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34258 conditions, 12092 events. 6650/12092 cut-off events. For 6461/10568 co-relation queries the response was YES. Maximal size of possible extension queue 1755. Compared 113085 event pairs, 1875 based on Foata normal form. 22/6128 useless extension candidates. Maximal degree in co-relation 34238. Up to 9910 conditions per place. [2022-12-13 09:17:46,239 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 78 transitions, 396 flow [2022-12-13 09:17:46,239 INFO L226 LiptonReduction]: Number of co-enabled transitions 2048 [2022-12-13 09:17:46,351 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [435] $Ultimate##0-->L830: Formula: (and (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= v_~z~0_5 1) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5)) InVars {P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~z~0=v_~z~0_5, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_~arg.offset, ~z~0, P3Thread1of1ForFork2_~arg.base] and [393] L787-->L790: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] [2022-12-13 09:17:46,369 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [435] $Ultimate##0-->L830: Formula: (and (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= v_~z~0_5 1) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5)) InVars {P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~z~0=v_~z~0_5, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_~arg.offset, ~z~0, P3Thread1of1ForFork2_~arg.base] and [386] L767-->L770: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] [2022-12-13 09:17:46,571 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:17:46,571 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1170 [2022-12-13 09:17:46,572 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 410 flow [2022-12-13 09:17:46,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:46,572 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:17:46,572 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:17:46,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:17:46,572 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:17:46,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:17:46,572 INFO L85 PathProgramCache]: Analyzing trace with hash -731994994, now seen corresponding path program 1 times [2022-12-13 09:17:46,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:17:46,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907989565] [2022-12-13 09:17:46,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:17:46,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:17:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:17:46,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:17:46,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:17:46,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907989565] [2022-12-13 09:17:46,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907989565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:17:46,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:17:46,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:17:46,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52220753] [2022-12-13 09:17:46,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:17:46,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:17:46,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:17:46,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:17:46,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:17:46,709 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2022-12-13 09:17:46,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 78 transitions, 410 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:46,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:17:46,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2022-12-13 09:17:46,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:17:49,077 INFO L130 PetriNetUnfolder]: 20423/32178 cut-off events. [2022-12-13 09:17:49,077 INFO L131 PetriNetUnfolder]: For 15252/15406 co-relation queries the response was YES. [2022-12-13 09:17:49,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100710 conditions, 32178 events. 20423/32178 cut-off events. For 15252/15406 co-relation queries the response was YES. Maximal size of possible extension queue 1413. Compared 245501 event pairs, 1544 based on Foata normal form. 2378/22973 useless extension candidates. Maximal degree in co-relation 100687. Up to 16363 conditions per place. [2022-12-13 09:17:49,257 INFO L137 encePairwiseOnDemand]: 35/49 looper letters, 76 selfloop transitions, 37 changer transitions 0/129 dead transitions. [2022-12-13 09:17:49,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 129 transitions, 813 flow [2022-12-13 09:17:49,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:17:49,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:17:49,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2022-12-13 09:17:49,259 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7061224489795919 [2022-12-13 09:17:49,259 INFO L175 Difference]: Start difference. First operand has 74 places, 78 transitions, 410 flow. Second operand 5 states and 173 transitions. [2022-12-13 09:17:49,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 129 transitions, 813 flow [2022-12-13 09:17:49,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 129 transitions, 779 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-13 09:17:49,273 INFO L231 Difference]: Finished difference. Result has 76 places, 90 transitions, 572 flow [2022-12-13 09:17:49,273 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=572, PETRI_PLACES=76, PETRI_TRANSITIONS=90} [2022-12-13 09:17:49,273 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -20 predicate places. [2022-12-13 09:17:49,273 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:17:49,273 INFO L89 Accepts]: Start accepts. Operand has 76 places, 90 transitions, 572 flow [2022-12-13 09:17:49,274 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:17:49,274 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:17:49,275 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 90 transitions, 572 flow [2022-12-13 09:17:49,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 90 transitions, 572 flow [2022-12-13 09:17:49,801 INFO L130 PetriNetUnfolder]: 4148/8289 cut-off events. [2022-12-13 09:17:49,801 INFO L131 PetriNetUnfolder]: For 4660/12105 co-relation queries the response was YES. [2022-12-13 09:17:49,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31301 conditions, 8289 events. 4148/8289 cut-off events. For 4660/12105 co-relation queries the response was YES. Maximal size of possible extension queue 1242. Compared 79950 event pairs, 337 based on Foata normal form. 27/4229 useless extension candidates. Maximal degree in co-relation 31281. Up to 6652 conditions per place. [2022-12-13 09:17:49,869 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 90 transitions, 572 flow [2022-12-13 09:17:49,869 INFO L226 LiptonReduction]: Number of co-enabled transitions 2064 [2022-12-13 09:17:49,929 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [435] $Ultimate##0-->L830: Formula: (and (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= v_~z~0_5 1) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5)) InVars {P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~z~0=v_~z~0_5, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_~arg.offset, ~z~0, P3Thread1of1ForFork2_~arg.base] and [580] $Ultimate##0-->L810: Formula: (and (= |v_P2Thread1of1ForFork0_#in~arg.base_18| v_P2Thread1of1ForFork0_~arg.base_18) (= v_~y~0_51 v_~__unbuffered_p2_EAX~0_146) (= v_~y~0_51 1) (= |v_P2Thread1of1ForFork0_#in~arg.offset_18| v_P2Thread1of1ForFork0_~arg.offset_18)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_18|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_18|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_18, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_18|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_146, ~y~0=v_~y~0_51, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_18|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0, ~y~0] [2022-12-13 09:17:50,061 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [586] $Ultimate##0-->L813: Formula: (and (= |v_P3Thread1of1ForFork2_#in~arg.base_21| v_P3Thread1of1ForFork2_~arg.base_21) (= v_P3Thread1of1ForFork2_~arg.offset_21 |v_P3Thread1of1ForFork2_#in~arg.offset_21|) (= v_~__unbuffered_p2_EBX~0_154 v_~z~0_52) (= v_~y~0_59 v_~__unbuffered_p2_EAX~0_156) (= |v_P2Thread1of1ForFork0_#in~arg.base_24| v_P2Thread1of1ForFork0_~arg.base_24) (= v_~y~0_59 1) (= v_~z~0_52 1) (= |v_P2Thread1of1ForFork0_#in~arg.offset_24| v_P2Thread1of1ForFork0_~arg.offset_24)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_24|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_21|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_24|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_21|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_154, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_24|, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_21, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_24, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_156, ~z~0=v_~z~0_52, ~y~0=v_~y~0_59, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_24|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_21, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_21|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, ~__unbuffered_p2_EBX~0, P3Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0, ~z~0, ~y~0, P3Thread1of1ForFork2_~arg.base] and [408] L830-->L833: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0] [2022-12-13 09:17:50,181 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:17:50,182 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 909 [2022-12-13 09:17:50,182 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 89 transitions, 573 flow [2022-12-13 09:17:50,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:50,183 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:17:50,183 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:17:50,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:17:50,183 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:17:50,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:17:50,183 INFO L85 PathProgramCache]: Analyzing trace with hash 964231914, now seen corresponding path program 1 times [2022-12-13 09:17:50,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:17:50,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893785534] [2022-12-13 09:17:50,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:17:50,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:17:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:17:50,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:17:50,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:17:50,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893785534] [2022-12-13 09:17:50,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893785534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:17:50,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:17:50,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:17:50,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068064559] [2022-12-13 09:17:50,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:17:50,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:17:50,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:17:50,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:17:50,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:17:50,797 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 49 [2022-12-13 09:17:50,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 89 transitions, 573 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:50,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:17:50,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 49 [2022-12-13 09:17:50,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:17:57,058 INFO L130 PetriNetUnfolder]: 52516/81354 cut-off events. [2022-12-13 09:17:57,058 INFO L131 PetriNetUnfolder]: For 106638/120261 co-relation queries the response was YES. [2022-12-13 09:17:57,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317562 conditions, 81354 events. 52516/81354 cut-off events. For 106638/120261 co-relation queries the response was YES. Maximal size of possible extension queue 3706. Compared 677463 event pairs, 4144 based on Foata normal form. 5605/70779 useless extension candidates. Maximal degree in co-relation 317539. Up to 43040 conditions per place. [2022-12-13 09:17:57,574 INFO L137 encePairwiseOnDemand]: 32/49 looper letters, 224 selfloop transitions, 38 changer transitions 46/331 dead transitions. [2022-12-13 09:17:57,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 331 transitions, 2595 flow [2022-12-13 09:17:57,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 09:17:57,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 09:17:57,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 319 transitions. [2022-12-13 09:17:57,577 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5918367346938775 [2022-12-13 09:17:57,577 INFO L175 Difference]: Start difference. First operand has 75 places, 89 transitions, 573 flow. Second operand 11 states and 319 transitions. [2022-12-13 09:17:57,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 331 transitions, 2595 flow [2022-12-13 09:18:10,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 331 transitions, 2257 flow, removed 82 selfloop flow, removed 3 redundant places. [2022-12-13 09:18:10,490 INFO L231 Difference]: Finished difference. Result has 89 places, 122 transitions, 735 flow [2022-12-13 09:18:10,491 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=735, PETRI_PLACES=89, PETRI_TRANSITIONS=122} [2022-12-13 09:18:10,493 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -7 predicate places. [2022-12-13 09:18:10,493 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:18:10,493 INFO L89 Accepts]: Start accepts. Operand has 89 places, 122 transitions, 735 flow [2022-12-13 09:18:10,512 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:18:10,512 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:18:10,512 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 122 transitions, 735 flow [2022-12-13 09:18:10,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 122 transitions, 735 flow [2022-12-13 09:18:12,710 INFO L130 PetriNetUnfolder]: 17432/33128 cut-off events. [2022-12-13 09:18:12,712 INFO L131 PetriNetUnfolder]: For 32515/34976 co-relation queries the response was YES. [2022-12-13 09:18:12,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107206 conditions, 33128 events. 17432/33128 cut-off events. For 32515/34976 co-relation queries the response was YES. Maximal size of possible extension queue 4275. Compared 360737 event pairs, 1347 based on Foata normal form. 322/16110 useless extension candidates. Maximal degree in co-relation 107179. Up to 20980 conditions per place. [2022-12-13 09:18:13,093 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 122 transitions, 735 flow [2022-12-13 09:18:13,093 INFO L226 LiptonReduction]: Number of co-enabled transitions 3376 [2022-12-13 09:18:13,154 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [582] $Ultimate##0-->L790: Formula: (and (= v_~z~0_44 1) (= |v_P3Thread1of1ForFork2_#in~arg.base_13| v_P3Thread1of1ForFork2_~arg.base_13) (= v_P3Thread1of1ForFork2_~arg.offset_13 |v_P3Thread1of1ForFork2_#in~arg.offset_13|) (= v_~y~0_55 v_~__unbuffered_p1_EAX~0_157)) InVars {P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_13|, ~y~0=v_~y~0_55, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_13|} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_157, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_13, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_13|, ~z~0=v_~z~0_44, ~y~0=v_~y~0_55, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_13, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_13|} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0, P3Thread1of1ForFork2_~arg.offset, ~z~0, P3Thread1of1ForFork2_~arg.base] and [408] L830-->L833: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0] [2022-12-13 09:18:13,953 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] L833-->L849: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse7 (not .cse5)) (.cse11 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse6 (and .cse5 .cse3)) (.cse8 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5))) (let ((.cse1 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_139 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse9 (or .cse11 .cse6 .cse8)) (.cse10 (and .cse7 (not .cse11)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$r_buff1_thd4~0_55 (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse2 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse1 .cse2) (and .cse2 .cse3) .cse4)) v_~a$r_buff1_thd4~0_56 0))) (= v_~a~0_99 v_~a$mem_tmp~0_16) (= v_~a$w_buff0~0_63 v_~a$w_buff0~0_62) (= v_~a~0_98 (ite .cse0 v_~a$mem_tmp~0_16 v_~__unbuffered_p3_EBX~0_14)) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse1 .cse5) .cse6 .cse4) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse4) .cse7) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse6 .cse8 .cse4) v_~a$w_buff1_used~0_127 0))) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~a$w_buff1~0_54 v_~a$w_buff1~0_53) (= (ite .cse9 v_~a~0_99 (ite .cse10 v_~a$w_buff0~0_63 v_~a$w_buff1~0_54)) v_~__unbuffered_p3_EBX~0_14) (= v_~a$w_buff0_used~0_139 (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse9 v_~a$w_buff0_used~0_140 (ite .cse10 0 v_~a$w_buff0_used~0_140)))))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_99, ~a$w_buff1~0=v_~a$w_buff1~0_54, ~a$w_buff0~0=v_~a$w_buff0~0_63, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, ~a~0=v_~a~0_98, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_53, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_62, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3] and [402] L813-->L820: Formula: (let ((.cse4 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd3~0_18 256) 0)))) (let ((.cse1 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse0 (and .cse4 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72) (= v_~a~0_54 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse1 v_~a$w_buff1~0_29 v_~a~0_55))) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse4 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_18) v_~a$r_buff1_thd3~0_17) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse0 0 v_~a$r_buff0_thd3~0_20))))) InVars {~a~0=v_~a~0_55, ~a$w_buff1~0=v_~a$w_buff1~0_29, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_54, ~a$w_buff1~0=v_~a$w_buff1~0_29, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0] [2022-12-13 09:18:14,181 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] L833-->L849: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse7 (not .cse5)) (.cse11 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse6 (and .cse5 .cse3)) (.cse8 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5))) (let ((.cse1 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_139 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse9 (or .cse11 .cse6 .cse8)) (.cse10 (and .cse7 (not .cse11)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$r_buff1_thd4~0_55 (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse2 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse1 .cse2) (and .cse2 .cse3) .cse4)) v_~a$r_buff1_thd4~0_56 0))) (= v_~a~0_99 v_~a$mem_tmp~0_16) (= v_~a$w_buff0~0_63 v_~a$w_buff0~0_62) (= v_~a~0_98 (ite .cse0 v_~a$mem_tmp~0_16 v_~__unbuffered_p3_EBX~0_14)) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse1 .cse5) .cse6 .cse4) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse4) .cse7) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse6 .cse8 .cse4) v_~a$w_buff1_used~0_127 0))) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~a$w_buff1~0_54 v_~a$w_buff1~0_53) (= (ite .cse9 v_~a~0_99 (ite .cse10 v_~a$w_buff0~0_63 v_~a$w_buff1~0_54)) v_~__unbuffered_p3_EBX~0_14) (= v_~a$w_buff0_used~0_139 (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse9 v_~a$w_buff0_used~0_140 (ite .cse10 0 v_~a$w_buff0_used~0_140)))))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_99, ~a$w_buff1~0=v_~a$w_buff1~0_54, ~a$w_buff0~0=v_~a$w_buff0~0_63, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, ~a~0=v_~a~0_98, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_53, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_62, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3] and [393] L787-->L790: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] [2022-12-13 09:18:14,301 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] L833-->L849: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse7 (not .cse5)) (.cse11 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse6 (and .cse5 .cse3)) (.cse8 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5))) (let ((.cse1 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_139 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse9 (or .cse11 .cse6 .cse8)) (.cse10 (and .cse7 (not .cse11)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$r_buff1_thd4~0_55 (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse2 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse1 .cse2) (and .cse2 .cse3) .cse4)) v_~a$r_buff1_thd4~0_56 0))) (= v_~a~0_99 v_~a$mem_tmp~0_16) (= v_~a$w_buff0~0_63 v_~a$w_buff0~0_62) (= v_~a~0_98 (ite .cse0 v_~a$mem_tmp~0_16 v_~__unbuffered_p3_EBX~0_14)) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse1 .cse5) .cse6 .cse4) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse4) .cse7) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse6 .cse8 .cse4) v_~a$w_buff1_used~0_127 0))) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~a$w_buff1~0_54 v_~a$w_buff1~0_53) (= (ite .cse9 v_~a~0_99 (ite .cse10 v_~a$w_buff0~0_63 v_~a$w_buff1~0_54)) v_~__unbuffered_p3_EBX~0_14) (= v_~a$w_buff0_used~0_139 (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse9 v_~a$w_buff0_used~0_140 (ite .cse10 0 v_~a$w_buff0_used~0_140)))))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_99, ~a$w_buff1~0=v_~a$w_buff1~0_54, ~a$w_buff0~0=v_~a$w_buff0~0_63, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, ~a~0=v_~a~0_98, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_53, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_62, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3] and [400] L807-->L810: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~y~0_3) InVars {~y~0=v_~y~0_3} OutVars{~y~0=v_~y~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] [2022-12-13 09:18:14,633 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] L833-->L849: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse7 (not .cse5)) (.cse11 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse6 (and .cse5 .cse3)) (.cse8 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5))) (let ((.cse1 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_139 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse9 (or .cse11 .cse6 .cse8)) (.cse10 (and .cse7 (not .cse11)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$r_buff1_thd4~0_55 (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse2 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse1 .cse2) (and .cse2 .cse3) .cse4)) v_~a$r_buff1_thd4~0_56 0))) (= v_~a~0_99 v_~a$mem_tmp~0_16) (= v_~a$w_buff0~0_63 v_~a$w_buff0~0_62) (= v_~a~0_98 (ite .cse0 v_~a$mem_tmp~0_16 v_~__unbuffered_p3_EBX~0_14)) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse1 .cse5) .cse6 .cse4) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse4) .cse7) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse6 .cse8 .cse4) v_~a$w_buff1_used~0_127 0))) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~a$w_buff1~0_54 v_~a$w_buff1~0_53) (= (ite .cse9 v_~a~0_99 (ite .cse10 v_~a$w_buff0~0_63 v_~a$w_buff1~0_54)) v_~__unbuffered_p3_EBX~0_14) (= v_~a$w_buff0_used~0_139 (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse9 v_~a$w_buff0_used~0_140 (ite .cse10 0 v_~a$w_buff0_used~0_140)))))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_99, ~a$w_buff1~0=v_~a$w_buff1~0_54, ~a$w_buff0~0=v_~a$w_buff0~0_63, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, ~a~0=v_~a~0_98, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_53, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_62, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3] and [394] L790-->L797: Formula: (let ((.cse5 (not (= (mod v_~a$r_buff0_thd2~0_28 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_143 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd2~0_26 256) 0)))) (let ((.cse1 (and (not (= (mod v_~a$w_buff1_used~0_131 256) 0)) .cse3)) (.cse2 (and .cse5 .cse4)) (.cse0 (and .cse5 (not (= 0 (mod v_~a$w_buff0_used~0_144 256)))))) (and (= v_~a~0_102 (ite .cse0 v_~a$w_buff0~0_66 (ite .cse1 v_~a$w_buff1~0_57 v_~a~0_103))) (= (ite .cse2 0 v_~a$r_buff0_thd2~0_28) v_~a$r_buff0_thd2~0_27) (= v_~a$w_buff1_used~0_130 (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_131)) (= (ite .cse0 0 v_~a$w_buff0_used~0_144) v_~a$w_buff0_used~0_143) (= (ite (or (and (not (= (mod v_~a$w_buff1_used~0_130 256) 0)) .cse3) (and (not (= (mod v_~a$r_buff0_thd2~0_27 256) 0)) .cse4)) 0 v_~a$r_buff1_thd2~0_26) v_~a$r_buff1_thd2~0_25)))) InVars {~a~0=v_~a~0_103, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$w_buff0~0=v_~a$w_buff0~0_66, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_26, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_144, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131} OutVars{~a~0=v_~a~0_102, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$w_buff0~0=v_~a$w_buff0~0_66, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_25, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_143, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0] [2022-12-13 09:18:15,030 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [519] $Ultimate##0-->L767: Formula: (and (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_11| 0)) (= v_~a$r_buff0_thd4~0_101 v_~a$r_buff1_thd4~0_102) (= v_~a$r_buff0_thd1~0_76 1) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= v_~a$r_buff0_thd2~0_51 v_~a$r_buff1_thd2~0_45) (= v_~a$w_buff0_used~0_247 1) (= v_~a$w_buff0~0_132 1) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_11| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|) (= (ite (not (and (not (= (mod v_~a$w_buff0_used~0_247 256) 0)) (not (= (mod v_~a$w_buff1_used~0_219 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|) (= v_~a$r_buff0_thd1~0_77 v_~a$r_buff1_thd1~0_63) (= v_~a$r_buff0_thd0~0_49 v_~a$r_buff1_thd0~0_47) (= v_~a$w_buff0_used~0_248 v_~a$w_buff1_used~0_219) (= v_~a$w_buff0~0_133 v_~a$w_buff1~0_112) (= v_~a$r_buff0_thd3~0_45 v_~a$r_buff1_thd3~0_43)) InVars {P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~a$w_buff0~0=v_~a$w_buff0~0_133, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_51, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_45, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_248, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_77, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_49, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_101} OutVars{P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_102, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_43, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_45, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_51, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_45, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_247, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_76, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_49, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_101, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~a$w_buff1~0=v_~a$w_buff1~0_112, ~a$w_buff0~0=v_~a$w_buff0~0_132, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_47, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_219, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_11|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1] and [393] L787-->L790: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] [2022-12-13 09:18:15,201 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [519] $Ultimate##0-->L767: Formula: (and (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_11| 0)) (= v_~a$r_buff0_thd4~0_101 v_~a$r_buff1_thd4~0_102) (= v_~a$r_buff0_thd1~0_76 1) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= v_~a$r_buff0_thd2~0_51 v_~a$r_buff1_thd2~0_45) (= v_~a$w_buff0_used~0_247 1) (= v_~a$w_buff0~0_132 1) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_11| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|) (= (ite (not (and (not (= (mod v_~a$w_buff0_used~0_247 256) 0)) (not (= (mod v_~a$w_buff1_used~0_219 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|) (= v_~a$r_buff0_thd1~0_77 v_~a$r_buff1_thd1~0_63) (= v_~a$r_buff0_thd0~0_49 v_~a$r_buff1_thd0~0_47) (= v_~a$w_buff0_used~0_248 v_~a$w_buff1_used~0_219) (= v_~a$w_buff0~0_133 v_~a$w_buff1~0_112) (= v_~a$r_buff0_thd3~0_45 v_~a$r_buff1_thd3~0_43)) InVars {P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~a$w_buff0~0=v_~a$w_buff0~0_133, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_51, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_45, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_248, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_77, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_49, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_101} OutVars{P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_102, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_43, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_45, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_51, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_45, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_247, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_76, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_49, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_101, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~a$w_buff1~0=v_~a$w_buff1~0_112, ~a$w_buff0~0=v_~a$w_buff0~0_132, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_47, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_219, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_11|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1] and [581] $Ultimate##0-->L810: Formula: (and (= v_~y~0_53 v_~__unbuffered_p2_EAX~0_148) (= |v_P2Thread1of1ForFork0_#in~arg.offset_20| v_P2Thread1of1ForFork0_~arg.offset_20) (= |v_P2Thread1of1ForFork0_#in~arg.base_20| v_P2Thread1of1ForFork0_~arg.base_20) (= v_~y~0_53 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_20|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_20|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_20, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_20|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_148, ~y~0=v_~y~0_53, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_20|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0, ~y~0] [2022-12-13 09:18:15,305 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [519] $Ultimate##0-->L767: Formula: (and (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_11| 0)) (= v_~a$r_buff0_thd4~0_101 v_~a$r_buff1_thd4~0_102) (= v_~a$r_buff0_thd1~0_76 1) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= v_~a$r_buff0_thd2~0_51 v_~a$r_buff1_thd2~0_45) (= v_~a$w_buff0_used~0_247 1) (= v_~a$w_buff0~0_132 1) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_11| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|) (= (ite (not (and (not (= (mod v_~a$w_buff0_used~0_247 256) 0)) (not (= (mod v_~a$w_buff1_used~0_219 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|) (= v_~a$r_buff0_thd1~0_77 v_~a$r_buff1_thd1~0_63) (= v_~a$r_buff0_thd0~0_49 v_~a$r_buff1_thd0~0_47) (= v_~a$w_buff0_used~0_248 v_~a$w_buff1_used~0_219) (= v_~a$w_buff0~0_133 v_~a$w_buff1~0_112) (= v_~a$r_buff0_thd3~0_45 v_~a$r_buff1_thd3~0_43)) InVars {P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~a$w_buff0~0=v_~a$w_buff0~0_133, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_51, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_45, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_248, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_77, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_49, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_101} OutVars{P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_102, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_43, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_45, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_51, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_45, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_247, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_76, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_49, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_101, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~a$w_buff1~0=v_~a$w_buff1~0_112, ~a$w_buff0~0=v_~a$w_buff0~0_132, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_47, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_219, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_11|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1] and [588] $Ultimate##0-->L833: Formula: (and (= |v_P3Thread1of1ForFork2_#in~arg.base_25| v_P3Thread1of1ForFork2_~arg.base_25) (= v_~y~0_63 v_~__unbuffered_p1_EAX~0_163) (= v_P3Thread1of1ForFork2_~arg.offset_25 |v_P3Thread1of1ForFork2_#in~arg.offset_25|) (= v_~z~0_56 v_~__unbuffered_p3_EAX~0_152) (= v_~z~0_56 1)) InVars {P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_25|, ~y~0=v_~y~0_63, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_25|} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_163, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_25, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_152, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_25|, ~z~0=v_~z~0_56, ~y~0=v_~y~0_63, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_25, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_25|} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0, P3Thread1of1ForFork2_~arg.offset, ~__unbuffered_p3_EAX~0, ~z~0, P3Thread1of1ForFork2_~arg.base] [2022-12-13 09:18:15,402 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [519] $Ultimate##0-->L767: Formula: (and (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_11| 0)) (= v_~a$r_buff0_thd4~0_101 v_~a$r_buff1_thd4~0_102) (= v_~a$r_buff0_thd1~0_76 1) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= v_~a$r_buff0_thd2~0_51 v_~a$r_buff1_thd2~0_45) (= v_~a$w_buff0_used~0_247 1) (= v_~a$w_buff0~0_132 1) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_11| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|) (= (ite (not (and (not (= (mod v_~a$w_buff0_used~0_247 256) 0)) (not (= (mod v_~a$w_buff1_used~0_219 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|) (= v_~a$r_buff0_thd1~0_77 v_~a$r_buff1_thd1~0_63) (= v_~a$r_buff0_thd0~0_49 v_~a$r_buff1_thd0~0_47) (= v_~a$w_buff0_used~0_248 v_~a$w_buff1_used~0_219) (= v_~a$w_buff0~0_133 v_~a$w_buff1~0_112) (= v_~a$r_buff0_thd3~0_45 v_~a$r_buff1_thd3~0_43)) InVars {P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~a$w_buff0~0=v_~a$w_buff0~0_133, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_51, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_45, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_248, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_77, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_49, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_101} OutVars{P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_102, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_43, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_45, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_51, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_45, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_247, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_76, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_49, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_101, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~a$w_buff1~0=v_~a$w_buff1~0_112, ~a$w_buff0~0=v_~a$w_buff0~0_132, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_47, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_219, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_11|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1] and [583] $Ultimate##0-->L770: Formula: (and (= |v_P3Thread1of1ForFork2_#in~arg.base_15| v_P3Thread1of1ForFork2_~arg.base_15) (= v_~z~0_46 1) (= v_~x~0_41 v_~__unbuffered_p0_EAX~0_157) (= v_P3Thread1of1ForFork2_~arg.offset_15 |v_P3Thread1of1ForFork2_#in~arg.offset_15|)) InVars {P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_15|, ~x~0=v_~x~0_41, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_15|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_157, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_15, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_15|, ~z~0=v_~z~0_46, ~x~0=v_~x~0_41, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_15, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_15|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P3Thread1of1ForFork2_~arg.offset, ~z~0, P3Thread1of1ForFork2_~arg.base] [2022-12-13 09:18:15,523 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [519] $Ultimate##0-->L767: Formula: (and (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_11| 0)) (= v_~a$r_buff0_thd4~0_101 v_~a$r_buff1_thd4~0_102) (= v_~a$r_buff0_thd1~0_76 1) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= v_~a$r_buff0_thd2~0_51 v_~a$r_buff1_thd2~0_45) (= v_~a$w_buff0_used~0_247 1) (= v_~a$w_buff0~0_132 1) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_11| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|) (= (ite (not (and (not (= (mod v_~a$w_buff0_used~0_247 256) 0)) (not (= (mod v_~a$w_buff1_used~0_219 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|) (= v_~a$r_buff0_thd1~0_77 v_~a$r_buff1_thd1~0_63) (= v_~a$r_buff0_thd0~0_49 v_~a$r_buff1_thd0~0_47) (= v_~a$w_buff0_used~0_248 v_~a$w_buff1_used~0_219) (= v_~a$w_buff0~0_133 v_~a$w_buff1~0_112) (= v_~a$r_buff0_thd3~0_45 v_~a$r_buff1_thd3~0_43)) InVars {P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~a$w_buff0~0=v_~a$w_buff0~0_133, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_51, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_45, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_248, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_77, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_49, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_101} OutVars{P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_102, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_43, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_45, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_51, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_45, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_247, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_76, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_49, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_101, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~a$w_buff1~0=v_~a$w_buff1~0_112, ~a$w_buff0~0=v_~a$w_buff0~0_132, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_47, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_219, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_11|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1] and [584] $Ultimate##0-->L833: Formula: (and (= |v_P3Thread1of1ForFork2_#in~arg.base_17| v_P3Thread1of1ForFork2_~arg.base_17) (= v_~z~0_48 1) (= v_P3Thread1of1ForFork2_~arg.offset_17 |v_P3Thread1of1ForFork2_#in~arg.offset_17|) (= v_~z~0_48 v_~__unbuffered_p3_EAX~0_144)) InVars {P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_17|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_17|} OutVars{P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_17, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_144, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_17|, ~z~0=v_~z~0_48, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_17, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_17|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_~arg.offset, ~__unbuffered_p3_EAX~0, ~z~0, P3Thread1of1ForFork2_~arg.base] [2022-12-13 09:18:16,173 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 09:18:16,174 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5681 [2022-12-13 09:18:16,174 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 120 transitions, 764 flow [2022-12-13 09:18:16,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:18:16,174 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:18:16,174 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:18:16,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:18:16,174 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:18:16,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:18:16,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1945914089, now seen corresponding path program 1 times [2022-12-13 09:18:16,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:18:16,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743472617] [2022-12-13 09:18:16,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:18:16,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:18:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:18:16,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:18:16,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:18:16,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743472617] [2022-12-13 09:18:16,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743472617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:18:16,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:18:16,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:18:16,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782359475] [2022-12-13 09:18:16,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:18:16,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:18:16,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:18:16,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:18:16,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:18:16,577 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2022-12-13 09:18:16,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 120 transitions, 764 flow. Second operand has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:18:16,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:18:16,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2022-12-13 09:18:16,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:18:25,739 INFO L130 PetriNetUnfolder]: 68877/108480 cut-off events. [2022-12-13 09:18:25,739 INFO L131 PetriNetUnfolder]: For 167151/178736 co-relation queries the response was YES. [2022-12-13 09:18:26,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417910 conditions, 108480 events. 68877/108480 cut-off events. For 167151/178736 co-relation queries the response was YES. Maximal size of possible extension queue 6760. Compared 985618 event pairs, 7505 based on Foata normal form. 6152/89383 useless extension candidates. Maximal degree in co-relation 417880. Up to 54517 conditions per place. [2022-12-13 09:18:26,497 INFO L137 encePairwiseOnDemand]: 40/59 looper letters, 168 selfloop transitions, 28 changer transitions 59/287 dead transitions. [2022-12-13 09:18:26,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 287 transitions, 2193 flow [2022-12-13 09:18:26,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 09:18:26,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 09:18:26,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 233 transitions. [2022-12-13 09:18:26,498 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5641646489104116 [2022-12-13 09:18:26,498 INFO L175 Difference]: Start difference. First operand has 86 places, 120 transitions, 764 flow. Second operand 7 states and 233 transitions. [2022-12-13 09:18:26,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 287 transitions, 2193 flow [2022-12-13 09:18:37,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 287 transitions, 2145 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 09:18:37,736 INFO L231 Difference]: Finished difference. Result has 91 places, 125 transitions, 830 flow [2022-12-13 09:18:37,736 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=830, PETRI_PLACES=91, PETRI_TRANSITIONS=125} [2022-12-13 09:18:37,737 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -5 predicate places. [2022-12-13 09:18:37,737 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:18:37,737 INFO L89 Accepts]: Start accepts. Operand has 91 places, 125 transitions, 830 flow [2022-12-13 09:18:37,738 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:18:37,738 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:18:37,738 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 125 transitions, 830 flow [2022-12-13 09:18:37,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 125 transitions, 830 flow [2022-12-13 09:18:41,721 INFO L130 PetriNetUnfolder]: 34341/58946 cut-off events. [2022-12-13 09:18:41,721 INFO L131 PetriNetUnfolder]: For 59285/75800 co-relation queries the response was YES. [2022-12-13 09:18:42,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198049 conditions, 58946 events. 34341/58946 cut-off events. For 59285/75800 co-relation queries the response was YES. Maximal size of possible extension queue 7614. Compared 607514 event pairs, 2559 based on Foata normal form. 681/27041 useless extension candidates. Maximal degree in co-relation 198021. Up to 42931 conditions per place. [2022-12-13 09:18:42,509 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 125 transitions, 830 flow [2022-12-13 09:18:42,509 INFO L226 LiptonReduction]: Number of co-enabled transitions 3556 [2022-12-13 09:18:45,178 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:18:45,192 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7455 [2022-12-13 09:18:45,192 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 125 transitions, 836 flow [2022-12-13 09:18:45,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:18:45,193 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:18:45,193 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:18:45,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:18:45,194 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:18:45,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:18:45,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1414381207, now seen corresponding path program 1 times [2022-12-13 09:18:45,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:18:45,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198287390] [2022-12-13 09:18:45,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:18:45,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:18:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:18:45,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:18:45,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:18:45,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198287390] [2022-12-13 09:18:45,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198287390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:18:45,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:18:45,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:18:45,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087735115] [2022-12-13 09:18:45,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:18:45,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:18:45,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:18:45,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:18:45,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:18:45,485 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2022-12-13 09:18:45,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 125 transitions, 836 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:18:45,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:18:45,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2022-12-13 09:18:45,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand