/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 12:54:05,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:54:05,177 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:54:05,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:54:05,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:54:05,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:54:05,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:54:05,210 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:54:05,213 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:54:05,217 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:54:05,218 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:54:05,219 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:54:05,219 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:54:05,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:54:05,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:54:05,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:54:05,224 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:54:05,225 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:54:05,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:54:05,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:54:05,233 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:54:05,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:54:05,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:54:05,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:54:05,240 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:54:05,240 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:54:05,241 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:54:05,242 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:54:05,242 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:54:05,243 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:54:05,243 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:54:05,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:54:05,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:54:05,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:54:05,257 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:54:05,257 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:54:05,258 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:54:05,258 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:54:05,258 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:54:05,259 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:54:05,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:54:05,260 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 12:54:05,288 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:54:05,289 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:54:05,290 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:54:05,290 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:54:05,290 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:54:05,291 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:54:05,291 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:54:05,291 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:54:05,291 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:54:05,291 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:54:05,292 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:54:05,292 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:54:05,292 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:54:05,292 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:54:05,292 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:54:05,292 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:54:05,293 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:54:05,293 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:54:05,293 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:54:05,293 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 12:54:05,293 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:54:05,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:54:05,293 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:54:05,293 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:54:05,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:54:05,294 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:54:05,294 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:54:05,294 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 12:54:05,294 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 12:54:05,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:54:05,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:54:05,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:54:05,594 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:54:05,594 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:54:05,595 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2022-12-13 12:54:06,551 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:54:06,738 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:54:06,738 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2022-12-13 12:54:06,743 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be767cfcc/1aee1054356e47ef8bc2b754f5160200/FLAG8e0bc6eb6 [2022-12-13 12:54:06,754 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be767cfcc/1aee1054356e47ef8bc2b754f5160200 [2022-12-13 12:54:06,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:54:06,756 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 12:54:06,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:54:06,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:54:06,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:54:06,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:54:06" (1/1) ... [2022-12-13 12:54:06,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bfef779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:06, skipping insertion in model container [2022-12-13 12:54:06,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:54:06" (1/1) ... [2022-12-13 12:54:06,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:54:06,779 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:54:06,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,902 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c[5426,5439] [2022-12-13 12:54:06,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:54:06,911 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:54:06,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:54:06,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:54:06,938 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c[5426,5439] [2022-12-13 12:54:06,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:54:06,953 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:54:06,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:06 WrapperNode [2022-12-13 12:54:06,954 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:54:06,955 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:54:06,955 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:54:06,955 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:54:06,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:06" (1/1) ... [2022-12-13 12:54:06,972 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:06" (1/1) ... [2022-12-13 12:54:07,003 INFO L138 Inliner]: procedures = 22, calls = 110, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 255 [2022-12-13 12:54:07,004 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:54:07,005 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:54:07,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:54:07,005 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:54:07,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:06" (1/1) ... [2022-12-13 12:54:07,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:06" (1/1) ... [2022-12-13 12:54:07,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:06" (1/1) ... [2022-12-13 12:54:07,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:06" (1/1) ... [2022-12-13 12:54:07,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:06" (1/1) ... [2022-12-13 12:54:07,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:06" (1/1) ... [2022-12-13 12:54:07,031 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:06" (1/1) ... [2022-12-13 12:54:07,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:06" (1/1) ... [2022-12-13 12:54:07,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:54:07,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:54:07,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:54:07,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:54:07,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:06" (1/1) ... [2022-12-13 12:54:07,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:54:07,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:54:07,061 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 12:54:07,069 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 12:54:07,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:54:07,095 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 12:54:07,096 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 12:54:07,096 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 12:54:07,096 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 12:54:07,096 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 12:54:07,096 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 12:54:07,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:54:07,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:54:07,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:54:07,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:54:07,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:54:07,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:54:07,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:54:07,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 12:54:07,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:54:07,098 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 12:54:07,227 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 12:54:07,228 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:54:07,506 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 12:54:07,582 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:54:07,583 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:54:07,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:54:07 BoogieIcfgContainer [2022-12-13 12:54:07,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:54:07,586 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:54:07,586 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:54:07,594 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:54:07,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:54:06" (1/3) ... [2022-12-13 12:54:07,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e1fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:54:07, skipping insertion in model container [2022-12-13 12:54:07,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:06" (2/3) ... [2022-12-13 12:54:07,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e1fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:54:07, skipping insertion in model container [2022-12-13 12:54:07,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:54:07" (3/3) ... [2022-12-13 12:54:07,596 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-bakery-3.wvr.c [2022-12-13 12:54:07,609 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:54:07,609 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 12:54:07,610 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:54:07,667 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 12:54:07,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 145 transitions, 314 flow [2022-12-13 12:54:07,766 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2022-12-13 12:54:07,767 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 12:54:07,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 107 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-13 12:54:07,770 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 145 transitions, 314 flow [2022-12-13 12:54:07,773 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 132 transitions, 282 flow [2022-12-13 12:54:07,774 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:54:07,790 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 132 transitions, 282 flow [2022-12-13 12:54:07,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 132 transitions, 282 flow [2022-12-13 12:54:07,816 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-12-13 12:54:07,816 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 12:54:07,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-13 12:54:07,819 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 132 transitions, 282 flow [2022-12-13 12:54:07,819 INFO L226 LiptonReduction]: Number of co-enabled transitions 2184 [2022-12-13 12:54:11,435 INFO L241 LiptonReduction]: Total number of compositions: 89 [2022-12-13 12:54:11,456 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:54:11,460 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;@2c8c2970, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 12:54:11,460 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 12:54:11,467 INFO L130 PetriNetUnfolder]: 0/42 cut-off events. [2022-12-13 12:54:11,467 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 12:54:11,468 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:54:11,468 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:54:11,468 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:54:11,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:54:11,472 INFO L85 PathProgramCache]: Analyzing trace with hash 748936163, now seen corresponding path program 1 times [2022-12-13 12:54:11,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:54:11,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233394325] [2022-12-13 12:54:11,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:54:11,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:54:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:54:12,173 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 12:54:12,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:54:12,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233394325] [2022-12-13 12:54:12,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233394325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:54:12,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:54:12,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 12:54:12,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732682196] [2022-12-13 12:54:12,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:54:12,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 12:54:12,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:54:12,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 12:54:12,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:54:12,194 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2022-12-13 12:54:12,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 104 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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 12:54:12,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:54:12,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2022-12-13 12:54:12,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:54:13,153 INFO L130 PetriNetUnfolder]: 6197/9388 cut-off events. [2022-12-13 12:54:13,153 INFO L131 PetriNetUnfolder]: For 477/477 co-relation queries the response was YES. [2022-12-13 12:54:13,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19181 conditions, 9388 events. 6197/9388 cut-off events. For 477/477 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 50152 event pairs, 2421 based on Foata normal form. 1/9371 useless extension candidates. Maximal degree in co-relation 16901. Up to 3168 conditions per place. [2022-12-13 12:54:13,193 INFO L137 encePairwiseOnDemand]: 35/43 looper letters, 158 selfloop transitions, 15 changer transitions 22/198 dead transitions. [2022-12-13 12:54:13,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 198 transitions, 858 flow [2022-12-13 12:54:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 12:54:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 12:54:13,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 229 transitions. [2022-12-13 12:54:13,202 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48414376321353064 [2022-12-13 12:54:13,203 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 104 flow. Second operand 11 states and 229 transitions. [2022-12-13 12:54:13,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 198 transitions, 858 flow [2022-12-13 12:54:13,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 198 transitions, 810 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-13 12:54:13,212 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 184 flow [2022-12-13 12:54:13,214 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=184, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2022-12-13 12:54:13,216 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2022-12-13 12:54:13,216 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:54:13,217 INFO L89 Accepts]: Start accepts. Operand has 61 places, 59 transitions, 184 flow [2022-12-13 12:54:13,220 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:54:13,220 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:54:13,220 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 59 transitions, 184 flow [2022-12-13 12:54:13,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 59 transitions, 184 flow [2022-12-13 12:54:13,229 INFO L130 PetriNetUnfolder]: 9/125 cut-off events. [2022-12-13 12:54:13,229 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 12:54:13,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 125 events. 9/125 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 549 event pairs, 2 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 175. Up to 12 conditions per place. [2022-12-13 12:54:13,231 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 59 transitions, 184 flow [2022-12-13 12:54:13,232 INFO L226 LiptonReduction]: Number of co-enabled transitions 1204 [2022-12-13 12:54:13,268 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [507] L69-->L73: Formula: (= v_~i1~0_1 v_~i~0_1) InVars {~i~0=v_~i~0_1} OutVars{~i~0=v_~i~0_1, ~i1~0=v_~i1~0_1} AuxVars[] AssignedVars[~i1~0] and [522] L116-->L119: Formula: (= (+ v_~i2~0_2 1) v_~i~0_4) InVars {~i2~0=v_~i2~0_2} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_2} AuxVars[] AssignedVars[~i~0] [2022-12-13 12:54:13,301 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [535] L155-->L159: Formula: (= v_~i3~0_1 v_~i~0_5) InVars {~i~0=v_~i~0_5} OutVars{~i3~0=v_~i3~0_1, ~i~0=v_~i~0_5} AuxVars[] AssignedVars[~i3~0] and [522] L116-->L119: Formula: (= (+ v_~i2~0_2 1) v_~i~0_4) InVars {~i2~0=v_~i2~0_2} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_2} AuxVars[] AssignedVars[~i~0] [2022-12-13 12:54:13,347 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [535] L155-->L159: Formula: (= v_~i3~0_1 v_~i~0_5) InVars {~i~0=v_~i~0_5} OutVars{~i3~0=v_~i3~0_1, ~i~0=v_~i~0_5} AuxVars[] AssignedVars[~i3~0] and [508] L73-->L76: Formula: (= (+ v_~i1~0_2 1) v_~i~0_2) InVars {~i1~0=v_~i1~0_2} OutVars{~i~0=v_~i~0_2, ~i1~0=v_~i1~0_2} AuxVars[] AssignedVars[~i~0] [2022-12-13 12:54:13,360 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L69-->L119: Formula: (and (= v_~i~0_96 v_~i1~0_65) (= v_~i~0_95 (+ v_~i2~0_55 1))) InVars {~i~0=v_~i~0_96, ~i2~0=v_~i2~0_55} OutVars{~i~0=v_~i~0_95, ~i2~0=v_~i2~0_55, ~i1~0=v_~i1~0_65} AuxVars[] AssignedVars[~i~0, ~i1~0] and [508] L73-->L76: Formula: (= (+ v_~i1~0_2 1) v_~i~0_2) InVars {~i1~0=v_~i1~0_2} OutVars{~i~0=v_~i~0_2, ~i1~0=v_~i1~0_2} AuxVars[] AssignedVars[~i~0] [2022-12-13 12:54:13,398 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 12:54:13,399 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-13 12:54:13,399 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 56 transitions, 178 flow [2022-12-13 12:54:13,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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 12:54:13,400 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:54:13,400 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:54:13,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:54:13,400 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:54:13,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:54:13,400 INFO L85 PathProgramCache]: Analyzing trace with hash 392671169, now seen corresponding path program 2 times [2022-12-13 12:54:13,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:54:13,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985942228] [2022-12-13 12:54:13,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:54:13,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:54:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:54:13,918 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 12:54:13,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:54:13,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985942228] [2022-12-13 12:54:13,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985942228] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:54:13,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:54:13,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 12:54:13,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718894234] [2022-12-13 12:54:13,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:54:13,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 12:54:13,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:54:13,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 12:54:13,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-12-13 12:54:13,921 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 47 [2022-12-13 12:54:13,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 56 transitions, 178 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 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 12:54:13,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:54:13,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 47 [2022-12-13 12:54:13,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:54:14,613 INFO L130 PetriNetUnfolder]: 6030/9789 cut-off events. [2022-12-13 12:54:14,614 INFO L131 PetriNetUnfolder]: For 397/397 co-relation queries the response was YES. [2022-12-13 12:54:14,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20420 conditions, 9789 events. 6030/9789 cut-off events. For 397/397 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 59802 event pairs, 2685 based on Foata normal form. 90/9675 useless extension candidates. Maximal degree in co-relation 20398. Up to 7392 conditions per place. [2022-12-13 12:54:14,651 INFO L137 encePairwiseOnDemand]: 36/47 looper letters, 113 selfloop transitions, 18 changer transitions 0/145 dead transitions. [2022-12-13 12:54:14,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 145 transitions, 625 flow [2022-12-13 12:54:14,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 12:54:14,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 12:54:14,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions. [2022-12-13 12:54:14,653 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44208037825059104 [2022-12-13 12:54:14,653 INFO L175 Difference]: Start difference. First operand has 57 places, 56 transitions, 178 flow. Second operand 9 states and 187 transitions. [2022-12-13 12:54:14,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 145 transitions, 625 flow [2022-12-13 12:54:14,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 145 transitions, 623 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 12:54:14,662 INFO L231 Difference]: Finished difference. Result has 70 places, 75 transitions, 295 flow [2022-12-13 12:54:14,662 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=295, PETRI_PLACES=70, PETRI_TRANSITIONS=75} [2022-12-13 12:54:14,662 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 17 predicate places. [2022-12-13 12:54:14,662 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:54:14,663 INFO L89 Accepts]: Start accepts. Operand has 70 places, 75 transitions, 295 flow [2022-12-13 12:54:14,664 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:54:14,664 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:54:14,664 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 75 transitions, 295 flow [2022-12-13 12:54:14,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 75 transitions, 295 flow [2022-12-13 12:54:14,682 INFO L130 PetriNetUnfolder]: 62/361 cut-off events. [2022-12-13 12:54:14,682 INFO L131 PetriNetUnfolder]: For 26/27 co-relation queries the response was YES. [2022-12-13 12:54:14,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 361 events. 62/361 cut-off events. For 26/27 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2232 event pairs, 12 based on Foata normal form. 0/338 useless extension candidates. Maximal degree in co-relation 583. Up to 70 conditions per place. [2022-12-13 12:54:14,685 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 75 transitions, 295 flow [2022-12-13 12:54:14,685 INFO L226 LiptonReduction]: Number of co-enabled transitions 1456 [2022-12-13 12:54:14,767 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:54:14,768 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-13 12:54:14,768 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 75 transitions, 295 flow [2022-12-13 12:54:14,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 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 12:54:14,769 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:54:14,769 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:54:14,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:54:14,769 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:54:14,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:54:14,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1524300070, now seen corresponding path program 1 times [2022-12-13 12:54:14,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:54:14,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318206129] [2022-12-13 12:54:14,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:54:14,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:54:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:54:15,128 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 12:54:15,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:54:15,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318206129] [2022-12-13 12:54:15,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318206129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:54:15,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:54:15,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:54:15,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571544069] [2022-12-13 12:54:15,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:54:15,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:54:15,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:54:15,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:54:15,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:54:15,133 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 47 [2022-12-13 12:54:15,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 75 transitions, 295 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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 12:54:15,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:54:15,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 47 [2022-12-13 12:54:15,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:54:16,071 INFO L130 PetriNetUnfolder]: 8664/13789 cut-off events. [2022-12-13 12:54:16,072 INFO L131 PetriNetUnfolder]: For 4006/4151 co-relation queries the response was YES. [2022-12-13 12:54:16,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33228 conditions, 13789 events. 8664/13789 cut-off events. For 4006/4151 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 87622 event pairs, 2158 based on Foata normal form. 196/13740 useless extension candidates. Maximal degree in co-relation 26081. Up to 9240 conditions per place. [2022-12-13 12:54:16,127 INFO L137 encePairwiseOnDemand]: 35/47 looper letters, 119 selfloop transitions, 21 changer transitions 0/154 dead transitions. [2022-12-13 12:54:16,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 154 transitions, 817 flow [2022-12-13 12:54:16,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:54:16,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:54:16,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2022-12-13 12:54:16,129 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5531914893617021 [2022-12-13 12:54:16,129 INFO L175 Difference]: Start difference. First operand has 70 places, 75 transitions, 295 flow. Second operand 6 states and 156 transitions. [2022-12-13 12:54:16,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 154 transitions, 817 flow [2022-12-13 12:54:16,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 154 transitions, 817 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:54:16,174 INFO L231 Difference]: Finished difference. Result has 79 places, 95 transitions, 469 flow [2022-12-13 12:54:16,174 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=469, PETRI_PLACES=79, PETRI_TRANSITIONS=95} [2022-12-13 12:54:16,175 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2022-12-13 12:54:16,175 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:54:16,175 INFO L89 Accepts]: Start accepts. Operand has 79 places, 95 transitions, 469 flow [2022-12-13 12:54:16,177 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:54:16,178 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:54:16,178 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 95 transitions, 469 flow [2022-12-13 12:54:16,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 95 transitions, 469 flow [2022-12-13 12:54:16,278 INFO L130 PetriNetUnfolder]: 272/1125 cut-off events. [2022-12-13 12:54:16,279 INFO L131 PetriNetUnfolder]: For 622/685 co-relation queries the response was YES. [2022-12-13 12:54:16,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2630 conditions, 1125 events. 272/1125 cut-off events. For 622/685 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 9078 event pairs, 68 based on Foata normal form. 1/1065 useless extension candidates. Maximal degree in co-relation 2413. Up to 239 conditions per place. [2022-12-13 12:54:16,288 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 95 transitions, 469 flow [2022-12-13 12:54:16,288 INFO L226 LiptonReduction]: Number of co-enabled transitions 1918 [2022-12-13 12:54:16,316 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:54:16,317 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 12:54:16,317 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 95 transitions, 469 flow [2022-12-13 12:54:16,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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 12:54:16,318 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:54:16,318 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:54:16,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:54:16,318 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:54:16,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:54:16,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1738219149, now seen corresponding path program 1 times [2022-12-13 12:54:16,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:54:16,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698099300] [2022-12-13 12:54:16,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:54:16,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:54:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:54:16,519 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 12:54:16,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:54:16,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698099300] [2022-12-13 12:54:16,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698099300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:54:16,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:54:16,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:54:16,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678758639] [2022-12-13 12:54:16,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:54:16,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:54:16,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:54:16,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:54:16,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:54:16,521 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2022-12-13 12:54:16,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 95 transitions, 469 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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 12:54:16,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:54:16,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2022-12-13 12:54:16,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:54:17,245 INFO L130 PetriNetUnfolder]: 5674/9620 cut-off events. [2022-12-13 12:54:17,245 INFO L131 PetriNetUnfolder]: For 8907/9158 co-relation queries the response was YES. [2022-12-13 12:54:17,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26939 conditions, 9620 events. 5674/9620 cut-off events. For 8907/9158 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 63908 event pairs, 3923 based on Foata normal form. 158/9501 useless extension candidates. Maximal degree in co-relation 20653. Up to 7815 conditions per place. [2022-12-13 12:54:17,302 INFO L137 encePairwiseOnDemand]: 42/47 looper letters, 92 selfloop transitions, 9 changer transitions 0/122 dead transitions. [2022-12-13 12:54:17,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 122 transitions, 802 flow [2022-12-13 12:54:17,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:54:17,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:54:17,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-12-13 12:54:17,303 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5053191489361702 [2022-12-13 12:54:17,303 INFO L175 Difference]: Start difference. First operand has 79 places, 95 transitions, 469 flow. Second operand 4 states and 95 transitions. [2022-12-13 12:54:17,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 122 transitions, 802 flow [2022-12-13 12:54:17,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 122 transitions, 760 flow, removed 21 selfloop flow, removed 0 redundant places. [2022-12-13 12:54:17,350 INFO L231 Difference]: Finished difference. Result has 83 places, 95 transitions, 469 flow [2022-12-13 12:54:17,350 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=469, PETRI_PLACES=83, PETRI_TRANSITIONS=95} [2022-12-13 12:54:17,351 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 30 predicate places. [2022-12-13 12:54:17,351 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:54:17,351 INFO L89 Accepts]: Start accepts. Operand has 83 places, 95 transitions, 469 flow [2022-12-13 12:54:17,355 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:54:17,355 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:54:17,355 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 95 transitions, 469 flow [2022-12-13 12:54:17,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 95 transitions, 469 flow [2022-12-13 12:54:17,403 INFO L130 PetriNetUnfolder]: 228/961 cut-off events. [2022-12-13 12:54:17,403 INFO L131 PetriNetUnfolder]: For 598/619 co-relation queries the response was YES. [2022-12-13 12:54:17,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2364 conditions, 961 events. 228/961 cut-off events. For 598/619 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 7525 event pairs, 69 based on Foata normal form. 2/902 useless extension candidates. Maximal degree in co-relation 2236. Up to 193 conditions per place. [2022-12-13 12:54:17,411 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 95 transitions, 469 flow [2022-12-13 12:54:17,411 INFO L226 LiptonReduction]: Number of co-enabled transitions 1728 [2022-12-13 12:54:17,427 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:54:17,432 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-13 12:54:17,432 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 95 transitions, 469 flow [2022-12-13 12:54:17,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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 12:54:17,432 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:54:17,432 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:54:17,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:54:17,432 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:54:17,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:54:17,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1851570814, now seen corresponding path program 2 times [2022-12-13 12:54:17,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:54:17,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171643297] [2022-12-13 12:54:17,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:54:17,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:54:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:54:18,067 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 12:54:18,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:54:18,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171643297] [2022-12-13 12:54:18,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171643297] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:54:18,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:54:18,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 12:54:18,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000075498] [2022-12-13 12:54:18,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:54:18,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 12:54:18,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:54:18,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 12:54:18,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-13 12:54:18,076 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 47 [2022-12-13 12:54:18,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 95 transitions, 469 flow. Second operand has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 11 states have internal predecessors, (105), 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 12:54:18,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:54:18,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 47 [2022-12-13 12:54:18,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:54:19,903 INFO L130 PetriNetUnfolder]: 13242/21943 cut-off events. [2022-12-13 12:54:19,903 INFO L131 PetriNetUnfolder]: For 20902/21219 co-relation queries the response was YES. [2022-12-13 12:54:19,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62900 conditions, 21943 events. 13242/21943 cut-off events. For 20902/21219 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 158206 event pairs, 3254 based on Foata normal form. 164/21853 useless extension candidates. Maximal degree in co-relation 47494. Up to 9392 conditions per place. [2022-12-13 12:54:20,001 INFO L137 encePairwiseOnDemand]: 33/47 looper letters, 322 selfloop transitions, 83 changer transitions 5/424 dead transitions. [2022-12-13 12:54:20,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 424 transitions, 2671 flow [2022-12-13 12:54:20,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 12:54:20,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 12:54:20,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 437 transitions. [2022-12-13 12:54:20,004 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5811170212765957 [2022-12-13 12:54:20,004 INFO L175 Difference]: Start difference. First operand has 83 places, 95 transitions, 469 flow. Second operand 16 states and 437 transitions. [2022-12-13 12:54:20,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 424 transitions, 2671 flow [2022-12-13 12:54:20,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 424 transitions, 2577 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 12:54:20,070 INFO L231 Difference]: Finished difference. Result has 107 places, 169 transitions, 1213 flow [2022-12-13 12:54:20,070 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1213, PETRI_PLACES=107, PETRI_TRANSITIONS=169} [2022-12-13 12:54:20,072 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 54 predicate places. [2022-12-13 12:54:20,072 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:54:20,072 INFO L89 Accepts]: Start accepts. Operand has 107 places, 169 transitions, 1213 flow [2022-12-13 12:54:20,074 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:54:20,074 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:54:20,075 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 169 transitions, 1213 flow [2022-12-13 12:54:20,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 169 transitions, 1213 flow [2022-12-13 12:54:20,313 INFO L130 PetriNetUnfolder]: 718/2636 cut-off events. [2022-12-13 12:54:20,313 INFO L131 PetriNetUnfolder]: For 10331/10602 co-relation queries the response was YES. [2022-12-13 12:54:20,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9025 conditions, 2636 events. 718/2636 cut-off events. For 10331/10602 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 24711 event pairs, 90 based on Foata normal form. 15/2509 useless extension candidates. Maximal degree in co-relation 8601. Up to 532 conditions per place. [2022-12-13 12:54:20,346 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 169 transitions, 1213 flow [2022-12-13 12:54:20,346 INFO L226 LiptonReduction]: Number of co-enabled transitions 3066 [2022-12-13 12:54:20,369 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [612] $Ultimate##0-->L90: Formula: (and (= v_~e2~0_67 1) (= (ite (< v_~n2~0_138 v_~n1~0_177) v_~n1~0_177 v_~n2~0_138) v_~n2~0_137)) InVars {~n2~0=v_~n2~0_138, ~n1~0=v_~n1~0_177} OutVars{~n2~0=v_~n2~0_137, ~n1~0=v_~n1~0_177, ~e2~0=v_~e2~0_67} AuxVars[] AssignedVars[~n2~0, ~e2~0] and [552] $Ultimate##0-->L133: Formula: (and (= v_~e3~0_30 1) (= v_~n3~0_47 (ite (< v_~n3~0_48 v_~n1~0_47) v_~n1~0_47 v_~n3~0_48))) InVars {~n3~0=v_~n3~0_48, ~n1~0=v_~n1~0_47} OutVars{~n3~0=v_~n3~0_47, ~n1~0=v_~n1~0_47, ~e3~0=v_~e3~0_30} AuxVars[] AssignedVars[~n3~0, ~e3~0] [2022-12-13 12:54:20,386 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [612] $Ultimate##0-->L90: Formula: (and (= v_~e2~0_67 1) (= (ite (< v_~n2~0_138 v_~n1~0_177) v_~n1~0_177 v_~n2~0_138) v_~n2~0_137)) InVars {~n2~0=v_~n2~0_138, ~n1~0=v_~n1~0_177} OutVars{~n2~0=v_~n2~0_137, ~n1~0=v_~n1~0_177, ~e2~0=v_~e2~0_67} AuxVars[] AssignedVars[~n2~0, ~e2~0] and [599] L76-->thread1EXIT: Formula: (and (= v_~n1~0_165 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_7| 0)) InVars {} OutVars{~n1~0=v_~n1~0_165, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_7|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base] [2022-12-13 12:54:20,427 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [586] L50-->L56: Formula: (and (= v_~e1~0_57 0) (= v_~n1~0_100 (+ v_~n1~0_101 1))) InVars {~n1~0=v_~n1~0_101} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_7|, ~n1~0=v_~n1~0_100, ~e1~0=v_~e1~0_57} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~n1~0, ~e1~0] and [653] $Ultimate##0-->thread1EXIT: Formula: (and (= v_~e2~0_202 1) (= |v_thread1Thread1of1ForFork1_#res#1.base_13| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_13| 0) (= v_~n1~0_566 0) (= (ite (< v_~n2~0_553 v_~n1~0_567) v_~n1~0_567 v_~n2~0_553) v_~n2~0_552)) InVars {~n2~0=v_~n2~0_553, ~n1~0=v_~n1~0_567} OutVars{~n2~0=v_~n2~0_552, ~n1~0=v_~n1~0_566, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_13|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_13|, ~e2~0=v_~e2~0_202} AuxVars[] AssignedVars[~n2~0, ~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~e2~0] [2022-12-13 12:54:20,481 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:54:20,482 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 410 [2022-12-13 12:54:20,482 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 169 transitions, 1228 flow [2022-12-13 12:54:20,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 11 states have internal predecessors, (105), 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 12:54:20,482 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:54:20,483 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:54:20,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:54:20,483 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:54:20,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:54:20,483 INFO L85 PathProgramCache]: Analyzing trace with hash 27491674, now seen corresponding path program 3 times [2022-12-13 12:54:20,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:54:20,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267217870] [2022-12-13 12:54:20,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:54:20,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:54:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:54:20,852 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 12:54:20,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:54:20,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267217870] [2022-12-13 12:54:20,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267217870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:54:20,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:54:20,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 12:54:20,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554714] [2022-12-13 12:54:20,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:54:20,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 12:54:20,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:54:20,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 12:54:20,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:54:20,855 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 49 [2022-12-13 12:54:20,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 169 transitions, 1228 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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 12:54:20,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:54:20,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 49 [2022-12-13 12:54:20,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:54:24,423 INFO L130 PetriNetUnfolder]: 23080/38339 cut-off events. [2022-12-13 12:54:24,423 INFO L131 PetriNetUnfolder]: For 142456/144110 co-relation queries the response was YES. [2022-12-13 12:54:24,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140942 conditions, 38339 events. 23080/38339 cut-off events. For 142456/144110 co-relation queries the response was YES. Maximal size of possible extension queue 1152. Compared 302052 event pairs, 4933 based on Foata normal form. 468/38302 useless extension candidates. Maximal degree in co-relation 104796. Up to 12880 conditions per place. [2022-12-13 12:54:24,645 INFO L137 encePairwiseOnDemand]: 36/49 looper letters, 383 selfloop transitions, 160 changer transitions 0/557 dead transitions. [2022-12-13 12:54:24,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 557 transitions, 5100 flow [2022-12-13 12:54:24,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 12:54:24,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 12:54:24,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 293 transitions. [2022-12-13 12:54:24,647 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5435992578849722 [2022-12-13 12:54:24,647 INFO L175 Difference]: Start difference. First operand has 107 places, 169 transitions, 1228 flow. Second operand 11 states and 293 transitions. [2022-12-13 12:54:24,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 557 transitions, 5100 flow [2022-12-13 12:54:25,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 557 transitions, 4778 flow, removed 161 selfloop flow, removed 0 redundant places. [2022-12-13 12:54:25,278 INFO L231 Difference]: Finished difference. Result has 125 places, 317 transitions, 3202 flow [2022-12-13 12:54:25,278 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3202, PETRI_PLACES=125, PETRI_TRANSITIONS=317} [2022-12-13 12:54:25,280 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 72 predicate places. [2022-12-13 12:54:25,280 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:54:25,280 INFO L89 Accepts]: Start accepts. Operand has 125 places, 317 transitions, 3202 flow [2022-12-13 12:54:25,283 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:54:25,283 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:54:25,284 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 317 transitions, 3202 flow [2022-12-13 12:54:25,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 317 transitions, 3202 flow [2022-12-13 12:54:25,700 INFO L130 PetriNetUnfolder]: 1407/4910 cut-off events. [2022-12-13 12:54:25,700 INFO L131 PetriNetUnfolder]: For 29756/30525 co-relation queries the response was YES. [2022-12-13 12:54:25,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19520 conditions, 4910 events. 1407/4910 cut-off events. For 29756/30525 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 51412 event pairs, 147 based on Foata normal form. 80/4726 useless extension candidates. Maximal degree in co-relation 18763. Up to 1035 conditions per place. [2022-12-13 12:54:25,753 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 317 transitions, 3202 flow [2022-12-13 12:54:25,753 INFO L226 LiptonReduction]: Number of co-enabled transitions 4510 [2022-12-13 12:54:26,281 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:54:26,282 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1002 [2022-12-13 12:54:26,282 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 319 transitions, 3244 flow [2022-12-13 12:54:26,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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 12:54:26,282 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:54:26,282 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:54:26,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:54:26,283 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:54:26,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:54:26,283 INFO L85 PathProgramCache]: Analyzing trace with hash -390137272, now seen corresponding path program 1 times [2022-12-13 12:54:26,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:54:26,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406959794] [2022-12-13 12:54:26,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:54:26,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:54:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:54:26,361 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 12:54:26,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:54:26,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406959794] [2022-12-13 12:54:26,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406959794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:54:26,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:54:26,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:54:26,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494912234] [2022-12-13 12:54:26,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:54:26,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:54:26,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:54:26,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:54:26,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:54:26,363 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 58 [2022-12-13 12:54:26,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 319 transitions, 3244 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 12:54:26,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:54:26,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 58 [2022-12-13 12:54:26,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:54:29,703 INFO L130 PetriNetUnfolder]: 17801/30546 cut-off events. [2022-12-13 12:54:29,703 INFO L131 PetriNetUnfolder]: For 159720/162369 co-relation queries the response was YES. [2022-12-13 12:54:29,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121844 conditions, 30546 events. 17801/30546 cut-off events. For 159720/162369 co-relation queries the response was YES. Maximal size of possible extension queue 1011. Compared 246241 event pairs, 11820 based on Foata normal form. 587/30299 useless extension candidates. Maximal degree in co-relation 120959. Up to 24377 conditions per place. [2022-12-13 12:54:29,887 INFO L137 encePairwiseOnDemand]: 50/58 looper letters, 236 selfloop transitions, 20 changer transitions 3/343 dead transitions. [2022-12-13 12:54:29,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 343 transitions, 4131 flow [2022-12-13 12:54:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:54:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:54:29,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2022-12-13 12:54:29,888 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2022-12-13 12:54:29,888 INFO L175 Difference]: Start difference. First operand has 127 places, 319 transitions, 3244 flow. Second operand 3 states and 96 transitions. [2022-12-13 12:54:29,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 343 transitions, 4131 flow [2022-12-13 12:54:30,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 343 transitions, 3861 flow, removed 135 selfloop flow, removed 1 redundant places. [2022-12-13 12:54:30,826 INFO L231 Difference]: Finished difference. Result has 128 places, 298 transitions, 2957 flow [2022-12-13 12:54:30,827 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=2915, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2957, PETRI_PLACES=128, PETRI_TRANSITIONS=298} [2022-12-13 12:54:30,827 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 75 predicate places. [2022-12-13 12:54:30,827 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:54:30,827 INFO L89 Accepts]: Start accepts. Operand has 128 places, 298 transitions, 2957 flow [2022-12-13 12:54:30,829 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:54:30,829 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:54:30,829 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 298 transitions, 2957 flow [2022-12-13 12:54:30,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 298 transitions, 2957 flow [2022-12-13 12:54:31,172 INFO L130 PetriNetUnfolder]: 1349/4575 cut-off events. [2022-12-13 12:54:31,172 INFO L131 PetriNetUnfolder]: For 19554/20345 co-relation queries the response was YES. [2022-12-13 12:54:31,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17312 conditions, 4575 events. 1349/4575 cut-off events. For 19554/20345 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 46593 event pairs, 184 based on Foata normal form. 57/4314 useless extension candidates. Maximal degree in co-relation 17032. Up to 1003 conditions per place. [2022-12-13 12:54:31,221 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 298 transitions, 2957 flow [2022-12-13 12:54:31,222 INFO L226 LiptonReduction]: Number of co-enabled transitions 3970 [2022-12-13 12:54:32,352 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:54:32,353 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1526 [2022-12-13 12:54:32,353 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 300 transitions, 3025 flow [2022-12-13 12:54:32,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 12:54:32,353 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:54:32,353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:54:32,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:54:32,353 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:54:32,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:54:32,353 INFO L85 PathProgramCache]: Analyzing trace with hash -830145697, now seen corresponding path program 1 times [2022-12-13 12:54:32,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:54:32,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915133233] [2022-12-13 12:54:32,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:54:32,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:54:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:54:32,895 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 12:54:32,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:54:32,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915133233] [2022-12-13 12:54:32,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915133233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:54:32,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:54:32,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 12:54:32,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309988072] [2022-12-13 12:54:32,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:54:32,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 12:54:32,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:54:32,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 12:54:32,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-13 12:54:32,897 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 81 [2022-12-13 12:54:32,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 300 transitions, 3025 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 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 12:54:32,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:54:32,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 81 [2022-12-13 12:54:32,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:54:39,160 INFO L130 PetriNetUnfolder]: 32642/53697 cut-off events. [2022-12-13 12:54:39,161 INFO L131 PetriNetUnfolder]: For 215355/218226 co-relation queries the response was YES. [2022-12-13 12:54:39,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209046 conditions, 53697 events. 32642/53697 cut-off events. For 215355/218226 co-relation queries the response was YES. Maximal size of possible extension queue 1790. Compared 445477 event pairs, 9481 based on Foata normal form. 552/53473 useless extension candidates. Maximal degree in co-relation 208268. Up to 14963 conditions per place. [2022-12-13 12:54:39,598 INFO L137 encePairwiseOnDemand]: 46/81 looper letters, 511 selfloop transitions, 252 changer transitions 3/780 dead transitions. [2022-12-13 12:54:39,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 780 transitions, 8894 flow [2022-12-13 12:54:39,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 12:54:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 12:54:39,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 383 transitions. [2022-12-13 12:54:39,600 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31522633744855966 [2022-12-13 12:54:39,600 INFO L175 Difference]: Start difference. First operand has 127 places, 300 transitions, 3025 flow. Second operand 15 states and 383 transitions. [2022-12-13 12:54:39,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 780 transitions, 8894 flow [2022-12-13 12:54:41,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 780 transitions, 8741 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-13 12:54:41,214 INFO L231 Difference]: Finished difference. Result has 149 places, 459 transitions, 5904 flow [2022-12-13 12:54:41,214 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2852, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=5904, PETRI_PLACES=149, PETRI_TRANSITIONS=459} [2022-12-13 12:54:41,214 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 96 predicate places. [2022-12-13 12:54:41,215 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:54:41,215 INFO L89 Accepts]: Start accepts. Operand has 149 places, 459 transitions, 5904 flow [2022-12-13 12:54:41,218 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:54:41,218 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:54:41,218 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 459 transitions, 5904 flow [2022-12-13 12:54:41,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 459 transitions, 5904 flow [2022-12-13 12:54:41,818 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L119-->thread2EXIT: Formula: (and (= v_~n2~0_178 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_178, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][246], [Black: 253#(= ~n3~0 0), Black: 255#(and (= ~n1~0 ~n3~0) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 257#(and (or (= ~n1~0 ~n3~0) (<= (+ ~n1~0 1) ~n3~0)) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 259#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n3~0 1))), Black: 254#(and (<= ~n3~0 ~n1~0) (= ~n3~0 0)), 54#thread1EXITtrue, Black: 256#(and (or (and (= ~n2~0 ~n3~0) (<= (+ ~n1~0 1) ~n2~0)) (= ~n1~0 ~n3~0)) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 258#(and (<= (+ ~n1~0 1) ~n3~0) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 276#(= ~e2~0 1), 261#(and (= ~n3~0 0) (= ~n1~0 ~n3~0)), Black: 281#(= ~n1~0 0), Black: 289#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))), Black: 297#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n1~0 0)), Black: 283#(or (and (<= ~n2~0 0) (= ~n1~0 0)) (and (<= 1 ~n1~0) (<= ~n2~0 ~n1~0))), Black: 282#(or (and (<= ~n2~0 0) (= ~n1~0 0)) (and (= ~n2~0 ~n1~0) (<= 1 ~n2~0))), Black: 286#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n2~0 ~n3~0)), Black: 284#(or (and (<= 2 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)) (and (<= 1 ~n1~0) (<= ~n2~0 0))), Black: 285#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 293#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 287#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), 291#(and (<= ~n2~0 0) (= ~n1~0 0)), Black: 158#(= ~i~0 0), 221#(or (= ~n2~0 0) (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0))), 11#thread2EXITtrue, 42#L190-4true, Black: 193#(and (<= (+ ~n2~0 1) ~n3~0) (<= 2 ~n2~0)), Black: 190#(and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 192#(and (<= 2 ~n2~0) (= ~n2~0 ~n3~0)), Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 191#(and (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 205#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n2~0 1))), Black: 203#(and (<= 1 ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 202#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 183#true, Black: 204#(and (<= 1 ~n1~0) (= ~n3~0 0) (< ~n1~0 (+ ~n2~0 1))), 156#true, Black: 213#(and (= ~e1~0 1) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 19#thread3EXITtrue, Black: 225#(and (or (= ~n3~0 0) (and (<= 2 ~n2~0) (<= ~n2~0 (+ ~n3~0 1)))) (or (and (<= 1 ~n2~0) (<= ~n2~0 1)) (not (= ~n3~0 0)))), Black: 220#(or (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)) (= ~n2~0 0)), Black: 236#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0)) (or (= ~n2~0 0) (= ~n2~0 ~n1~0))), Black: 224#(and (or (= ~n2~0 0) (not (= ~n3~0 0))) (or (and (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (= ~n3~0 0))), Black: 234#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (= ~n2~0 0) (= ~n2~0 ~n1~0))), 200#true, Black: 226#(or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (<= ~n2~0 ~n3~0)) (and (<= 2 ~n2~0) (<= ~n2~0 ~n3~0))), Black: 219#(and (or (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)) (= ~n2~0 0)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 223#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0))), Black: 222#(and (or (= ~n2~0 0) (<= ~n2~0 ~n3~0)) (or (= ~n2~0 0) (<= 1 ~n2~0))), Black: 232#(and (or (= ~n2~0 0) (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0))) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0))]) [2022-12-13 12:54:41,819 INFO L382 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-13 12:54:41,819 INFO L385 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 12:54:41,819 INFO L385 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 12:54:41,819 INFO L385 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 12:54:41,837 INFO L130 PetriNetUnfolder]: 2036/6633 cut-off events. [2022-12-13 12:54:41,838 INFO L131 PetriNetUnfolder]: For 55300/57271 co-relation queries the response was YES. [2022-12-13 12:54:41,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30304 conditions, 6633 events. 2036/6633 cut-off events. For 55300/57271 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 71888 event pairs, 287 based on Foata normal form. 122/6378 useless extension candidates. Maximal degree in co-relation 29527. Up to 1539 conditions per place. [2022-12-13 12:54:42,016 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 459 transitions, 5904 flow [2022-12-13 12:54:42,016 INFO L226 LiptonReduction]: Number of co-enabled transitions 5054 [2022-12-13 12:54:42,653 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [634] L136-->L142: Formula: (and (= v_~e3~0_104 0) (= (+ v_~n3~0_184 1) v_~n3~0_183)) InVars {~n3~0=v_~n3~0_184} OutVars{~n3~0=v_~n3~0_183, ~e3~0=v_~e3~0_104, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_9|} AuxVars[] AssignedVars[~n3~0, ~e3~0, thread3Thread1of1ForFork0_#t~post3#1] and [570] L93-->L99: Formula: (and (= v_~e2~0_40 0) (= (+ v_~n2~0_76 1) v_~n2~0_75)) InVars {~n2~0=v_~n2~0_76} OutVars{~n2~0=v_~n2~0_75, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_9|, ~e2~0=v_~e2~0_40} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1, ~e2~0] [2022-12-13 12:54:42,669 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [599] L76-->thread1EXIT: Formula: (and (= v_~n1~0_165 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_7| 0)) InVars {} OutVars{~n1~0=v_~n1~0_165, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_7|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base] and [570] L93-->L99: Formula: (and (= v_~e2~0_40 0) (= (+ v_~n2~0_76 1) v_~n2~0_75)) InVars {~n2~0=v_~n2~0_76} OutVars{~n2~0=v_~n2~0_75, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_9|, ~e2~0=v_~e2~0_40} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1, ~e2~0] [2022-12-13 12:54:42,685 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [599] L76-->thread1EXIT: Formula: (and (= v_~n1~0_165 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_7| 0)) InVars {} OutVars{~n1~0=v_~n1~0_165, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_7|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base] and [570] L93-->L99: Formula: (and (= v_~e2~0_40 0) (= (+ v_~n2~0_76 1) v_~n2~0_75)) InVars {~n2~0=v_~n2~0_76} OutVars{~n2~0=v_~n2~0_75, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_9|, ~e2~0=v_~e2~0_40} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1, ~e2~0] [2022-12-13 12:54:42,706 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [661] L136-->L146: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_81| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_81| (ite (= (mod v_~e1~0_190 256) 0) 1 0)) (= v_~e3~0_245 0) (= (+ v_~n3~0_621 1) v_~n3~0_620) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_81| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_81|)) InVars {~n3~0=v_~n3~0_621, ~e1~0=v_~e1~0_190} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_81|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_81|, ~n3~0=v_~n3~0_620, ~e3~0=v_~e3~0_245, ~e1~0=v_~e1~0_190, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_60|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~n3~0, ~e3~0, thread3Thread1of1ForFork0_#t~post3#1] and [570] L93-->L99: Formula: (and (= v_~e2~0_40 0) (= (+ v_~n2~0_76 1) v_~n2~0_75)) InVars {~n2~0=v_~n2~0_76} OutVars{~n2~0=v_~n2~0_75, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_9|, ~e2~0=v_~e2~0_40} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1, ~e2~0] [2022-12-13 12:54:42,737 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [659] L136-->L146: Formula: (and (= (+ v_~n3~0_613 1) v_~n3~0_612) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_77| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_77| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_77|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_77| (ite (= (mod v_~e1~0_186 256) 0) 1 0)) (= v_~e3~0_241 0)) InVars {~n3~0=v_~n3~0_613, ~e1~0=v_~e1~0_186} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_77|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_77|, ~n3~0=v_~n3~0_612, ~e3~0=v_~e3~0_241, ~e1~0=v_~e1~0_186, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_56|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~n3~0, ~e3~0, thread3Thread1of1ForFork0_#t~post3#1] and [570] L93-->L99: Formula: (and (= v_~e2~0_40 0) (= (+ v_~n2~0_76 1) v_~n2~0_75)) InVars {~n2~0=v_~n2~0_76} OutVars{~n2~0=v_~n2~0_75, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_9|, ~e2~0=v_~e2~0_40} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1, ~e2~0] [2022-12-13 12:54:42,776 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [708] L136-->L99: Formula: (and (= (+ v_~n3~0_836 1) v_~n3~0_835) (= v_~e3~0_326 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_110| (ite (= (mod v_~e1~0_299 256) 0) 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_110| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_110|) (= v_~n2~0_848 (+ v_~n2~0_849 1)) (= v_~e2~0_335 0) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_110| 0))) InVars {~n2~0=v_~n2~0_849, ~n3~0=v_~n3~0_836, ~e1~0=v_~e1~0_299} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_110|, ~n2~0=v_~n2~0_848, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_110|, ~n3~0=v_~n3~0_835, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_101|, ~e3~0=v_~e3~0_326, ~e2~0=v_~e2~0_335, ~e1~0=v_~e1~0_299, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_120|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~n2~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~n3~0, thread2Thread1of1ForFork2_#t~post2#1, ~e3~0, ~e2~0, thread3Thread1of1ForFork0_#t~post3#1] and [633] L119-->thread2EXIT: Formula: (and (= v_~n2~0_178 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_178, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base] [2022-12-13 12:54:42,819 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [709] L136-->L99: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_112| 0)) (= v_~e3~0_328 0) (= v_~e2~0_337 0) (= v_~n2~0_852 (+ v_~n2~0_853 1)) (= v_~n3~0_839 (+ v_~n3~0_840 1)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_112| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_112|) (= (ite (= (mod v_~e1~0_301 256) 0) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_112|)) InVars {~n2~0=v_~n2~0_853, ~n3~0=v_~n3~0_840, ~e1~0=v_~e1~0_301} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_112|, ~n2~0=v_~n2~0_852, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_112|, ~n3~0=v_~n3~0_839, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_103|, ~e3~0=v_~e3~0_328, ~e2~0=v_~e2~0_337, ~e1~0=v_~e1~0_301, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_122|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~n2~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~n3~0, thread2Thread1of1ForFork2_#t~post2#1, ~e3~0, ~e2~0, thread3Thread1of1ForFork0_#t~post3#1] and [633] L119-->thread2EXIT: Formula: (and (= v_~n2~0_178 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_178, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base] [2022-12-13 12:54:42,874 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [705] L136-->L99: Formula: (and (= v_~e3~0_324 0) (= (+ v_~n2~0_837 1) v_~n2~0_836) (= v_~n3~0_831 (+ v_~n3~0_832 1)) (= v_~e2~0_329 0)) InVars {~n2~0=v_~n2~0_837, ~n3~0=v_~n3~0_832} OutVars{~n2~0=v_~n2~0_836, ~n3~0=v_~n3~0_831, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_95|, ~e3~0=v_~e3~0_324, ~e2~0=v_~e2~0_329, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_118|} AuxVars[] AssignedVars[~n2~0, ~n3~0, thread2Thread1of1ForFork2_#t~post2#1, ~e3~0, ~e2~0, thread3Thread1of1ForFork0_#t~post3#1] and [633] L119-->thread2EXIT: Formula: (and (= v_~n2~0_178 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_178, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base] [2022-12-13 12:54:42,898 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [706] L76-->L99: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_19| 0) (= v_~n1~0_814 0) (= v_~e2~0_331 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_19| 0) (= v_~n2~0_840 (+ v_~n2~0_841 1))) InVars {~n2~0=v_~n2~0_841} OutVars{~n2~0=v_~n2~0_840, ~n1~0=v_~n1~0_814, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_97|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_19|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_19|, ~e2~0=v_~e2~0_331} AuxVars[] AssignedVars[~n2~0, ~n1~0, thread2Thread1of1ForFork2_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~e2~0] and [633] L119-->thread2EXIT: Formula: (and (= v_~n2~0_178 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_178, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base] [2022-12-13 12:54:42,928 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [707] L76-->L99: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_21| 0) (= v_~n1~0_816 0) (= v_~e2~0_333 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_21| 0) (= (+ v_~n2~0_845 1) v_~n2~0_844)) InVars {~n2~0=v_~n2~0_845} OutVars{~n2~0=v_~n2~0_844, ~n1~0=v_~n1~0_816, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_99|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_21|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_21|, ~e2~0=v_~e2~0_333} AuxVars[] AssignedVars[~n2~0, ~n1~0, thread2Thread1of1ForFork2_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~e2~0] and [633] L119-->thread2EXIT: Formula: (and (= v_~n2~0_178 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_178, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base] [2022-12-13 12:54:42,970 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [712] L136-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_32| 0) (= v_~e3~0_334 0) (= v_~n3~0_851 (+ v_~n3~0_852 1)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_32| 0) (= v_~e2~0_343 0) (= v_~n2~0_868 0)) InVars {~n3~0=v_~n3~0_852} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_32|, ~n2~0=v_~n2~0_868, ~n3~0=v_~n3~0_851, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_109|, ~e3~0=v_~e3~0_334, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_32|, ~e2~0=v_~e2~0_343, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_128|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, ~n3~0, thread2Thread1of1ForFork2_#t~post2#1, ~e3~0, thread2Thread1of1ForFork2_#res#1.base, ~e2~0, thread3Thread1of1ForFork0_#t~post3#1] and [531] L142-->L146: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (= (ite (= (mod v_~e1~0_20 256) 0) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|)) InVars {~e1~0=v_~e1~0_20} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_20} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1] [2022-12-13 12:54:43,192 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [710] L136-->thread2EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_114| 0)) (= v_~n2~0_856 0) (= v_~e3~0_330 0) (= (ite (= (mod v_~e1~0_303 256) 0) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_114|) (= v_~e2~0_339 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_28| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_114| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_114|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_28| 0) (= (+ v_~n3~0_844 1) v_~n3~0_843)) InVars {~n3~0=v_~n3~0_844, ~e1~0=v_~e1~0_303} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_114|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_28|, ~n2~0=v_~n2~0_856, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_114|, ~n3~0=v_~n3~0_843, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_105|, ~e3~0=v_~e3~0_330, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_28|, ~e2~0=v_~e2~0_339, ~e1~0=v_~e1~0_303, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_124|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~n3~0, thread2Thread1of1ForFork2_#t~post2#1, ~e3~0, thread2Thread1of1ForFork2_#res#1.base, ~e2~0, thread3Thread1of1ForFork0_#t~post3#1] and [517] L99-->L103: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (ite (= (mod v_~e1~0_16 256) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|))) InVars {~e1~0=v_~e1~0_16} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1] [2022-12-13 12:54:43,277 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [711] L136-->thread2EXIT: Formula: (and (= v_~e2~0_341 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_30| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_116| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_116|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_30| 0) (= v_~e3~0_332 0) (= (ite (= (mod v_~e1~0_305 256) 0) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_116|) (= (+ v_~n3~0_848 1) v_~n3~0_847) (= v_~n2~0_862 0) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_116| 0))) InVars {~n3~0=v_~n3~0_848, ~e1~0=v_~e1~0_305} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_116|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_30|, ~n2~0=v_~n2~0_862, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_116|, ~n3~0=v_~n3~0_847, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_107|, ~e3~0=v_~e3~0_332, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_30|, ~e2~0=v_~e2~0_341, ~e1~0=v_~e1~0_305, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_126|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~n3~0, thread2Thread1of1ForFork2_#t~post2#1, ~e3~0, thread2Thread1of1ForFork2_#res#1.base, ~e2~0, thread3Thread1of1ForFork0_#t~post3#1] and [517] L99-->L103: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (ite (= (mod v_~e1~0_16 256) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|))) InVars {~e1~0=v_~e1~0_16} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1] [2022-12-13 12:54:43,363 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [713] L76-->thread2EXIT: Formula: (and (= v_~e2~0_345 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_34| 0) (= v_~n2~0_874 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_34| 0) (= v_~n1~0_818 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_23| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_23| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_34|, ~n2~0=v_~n2~0_874, ~n1~0=v_~n1~0_818, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_111|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_23|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_23|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_34|, ~e2~0=v_~e2~0_345} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, ~n1~0, thread2Thread1of1ForFork2_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork2_#res#1.base, ~e2~0] and [517] L99-->L103: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (ite (= (mod v_~e1~0_16 256) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|))) InVars {~e1~0=v_~e1~0_16} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1] [2022-12-13 12:54:43,420 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [712] L136-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_32| 0) (= v_~e3~0_334 0) (= v_~n3~0_851 (+ v_~n3~0_852 1)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_32| 0) (= v_~e2~0_343 0) (= v_~n2~0_868 0)) InVars {~n3~0=v_~n3~0_852} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_32|, ~n2~0=v_~n2~0_868, ~n3~0=v_~n3~0_851, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_109|, ~e3~0=v_~e3~0_334, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_32|, ~e2~0=v_~e2~0_343, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_128|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, ~n3~0, thread2Thread1of1ForFork2_#t~post2#1, ~e3~0, thread2Thread1of1ForFork2_#res#1.base, ~e2~0, thread3Thread1of1ForFork0_#t~post3#1] and [517] L99-->L103: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (ite (= (mod v_~e1~0_16 256) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|))) InVars {~e1~0=v_~e1~0_16} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1] [2022-12-13 12:54:43,527 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 12:54:43,528 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2313 [2022-12-13 12:54:43,528 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 467 transitions, 6238 flow [2022-12-13 12:54:43,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 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 12:54:43,528 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:54:43,528 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:54:43,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:54:43,529 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:54:43,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:54:43,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1309421242, now seen corresponding path program 1 times [2022-12-13 12:54:43,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:54:43,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500671909] [2022-12-13 12:54:43,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:54:43,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:54:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:54:43,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:54:43,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:54:43,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500671909] [2022-12-13 12:54:43,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500671909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:54:43,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:54:43,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:54:43,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353011141] [2022-12-13 12:54:43,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:54:43,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:54:43,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:54:43,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:54:43,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:54:43,587 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 100 [2022-12-13 12:54:43,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 467 transitions, 6238 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 12:54:43,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:54:43,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 100 [2022-12-13 12:54:43,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:54:50,217 INFO L130 PetriNetUnfolder]: 28560/48912 cut-off events. [2022-12-13 12:54:50,218 INFO L131 PetriNetUnfolder]: For 319096/323834 co-relation queries the response was YES. [2022-12-13 12:54:50,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208655 conditions, 48912 events. 28560/48912 cut-off events. For 319096/323834 co-relation queries the response was YES. Maximal size of possible extension queue 1694. Compared 424033 event pairs, 19898 based on Foata normal form. 829/48294 useless extension candidates. Maximal degree in co-relation 190531. Up to 40256 conditions per place. [2022-12-13 12:54:50,643 INFO L137 encePairwiseOnDemand]: 91/100 looper letters, 319 selfloop transitions, 37 changer transitions 5/488 dead transitions. [2022-12-13 12:54:50,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 488 transitions, 6941 flow [2022-12-13 12:54:50,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:54:50,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:54:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2022-12-13 12:54:50,645 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3933333333333333 [2022-12-13 12:54:50,645 INFO L175 Difference]: Start difference. First operand has 151 places, 467 transitions, 6238 flow. Second operand 3 states and 118 transitions. [2022-12-13 12:54:50,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 488 transitions, 6941 flow [2022-12-13 12:54:52,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 488 transitions, 6757 flow, removed 92 selfloop flow, removed 0 redundant places. [2022-12-13 12:54:52,829 INFO L231 Difference]: Finished difference. Result has 152 places, 430 transitions, 5460 flow [2022-12-13 12:54:52,829 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=5417, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=5460, PETRI_PLACES=152, PETRI_TRANSITIONS=430} [2022-12-13 12:54:52,829 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 99 predicate places. [2022-12-13 12:54:52,829 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:54:52,829 INFO L89 Accepts]: Start accepts. Operand has 152 places, 430 transitions, 5460 flow [2022-12-13 12:54:52,832 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:54:52,832 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:54:52,832 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 430 transitions, 5460 flow [2022-12-13 12:54:52,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 430 transitions, 5460 flow [2022-12-13 12:54:53,436 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([534] L152-->L155: Formula: (and (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= (ite (not (and (not (= v_~n2~0_35 0)) (or (< v_~n2~0_35 v_~n3~0_45) (= v_~n2~0_35 v_~n3~0_45)))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|)) InVars {~n2~0=v_~n2~0_35, ~n3~0=v_~n3~0_45} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_35, ~n3~0=v_~n3~0_45, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][359], [251#true, Black: 253#(= ~n3~0 0), Black: 255#(and (= ~n1~0 ~n3~0) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 257#(and (or (= ~n1~0 ~n3~0) (<= (+ ~n1~0 1) ~n3~0)) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 259#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n3~0 1))), Black: 254#(and (<= ~n3~0 ~n1~0) (= ~n3~0 0)), 54#thread1EXITtrue, Black: 256#(and (or (and (= ~n2~0 ~n3~0) (<= (+ ~n1~0 1) ~n2~0)) (= ~n1~0 ~n3~0)) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 258#(and (<= (+ ~n1~0 1) ~n3~0) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 276#(= ~e2~0 1), Black: 289#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))), Black: 297#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n1~0 0)), Black: 291#(and (<= ~n2~0 0) (= ~n1~0 0)), Black: 283#(or (and (<= ~n2~0 0) (= ~n1~0 0)) (and (<= 1 ~n1~0) (<= ~n2~0 ~n1~0))), Black: 282#(or (and (<= ~n2~0 0) (= ~n1~0 0)) (and (= ~n2~0 ~n1~0) (<= 1 ~n2~0))), Black: 286#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n2~0 ~n3~0)), Black: 284#(or (and (<= 2 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)) (and (<= 1 ~n1~0) (<= ~n2~0 0))), Black: 285#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 293#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 287#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 158#(= ~i~0 0), 221#(or (= ~n2~0 0) (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0))), 11#thread2EXITtrue, Black: 315#(= ~e3~0 1), Black: 193#(and (<= (+ ~n2~0 1) ~n3~0) (<= 2 ~n2~0)), 42#L190-4true, Black: 190#(and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 192#(and (<= 2 ~n2~0) (= ~n2~0 ~n3~0)), Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 191#(and (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 205#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n2~0 1))), Black: 203#(and (<= 1 ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 202#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 204#(and (<= 1 ~n1~0) (= ~n3~0 0) (< ~n1~0 (+ ~n2~0 1))), 183#true, 156#true, Black: 213#(and (= ~e1~0 1) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 126#L155true, 281#(= ~n1~0 0), Black: 225#(and (or (= ~n3~0 0) (and (<= 2 ~n2~0) (<= ~n2~0 (+ ~n3~0 1)))) (or (and (<= 1 ~n2~0) (<= ~n2~0 1)) (not (= ~n3~0 0)))), Black: 220#(or (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)) (= ~n2~0 0)), Black: 236#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0)) (or (= ~n2~0 0) (= ~n2~0 ~n1~0))), Black: 224#(and (or (= ~n2~0 0) (not (= ~n3~0 0))) (or (and (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (= ~n3~0 0))), Black: 234#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (= ~n2~0 0) (= ~n2~0 ~n1~0))), 200#true, Black: 226#(or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (<= ~n2~0 ~n3~0)) (and (<= 2 ~n2~0) (<= ~n2~0 ~n3~0))), Black: 219#(and (or (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)) (= ~n2~0 0)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 223#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0))), Black: 222#(and (or (= ~n2~0 0) (<= ~n2~0 ~n3~0)) (or (= ~n2~0 0) (<= 1 ~n2~0))), Black: 232#(and (or (= ~n2~0 0) (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0))) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 313#true]) [2022-12-13 12:54:53,436 INFO L382 tUnfolder$Statistics]: this new event has 31 ancestors and is not cut-off event [2022-12-13 12:54:53,436 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2022-12-13 12:54:53,436 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2022-12-13 12:54:53,436 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2022-12-13 12:54:53,500 INFO L130 PetriNetUnfolder]: 2099/7060 cut-off events. [2022-12-13 12:54:53,500 INFO L131 PetriNetUnfolder]: For 52651/53649 co-relation queries the response was YES. [2022-12-13 12:54:53,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31934 conditions, 7060 events. 2099/7060 cut-off events. For 52651/53649 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 78434 event pairs, 390 based on Foata normal form. 74/6727 useless extension candidates. Maximal degree in co-relation 31153. Up to 1531 conditions per place. [2022-12-13 12:54:53,604 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 430 transitions, 5460 flow [2022-12-13 12:54:53,604 INFO L226 LiptonReduction]: Number of co-enabled transitions 4414 [2022-12-13 12:54:53,722 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [661] L136-->L146: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_81| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_81| (ite (= (mod v_~e1~0_190 256) 0) 1 0)) (= v_~e3~0_245 0) (= (+ v_~n3~0_621 1) v_~n3~0_620) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_81| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_81|)) InVars {~n3~0=v_~n3~0_621, ~e1~0=v_~e1~0_190} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_81|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_81|, ~n3~0=v_~n3~0_620, ~e3~0=v_~e3~0_245, ~e1~0=v_~e1~0_190, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_60|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~n3~0, ~e3~0, thread3Thread1of1ForFork0_#t~post3#1] and [570] L93-->L99: Formula: (and (= v_~e2~0_40 0) (= (+ v_~n2~0_76 1) v_~n2~0_75)) InVars {~n2~0=v_~n2~0_76} OutVars{~n2~0=v_~n2~0_75, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_9|, ~e2~0=v_~e2~0_40} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1, ~e2~0] [2022-12-13 12:54:54,007 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 12:54:54,008 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1179 [2022-12-13 12:54:54,008 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 429 transitions, 5469 flow [2022-12-13 12:54:54,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 12:54:54,008 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:54:54,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:54:54,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:54:54,008 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:54:54,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:54:54,009 INFO L85 PathProgramCache]: Analyzing trace with hash 508228947, now seen corresponding path program 1 times [2022-12-13 12:54:54,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:54:54,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31410193] [2022-12-13 12:54:54,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:54:54,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:54:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:54:54,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:54:54,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:54:54,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31410193] [2022-12-13 12:54:54,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31410193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:54:54,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:54:54,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 12:54:54,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497976612] [2022-12-13 12:54:54,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:54:54,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 12:54:54,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:54:54,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 12:54:54,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:54:54,268 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 82 [2022-12-13 12:54:54,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 429 transitions, 5469 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:54:54,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:54:54,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 82 [2022-12-13 12:54:54,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:55:02,984 INFO L130 PetriNetUnfolder]: 38686/64187 cut-off events. [2022-12-13 12:55:02,984 INFO L131 PetriNetUnfolder]: For 412353/414573 co-relation queries the response was YES. [2022-12-13 12:55:03,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280787 conditions, 64187 events. 38686/64187 cut-off events. For 412353/414573 co-relation queries the response was YES. Maximal size of possible extension queue 2148. Compared 548469 event pairs, 14937 based on Foata normal form. 466/64065 useless extension candidates. Maximal degree in co-relation 255948. Up to 43410 conditions per place. [2022-12-13 12:55:03,536 INFO L137 encePairwiseOnDemand]: 53/82 looper letters, 539 selfloop transitions, 209 changer transitions 0/761 dead transitions. [2022-12-13 12:55:03,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 761 transitions, 10479 flow [2022-12-13 12:55:03,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 12:55:03,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 12:55:03,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 337 transitions. [2022-12-13 12:55:03,537 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3736141906873614 [2022-12-13 12:55:03,537 INFO L175 Difference]: Start difference. First operand has 149 places, 429 transitions, 5469 flow. Second operand 11 states and 337 transitions. [2022-12-13 12:55:03,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 761 transitions, 10479 flow [2022-12-13 12:55:06,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 761 transitions, 10363 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 12:55:06,453 INFO L231 Difference]: Finished difference. Result has 166 places, 571 transitions, 8331 flow [2022-12-13 12:55:06,454 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=5359, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8331, PETRI_PLACES=166, PETRI_TRANSITIONS=571} [2022-12-13 12:55:06,454 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 113 predicate places. [2022-12-13 12:55:06,454 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:55:06,454 INFO L89 Accepts]: Start accepts. Operand has 166 places, 571 transitions, 8331 flow [2022-12-13 12:55:06,457 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:55:06,457 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:55:06,457 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 571 transitions, 8331 flow [2022-12-13 12:55:06,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 571 transitions, 8331 flow [2022-12-13 12:55:07,025 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([534] L152-->L155: Formula: (and (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= (ite (not (and (not (= v_~n2~0_35 0)) (or (< v_~n2~0_35 v_~n3~0_45) (= v_~n2~0_35 v_~n3~0_45)))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|)) InVars {~n2~0=v_~n2~0_35, ~n3~0=v_~n3~0_45} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_35, ~n3~0=v_~n3~0_45, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][232], [Black: 253#(= ~n3~0 0), 102#L63true, Black: 255#(and (= ~n1~0 ~n3~0) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 257#(and (or (= ~n1~0 ~n3~0) (<= (+ ~n1~0 1) ~n3~0)) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 259#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n3~0 1))), Black: 254#(and (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 256#(and (or (and (= ~n2~0 ~n3~0) (<= (+ ~n1~0 1) ~n2~0)) (= ~n1~0 ~n3~0)) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 276#(= ~e2~0 1), Black: 281#(= ~n1~0 0), Black: 289#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))), Black: 297#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n1~0 0)), Black: 291#(and (<= ~n2~0 0) (= ~n1~0 0)), Black: 283#(or (and (<= ~n2~0 0) (= ~n1~0 0)) (and (<= 1 ~n1~0) (<= ~n2~0 ~n1~0))), Black: 282#(or (and (<= ~n2~0 0) (= ~n1~0 0)) (and (= ~n2~0 ~n1~0) (<= 1 ~n2~0))), Black: 286#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n2~0 ~n3~0)), Black: 284#(or (and (<= 2 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)) (and (<= 1 ~n1~0) (<= ~n2~0 0))), Black: 285#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 293#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 287#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 158#(= ~i~0 0), 221#(or (= ~n2~0 0) (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0))), 11#thread2EXITtrue, Black: 315#(= ~e3~0 1), 42#L190-4true, Black: 193#(and (<= (+ ~n2~0 1) ~n3~0) (<= 2 ~n2~0)), Black: 190#(and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 192#(and (<= 2 ~n2~0) (= ~n2~0 ~n3~0)), Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 191#(and (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 329#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1)) (<= (+ ~n1~0 1) ~n3~0)), Black: 205#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n2~0 1))), Black: 326#(and (<= ~n1~0 ~n3~0) (or (= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0))), Black: 203#(and (<= 1 ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 322#(and (<= ~n1~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0) (<= ~n2~0 (+ ~n3~0 1))), Black: 202#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 319#(and (<= ~n1~0 ~n3~0) (<= ~n1~0 ~n2~0)), 183#true, Black: 204#(and (<= 1 ~n1~0) (= ~n3~0 0) (< ~n1~0 (+ ~n2~0 1))), Black: 324#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), 317#true, Black: 323#(and (<= ~n3~0 ~n2~0) (<= ~n2~0 ~n3~0) (<= (+ ~n1~0 1) ~n3~0)), 156#true, Black: 332#(and (<= ~n1~0 ~n3~0) (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), Black: 320#(and (<= ~n1~0 ~n2~0) (or (= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0))), Black: 321#(and (<= ~n1~0 ~n3~0) (= ~n2~0 ~n3~0)), Black: 213#(and (= ~e1~0 1) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 126#L155true, 258#(and (<= (+ ~n1~0 1) ~n3~0) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 225#(and (or (= ~n3~0 0) (and (<= 2 ~n2~0) (<= ~n2~0 (+ ~n3~0 1)))) (or (and (<= 1 ~n2~0) (<= ~n2~0 1)) (not (= ~n3~0 0)))), Black: 220#(or (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)) (= ~n2~0 0)), Black: 236#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0)) (or (= ~n2~0 0) (= ~n2~0 ~n1~0))), Black: 224#(and (or (= ~n2~0 0) (not (= ~n3~0 0))) (or (and (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (= ~n3~0 0))), 200#true, Black: 234#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (= ~n2~0 0) (= ~n2~0 ~n1~0))), Black: 226#(or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (<= ~n2~0 ~n3~0)) (and (<= 2 ~n2~0) (<= ~n2~0 ~n3~0))), Black: 219#(and (or (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)) (= ~n2~0 0)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 223#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0))), Black: 222#(and (or (= ~n2~0 0) (<= ~n2~0 ~n3~0)) (or (= ~n2~0 0) (<= 1 ~n2~0))), Black: 232#(and (or (= ~n2~0 0) (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0))) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 279#true]) [2022-12-13 12:55:07,025 INFO L382 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-12-13 12:55:07,025 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 12:55:07,025 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 12:55:07,025 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 12:55:07,433 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([534] L152-->L155: Formula: (and (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= (ite (not (and (not (= v_~n2~0_35 0)) (or (< v_~n2~0_35 v_~n3~0_45) (= v_~n2~0_35 v_~n3~0_45)))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|)) InVars {~n2~0=v_~n2~0_35, ~n3~0=v_~n3~0_45} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_35, ~n3~0=v_~n3~0_45, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][508], [251#true, Black: 253#(= ~n3~0 0), Black: 255#(and (= ~n1~0 ~n3~0) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 257#(and (or (= ~n1~0 ~n3~0) (<= (+ ~n1~0 1) ~n3~0)) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 259#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n3~0 1))), Black: 254#(and (<= ~n3~0 ~n1~0) (= ~n3~0 0)), 54#thread1EXITtrue, Black: 256#(and (or (and (= ~n2~0 ~n3~0) (<= (+ ~n1~0 1) ~n2~0)) (= ~n1~0 ~n3~0)) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 258#(and (<= (+ ~n1~0 1) ~n3~0) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 276#(= ~e2~0 1), Black: 289#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))), Black: 297#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n1~0 0)), Black: 291#(and (<= ~n2~0 0) (= ~n1~0 0)), Black: 283#(or (and (<= ~n2~0 0) (= ~n1~0 0)) (and (<= 1 ~n1~0) (<= ~n2~0 ~n1~0))), Black: 282#(or (and (<= ~n2~0 0) (= ~n1~0 0)) (and (= ~n2~0 ~n1~0) (<= 1 ~n2~0))), Black: 286#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n2~0 ~n3~0)), Black: 284#(or (and (<= 2 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)) (and (<= 1 ~n1~0) (<= ~n2~0 0))), Black: 285#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 293#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 287#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 158#(= ~i~0 0), 221#(or (= ~n2~0 0) (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0))), 11#thread2EXITtrue, Black: 315#(= ~e3~0 1), 42#L190-4true, Black: 193#(and (<= (+ ~n2~0 1) ~n3~0) (<= 2 ~n2~0)), Black: 190#(and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 192#(and (<= 2 ~n2~0) (= ~n2~0 ~n3~0)), Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 191#(and (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 205#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n2~0 1))), Black: 329#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1)) (<= (+ ~n1~0 1) ~n3~0)), Black: 326#(and (<= ~n1~0 ~n3~0) (or (= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0))), Black: 203#(and (<= 1 ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 322#(and (<= ~n1~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0) (<= ~n2~0 (+ ~n3~0 1))), Black: 202#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 183#true, Black: 204#(and (<= 1 ~n1~0) (= ~n3~0 0) (< ~n1~0 (+ ~n2~0 1))), Black: 319#(and (<= ~n1~0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 324#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), 317#true, Black: 323#(and (<= ~n3~0 ~n2~0) (<= ~n2~0 ~n3~0) (<= (+ ~n1~0 1) ~n3~0)), 156#true, Black: 332#(and (<= ~n1~0 ~n3~0) (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), Black: 320#(and (<= ~n1~0 ~n2~0) (or (= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0))), Black: 321#(and (<= ~n1~0 ~n3~0) (= ~n2~0 ~n3~0)), Black: 213#(and (= ~e1~0 1) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 126#L155true, 281#(= ~n1~0 0), Black: 225#(and (or (= ~n3~0 0) (and (<= 2 ~n2~0) (<= ~n2~0 (+ ~n3~0 1)))) (or (and (<= 1 ~n2~0) (<= ~n2~0 1)) (not (= ~n3~0 0)))), Black: 220#(or (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)) (= ~n2~0 0)), Black: 236#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0)) (or (= ~n2~0 0) (= ~n2~0 ~n1~0))), Black: 224#(and (or (= ~n2~0 0) (not (= ~n3~0 0))) (or (and (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (= ~n3~0 0))), 200#true, Black: 234#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (= ~n2~0 0) (= ~n2~0 ~n1~0))), Black: 226#(or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (<= ~n2~0 ~n3~0)) (and (<= 2 ~n2~0) (<= ~n2~0 ~n3~0))), Black: 219#(and (or (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)) (= ~n2~0 0)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 223#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0))), Black: 222#(and (or (= ~n2~0 0) (<= ~n2~0 ~n3~0)) (or (= ~n2~0 0) (<= 1 ~n2~0))), Black: 232#(and (or (= ~n2~0 0) (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0))) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0))]) [2022-12-13 12:55:07,433 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is not cut-off event [2022-12-13 12:55:07,433 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2022-12-13 12:55:07,433 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2022-12-13 12:55:07,433 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2022-12-13 12:55:07,476 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([599] L76-->thread1EXIT: Formula: (and (= v_~n1~0_165 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_7| 0)) InVars {} OutVars{~n1~0=v_~n1~0_165, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_7|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][541], [251#true, Black: 253#(= ~n3~0 0), Black: 255#(and (= ~n1~0 ~n3~0) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 257#(and (or (= ~n1~0 ~n3~0) (<= (+ ~n1~0 1) ~n3~0)) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 259#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n3~0 1))), Black: 254#(and (<= ~n3~0 ~n1~0) (= ~n3~0 0)), 54#thread1EXITtrue, Black: 256#(and (or (and (= ~n2~0 ~n3~0) (<= (+ ~n1~0 1) ~n2~0)) (= ~n1~0 ~n3~0)) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 258#(and (<= (+ ~n1~0 1) ~n3~0) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 276#(= ~e2~0 1), Black: 289#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))), Black: 297#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n1~0 0)), Black: 291#(and (<= ~n2~0 0) (= ~n1~0 0)), Black: 283#(or (and (<= ~n2~0 0) (= ~n1~0 0)) (and (<= 1 ~n1~0) (<= ~n2~0 ~n1~0))), Black: 282#(or (and (<= ~n2~0 0) (= ~n1~0 0)) (and (= ~n2~0 ~n1~0) (<= 1 ~n2~0))), Black: 286#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n2~0 ~n3~0)), Black: 284#(or (and (<= 2 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)) (and (<= 1 ~n1~0) (<= ~n2~0 0))), Black: 285#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 293#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 287#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 158#(= ~i~0 0), 11#thread2EXITtrue, Black: 315#(= ~e3~0 1), 42#L190-4true, Black: 193#(and (<= (+ ~n2~0 1) ~n3~0) (<= 2 ~n2~0)), Black: 190#(and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 192#(and (<= 2 ~n2~0) (= ~n2~0 ~n3~0)), Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 191#(and (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 329#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1)) (<= (+ ~n1~0 1) ~n3~0)), Black: 205#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n2~0 1))), Black: 203#(and (<= 1 ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 326#(and (<= ~n1~0 ~n3~0) (or (= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0))), Black: 322#(and (<= ~n1~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0) (<= ~n2~0 (+ ~n3~0 1))), Black: 202#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 204#(and (<= 1 ~n1~0) (= ~n3~0 0) (< ~n1~0 (+ ~n2~0 1))), Black: 319#(and (<= ~n1~0 ~n3~0) (<= ~n1~0 ~n2~0)), 183#true, Black: 324#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), Black: 323#(and (<= ~n3~0 ~n2~0) (<= ~n2~0 ~n3~0) (<= (+ ~n1~0 1) ~n3~0)), 317#true, Black: 332#(and (<= ~n1~0 ~n3~0) (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), 156#true, Black: 320#(and (<= ~n1~0 ~n2~0) (or (= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0))), Black: 321#(and (<= ~n1~0 ~n3~0) (= ~n2~0 ~n3~0)), Black: 213#(and (= ~e1~0 1) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 223#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0))), 126#L155true, 281#(= ~n1~0 0), Black: 225#(and (or (= ~n3~0 0) (and (<= 2 ~n2~0) (<= ~n2~0 (+ ~n3~0 1)))) (or (and (<= 1 ~n2~0) (<= ~n2~0 1)) (not (= ~n3~0 0)))), Black: 220#(or (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)) (= ~n2~0 0)), Black: 236#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0)) (or (= ~n2~0 0) (= ~n2~0 ~n1~0))), Black: 224#(and (or (= ~n2~0 0) (not (= ~n3~0 0))) (or (and (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (= ~n3~0 0))), Black: 221#(or (= ~n2~0 0) (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0))), Black: 234#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (= ~n2~0 0) (= ~n2~0 ~n1~0))), 200#true, Black: 226#(or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (<= ~n2~0 ~n3~0)) (and (<= 2 ~n2~0) (<= ~n2~0 ~n3~0))), Black: 219#(and (or (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)) (= ~n2~0 0)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 222#(and (or (= ~n2~0 0) (<= ~n2~0 ~n3~0)) (or (= ~n2~0 0) (<= 1 ~n2~0))), Black: 232#(and (or (= ~n2~0 0) (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0))) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0))]) [2022-12-13 12:55:07,476 INFO L382 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 12:55:07,476 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 12:55:07,476 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 12:55:07,476 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 12:55:07,543 INFO L130 PetriNetUnfolder]: 3188/9812 cut-off events. [2022-12-13 12:55:07,543 INFO L131 PetriNetUnfolder]: For 104140/106237 co-relation queries the response was YES. [2022-12-13 12:55:07,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50575 conditions, 9812 events. 3188/9812 cut-off events. For 104140/106237 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 111363 event pairs, 725 based on Foata normal form. 215/9412 useless extension candidates. Maximal degree in co-relation 49704. Up to 2143 conditions per place. [2022-12-13 12:55:07,790 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 571 transitions, 8331 flow [2022-12-13 12:55:07,790 INFO L226 LiptonReduction]: Number of co-enabled transitions 5660 [2022-12-13 12:55:08,565 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 12:55:08,566 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2112 [2022-12-13 12:55:08,566 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 576 transitions, 8441 flow [2022-12-13 12:55:08,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:55:08,566 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:55:08,566 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:55:08,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:55:08,567 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:55:08,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:55:08,567 INFO L85 PathProgramCache]: Analyzing trace with hash 445155749, now seen corresponding path program 1 times [2022-12-13 12:55:08,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:55:08,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148161409] [2022-12-13 12:55:08,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:55:08,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:55:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:55:08,805 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 12:55:08,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:55:08,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148161409] [2022-12-13 12:55:08,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148161409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:55:08,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:55:08,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:55:08,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950974360] [2022-12-13 12:55:08,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:55:08,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:55:08,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:55:08,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:55:08,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:55:08,807 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 92 [2022-12-13 12:55:08,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 576 transitions, 8441 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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 12:55:08,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:55:08,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 92 [2022-12-13 12:55:08,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:55:20,126 INFO L130 PetriNetUnfolder]: 41711/68580 cut-off events. [2022-12-13 12:55:20,127 INFO L131 PetriNetUnfolder]: For 597341/601036 co-relation queries the response was YES. [2022-12-13 12:55:20,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332334 conditions, 68580 events. 41711/68580 cut-off events. For 597341/601036 co-relation queries the response was YES. Maximal size of possible extension queue 2365. Compared 585447 event pairs, 18550 based on Foata normal form. 592/68264 useless extension candidates. Maximal degree in co-relation 305932. Up to 54422 conditions per place. [2022-12-13 12:55:21,070 INFO L137 encePairwiseOnDemand]: 73/92 looper letters, 567 selfloop transitions, 93 changer transitions 5/678 dead transitions. [2022-12-13 12:55:21,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 678 transitions, 10970 flow [2022-12-13 12:55:21,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:55:21,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:55:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2022-12-13 12:55:21,071 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32971014492753625 [2022-12-13 12:55:21,071 INFO L175 Difference]: Start difference. First operand has 169 places, 576 transitions, 8441 flow. Second operand 6 states and 182 transitions. [2022-12-13 12:55:21,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 678 transitions, 10970 flow [2022-12-13 12:55:26,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 678 transitions, 10524 flow, removed 223 selfloop flow, removed 0 redundant places. [2022-12-13 12:55:26,009 INFO L231 Difference]: Finished difference. Result has 177 places, 597 transitions, 8759 flow [2022-12-13 12:55:26,009 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=8032, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8759, PETRI_PLACES=177, PETRI_TRANSITIONS=597} [2022-12-13 12:55:26,009 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 124 predicate places. [2022-12-13 12:55:26,009 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:55:26,009 INFO L89 Accepts]: Start accepts. Operand has 177 places, 597 transitions, 8759 flow [2022-12-13 12:55:26,013 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:55:26,013 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:55:26,013 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 597 transitions, 8759 flow [2022-12-13 12:55:26,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 597 transitions, 8759 flow [2022-12-13 12:55:26,648 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([532] L146-->L149: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= (ite (not (and (or (= v_~n1~0_39 v_~n3~0_43) (< v_~n1~0_39 v_~n3~0_43)) (not (= v_~n1~0_39 0)))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|)) InVars {~n3~0=v_~n3~0_43, ~n1~0=v_~n1~0_39} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, ~n3~0=v_~n3~0_43, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, ~n1~0=v_~n1~0_39} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][108], [251#true, Black: 253#(= ~n3~0 0), Black: 255#(and (= ~n1~0 ~n3~0) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 257#(and (or (= ~n1~0 ~n3~0) (<= (+ ~n1~0 1) ~n3~0)) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 259#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n3~0 1))), 118#L149true, Black: 254#(and (<= ~n3~0 ~n1~0) (= ~n3~0 0)), 54#thread1EXITtrue, Black: 256#(and (or (and (= ~n2~0 ~n3~0) (<= (+ ~n1~0 1) ~n2~0)) (= ~n1~0 ~n3~0)) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 258#(and (<= (+ ~n1~0 1) ~n3~0) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 276#(= ~e2~0 1), 6#L106true, Black: 289#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))), Black: 297#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n1~0 0)), Black: 291#(and (<= ~n2~0 0) (= ~n1~0 0)), Black: 283#(or (and (<= ~n2~0 0) (= ~n1~0 0)) (and (<= 1 ~n1~0) (<= ~n2~0 ~n1~0))), Black: 282#(or (and (<= ~n2~0 0) (= ~n1~0 0)) (and (= ~n2~0 ~n1~0) (<= 1 ~n2~0))), Black: 286#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n2~0 ~n3~0)), Black: 284#(or (and (<= 2 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)) (and (<= 1 ~n1~0) (<= ~n2~0 0))), Black: 285#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 346#true, Black: 293#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 287#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 158#(= ~i~0 0), Black: 315#(= ~e3~0 1), Black: 193#(and (<= (+ ~n2~0 1) ~n3~0) (<= 2 ~n2~0)), 42#L190-4true, Black: 190#(and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 192#(and (<= 2 ~n2~0) (= ~n2~0 ~n3~0)), Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 191#(and (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 329#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1)) (<= (+ ~n1~0 1) ~n3~0)), Black: 205#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n2~0 1))), Black: 326#(and (<= ~n1~0 ~n3~0) (or (= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0))), Black: 203#(and (<= 1 ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 202#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 322#(and (<= ~n1~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0) (<= ~n2~0 (+ ~n3~0 1))), 183#true, Black: 319#(and (<= ~n1~0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 204#(and (<= 1 ~n1~0) (= ~n3~0 0) (< ~n1~0 (+ ~n2~0 1))), Black: 324#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), Black: 323#(and (<= ~n3~0 ~n2~0) (<= ~n2~0 ~n3~0) (<= (+ ~n1~0 1) ~n3~0)), 317#true, 156#true, Black: 332#(and (<= ~n1~0 ~n3~0) (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), Black: 320#(and (<= ~n1~0 ~n2~0) (or (= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0))), Black: 321#(and (<= ~n1~0 ~n3~0) (= ~n2~0 ~n3~0)), Black: 213#(and (= ~e1~0 1) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 350#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0) (< ~n3~0 (+ ~n2~0 1))), 281#(= ~n1~0 0), Black: 349#(and (<= 1 ~n2~0) (<= (+ ~n3~0 1) ~n2~0) (<= ~n2~0 (+ ~n3~0 1)) (= ~n1~0 0)), Black: 351#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), Black: 225#(and (or (= ~n3~0 0) (and (<= 2 ~n2~0) (<= ~n2~0 (+ ~n3~0 1)))) (or (and (<= 1 ~n2~0) (<= ~n2~0 1)) (not (= ~n3~0 0)))), Black: 220#(or (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)) (= ~n2~0 0)), Black: 236#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0)) (or (= ~n2~0 0) (= ~n2~0 ~n1~0))), Black: 224#(and (or (= ~n2~0 0) (not (= ~n3~0 0))) (or (and (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (= ~n3~0 0))), Black: 221#(or (= ~n2~0 0) (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0))), 200#true, Black: 234#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (= ~n2~0 0) (= ~n2~0 ~n1~0))), Black: 226#(or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (<= ~n2~0 ~n3~0)) (and (<= 2 ~n2~0) (<= ~n2~0 ~n3~0))), Black: 219#(and (or (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)) (= ~n2~0 0)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 223#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0))), Black: 222#(and (or (= ~n2~0 0) (<= ~n2~0 ~n3~0)) (or (= ~n2~0 0) (<= 1 ~n2~0))), Black: 232#(and (or (= ~n2~0 0) (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0))) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 216#true]) [2022-12-13 12:55:26,648 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2022-12-13 12:55:26,648 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-13 12:55:26,648 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-13 12:55:26,648 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-13 12:55:27,014 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L119-->thread2EXIT: Formula: (and (= v_~n2~0_178 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_178, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][520], [Black: 253#(= ~n3~0 0), Black: 255#(and (= ~n1~0 ~n3~0) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 257#(and (or (= ~n1~0 ~n3~0) (<= (+ ~n1~0 1) ~n3~0)) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 259#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n3~0 1))), Black: 254#(and (<= ~n3~0 ~n1~0) (= ~n3~0 0)), 54#thread1EXITtrue, Black: 256#(and (or (and (= ~n2~0 ~n3~0) (<= (+ ~n1~0 1) ~n2~0)) (= ~n1~0 ~n3~0)) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 276#(= ~e2~0 1), Black: 281#(= ~n1~0 0), Black: 289#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))), Black: 297#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n1~0 0)), Black: 283#(or (and (<= ~n2~0 0) (= ~n1~0 0)) (and (<= 1 ~n1~0) (<= ~n2~0 ~n1~0))), Black: 282#(or (and (<= ~n2~0 0) (= ~n1~0 0)) (and (= ~n2~0 ~n1~0) (<= 1 ~n2~0))), Black: 286#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n2~0 ~n3~0)), Black: 284#(or (and (<= 2 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)) (and (<= 1 ~n1~0) (<= ~n2~0 0))), Black: 285#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 346#true, Black: 293#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 287#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 291#(and (<= ~n2~0 0) (= ~n1~0 0)), Black: 158#(= ~i~0 0), 221#(or (= ~n2~0 0) (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0))), 11#thread2EXITtrue, Black: 315#(= ~e3~0 1), Black: 193#(and (<= (+ ~n2~0 1) ~n3~0) (<= 2 ~n2~0)), 42#L190-4true, Black: 190#(and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 192#(and (<= 2 ~n2~0) (= ~n2~0 ~n3~0)), Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 191#(and (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 329#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1)) (<= (+ ~n1~0 1) ~n3~0)), Black: 205#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n2~0 1))), Black: 203#(and (<= 1 ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 326#(and (<= ~n1~0 ~n3~0) (or (= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0))), Black: 322#(and (<= ~n1~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0) (<= ~n2~0 (+ ~n3~0 1))), Black: 202#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 319#(and (<= ~n1~0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 204#(and (<= 1 ~n1~0) (= ~n3~0 0) (< ~n1~0 (+ ~n2~0 1))), 183#true, Black: 324#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), Black: 323#(and (<= ~n3~0 ~n2~0) (<= ~n2~0 ~n3~0) (<= (+ ~n1~0 1) ~n3~0)), 317#true, Black: 332#(and (<= ~n1~0 ~n3~0) (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), 156#true, Black: 320#(and (<= ~n1~0 ~n2~0) (or (= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0))), Black: 321#(and (<= ~n1~0 ~n3~0) (= ~n2~0 ~n3~0)), Black: 213#(and (= ~e1~0 1) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 126#L155true, 258#(and (<= (+ ~n1~0 1) ~n3~0) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 350#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0) (< ~n3~0 (+ ~n2~0 1))), Black: 349#(and (<= 1 ~n2~0) (<= (+ ~n3~0 1) ~n2~0) (<= ~n2~0 (+ ~n3~0 1)) (= ~n1~0 0)), Black: 351#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), Black: 225#(and (or (= ~n3~0 0) (and (<= 2 ~n2~0) (<= ~n2~0 (+ ~n3~0 1)))) (or (and (<= 1 ~n2~0) (<= ~n2~0 1)) (not (= ~n3~0 0)))), Black: 220#(or (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)) (= ~n2~0 0)), Black: 236#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0)) (or (= ~n2~0 0) (= ~n2~0 ~n1~0))), Black: 224#(and (or (= ~n2~0 0) (not (= ~n3~0 0))) (or (and (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (= ~n3~0 0))), Black: 234#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (= ~n2~0 0) (= ~n2~0 ~n1~0))), 200#true, Black: 226#(or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (<= ~n2~0 ~n3~0)) (and (<= 2 ~n2~0) (<= ~n2~0 ~n3~0))), Black: 219#(and (or (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)) (= ~n2~0 0)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 223#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0))), Black: 222#(and (or (= ~n2~0 0) (<= ~n2~0 ~n3~0)) (or (= ~n2~0 0) (<= 1 ~n2~0))), Black: 232#(and (or (= ~n2~0 0) (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0))) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0))]) [2022-12-13 12:55:27,014 INFO L382 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 12:55:27,014 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 12:55:27,014 INFO L385 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 12:55:27,014 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 12:55:27,045 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([534] L152-->L155: Formula: (and (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= (ite (not (and (not (= v_~n2~0_35 0)) (or (< v_~n2~0_35 v_~n3~0_45) (= v_~n2~0_35 v_~n3~0_45)))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|)) InVars {~n2~0=v_~n2~0_35, ~n3~0=v_~n3~0_45} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_35, ~n3~0=v_~n3~0_45, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][525], [251#true, Black: 253#(= ~n3~0 0), Black: 255#(and (= ~n1~0 ~n3~0) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 257#(and (or (= ~n1~0 ~n3~0) (<= (+ ~n1~0 1) ~n3~0)) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 259#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n3~0 1))), Black: 254#(and (<= ~n3~0 ~n1~0) (= ~n3~0 0)), 54#thread1EXITtrue, Black: 256#(and (or (and (= ~n2~0 ~n3~0) (<= (+ ~n1~0 1) ~n2~0)) (= ~n1~0 ~n3~0)) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 258#(and (<= (+ ~n1~0 1) ~n3~0) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 276#(= ~e2~0 1), Black: 289#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))), Black: 297#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n1~0 0)), Black: 291#(and (<= ~n2~0 0) (= ~n1~0 0)), Black: 283#(or (and (<= ~n2~0 0) (= ~n1~0 0)) (and (<= 1 ~n1~0) (<= ~n2~0 ~n1~0))), Black: 282#(or (and (<= ~n2~0 0) (= ~n1~0 0)) (and (= ~n2~0 ~n1~0) (<= 1 ~n2~0))), Black: 286#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n2~0 ~n3~0)), Black: 284#(or (and (<= 2 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)) (and (<= 1 ~n1~0) (<= ~n2~0 0))), Black: 285#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 346#true, Black: 293#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 287#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 158#(= ~i~0 0), 221#(or (= ~n2~0 0) (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0))), 11#thread2EXITtrue, Black: 315#(= ~e3~0 1), 42#L190-4true, Black: 193#(and (<= (+ ~n2~0 1) ~n3~0) (<= 2 ~n2~0)), Black: 190#(and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 192#(and (<= 2 ~n2~0) (= ~n2~0 ~n3~0)), Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 191#(and (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 329#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1)) (<= (+ ~n1~0 1) ~n3~0)), Black: 205#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n2~0 1))), Black: 326#(and (<= ~n1~0 ~n3~0) (or (= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0))), Black: 203#(and (<= 1 ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 322#(and (<= ~n1~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0) (<= ~n2~0 (+ ~n3~0 1))), Black: 202#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 319#(and (<= ~n1~0 ~n3~0) (<= ~n1~0 ~n2~0)), 183#true, Black: 204#(and (<= 1 ~n1~0) (= ~n3~0 0) (< ~n1~0 (+ ~n2~0 1))), Black: 324#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), Black: 323#(and (<= ~n3~0 ~n2~0) (<= ~n2~0 ~n3~0) (<= (+ ~n1~0 1) ~n3~0)), 317#true, Black: 332#(and (<= ~n1~0 ~n3~0) (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), 156#true, Black: 320#(and (<= ~n1~0 ~n2~0) (or (= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0))), Black: 321#(and (<= ~n1~0 ~n3~0) (= ~n2~0 ~n3~0)), Black: 213#(and (= ~e1~0 1) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 126#L155true, Black: 350#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0) (< ~n3~0 (+ ~n2~0 1))), 281#(= ~n1~0 0), Black: 349#(and (<= 1 ~n2~0) (<= (+ ~n3~0 1) ~n2~0) (<= ~n2~0 (+ ~n3~0 1)) (= ~n1~0 0)), Black: 351#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), Black: 225#(and (or (= ~n3~0 0) (and (<= 2 ~n2~0) (<= ~n2~0 (+ ~n3~0 1)))) (or (and (<= 1 ~n2~0) (<= ~n2~0 1)) (not (= ~n3~0 0)))), Black: 220#(or (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)) (= ~n2~0 0)), Black: 236#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0)) (or (= ~n2~0 0) (= ~n2~0 ~n1~0))), Black: 224#(and (or (= ~n2~0 0) (not (= ~n3~0 0))) (or (and (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (= ~n3~0 0))), Black: 234#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (= ~n2~0 0) (= ~n2~0 ~n1~0))), 200#true, Black: 226#(or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (<= ~n2~0 ~n3~0)) (and (<= 2 ~n2~0) (<= ~n2~0 ~n3~0))), Black: 219#(and (or (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)) (= ~n2~0 0)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 223#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0))), Black: 222#(and (or (= ~n2~0 0) (<= ~n2~0 ~n3~0)) (or (= ~n2~0 0) (<= 1 ~n2~0))), Black: 232#(and (or (= ~n2~0 0) (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0))) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0))]) [2022-12-13 12:55:27,046 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is not cut-off event [2022-12-13 12:55:27,046 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2022-12-13 12:55:27,046 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2022-12-13 12:55:27,046 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2022-12-13 12:55:27,104 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([599] L76-->thread1EXIT: Formula: (and (= v_~n1~0_165 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_7| 0)) InVars {} OutVars{~n1~0=v_~n1~0_165, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_7|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][570], [251#true, Black: 253#(= ~n3~0 0), Black: 255#(and (= ~n1~0 ~n3~0) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 257#(and (or (= ~n1~0 ~n3~0) (<= (+ ~n1~0 1) ~n3~0)) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 259#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n3~0 1))), Black: 254#(and (<= ~n3~0 ~n1~0) (= ~n3~0 0)), 54#thread1EXITtrue, Black: 256#(and (or (and (= ~n2~0 ~n3~0) (<= (+ ~n1~0 1) ~n2~0)) (= ~n1~0 ~n3~0)) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 258#(and (<= (+ ~n1~0 1) ~n3~0) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 276#(= ~e2~0 1), Black: 289#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))), Black: 297#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n1~0 0)), Black: 291#(and (<= ~n2~0 0) (= ~n1~0 0)), Black: 283#(or (and (<= ~n2~0 0) (= ~n1~0 0)) (and (<= 1 ~n1~0) (<= ~n2~0 ~n1~0))), Black: 282#(or (and (<= ~n2~0 0) (= ~n1~0 0)) (and (= ~n2~0 ~n1~0) (<= 1 ~n2~0))), Black: 286#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n2~0 ~n3~0)), Black: 284#(or (and (<= 2 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)) (and (<= 1 ~n1~0) (<= ~n2~0 0))), Black: 285#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 346#true, Black: 293#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 287#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 158#(= ~i~0 0), 11#thread2EXITtrue, Black: 315#(= ~e3~0 1), 42#L190-4true, Black: 193#(and (<= (+ ~n2~0 1) ~n3~0) (<= 2 ~n2~0)), Black: 190#(and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 192#(and (<= 2 ~n2~0) (= ~n2~0 ~n3~0)), Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 191#(and (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 329#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1)) (<= (+ ~n1~0 1) ~n3~0)), Black: 205#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n2~0 1))), Black: 203#(and (<= 1 ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 326#(and (<= ~n1~0 ~n3~0) (or (= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0))), Black: 202#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 322#(and (<= ~n1~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0) (<= ~n2~0 (+ ~n3~0 1))), 183#true, Black: 319#(and (<= ~n1~0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 204#(and (<= 1 ~n1~0) (= ~n3~0 0) (< ~n1~0 (+ ~n2~0 1))), Black: 324#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), 317#true, Black: 323#(and (<= ~n3~0 ~n2~0) (<= ~n2~0 ~n3~0) (<= (+ ~n1~0 1) ~n3~0)), 156#true, Black: 332#(and (<= ~n1~0 ~n3~0) (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), Black: 320#(and (<= ~n1~0 ~n2~0) (or (= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0))), Black: 321#(and (<= ~n1~0 ~n3~0) (= ~n2~0 ~n3~0)), Black: 213#(and (= ~e1~0 1) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 223#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0))), 126#L155true, 281#(= ~n1~0 0), Black: 350#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0) (< ~n3~0 (+ ~n2~0 1))), Black: 349#(and (<= 1 ~n2~0) (<= (+ ~n3~0 1) ~n2~0) (<= ~n2~0 (+ ~n3~0 1)) (= ~n1~0 0)), Black: 351#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), Black: 225#(and (or (= ~n3~0 0) (and (<= 2 ~n2~0) (<= ~n2~0 (+ ~n3~0 1)))) (or (and (<= 1 ~n2~0) (<= ~n2~0 1)) (not (= ~n3~0 0)))), Black: 220#(or (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)) (= ~n2~0 0)), Black: 236#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0)) (or (= ~n2~0 0) (= ~n2~0 ~n1~0))), Black: 224#(and (or (= ~n2~0 0) (not (= ~n3~0 0))) (or (and (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (= ~n3~0 0))), Black: 221#(or (= ~n2~0 0) (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0))), Black: 234#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (= ~n2~0 0) (= ~n2~0 ~n1~0))), 200#true, Black: 226#(or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (<= ~n2~0 ~n3~0)) (and (<= 2 ~n2~0) (<= ~n2~0 ~n3~0))), Black: 219#(and (or (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)) (= ~n2~0 0)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 222#(and (or (= ~n2~0 0) (<= ~n2~0 ~n3~0)) (or (= ~n2~0 0) (<= 1 ~n2~0))), Black: 232#(and (or (= ~n2~0 0) (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0))) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0))]) [2022-12-13 12:55:27,104 INFO L382 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 12:55:27,104 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 12:55:27,105 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 12:55:27,105 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 12:55:27,168 INFO L130 PetriNetUnfolder]: 3311/10339 cut-off events. [2022-12-13 12:55:27,168 INFO L131 PetriNetUnfolder]: For 118627/121026 co-relation queries the response was YES. [2022-12-13 12:55:27,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53618 conditions, 10339 events. 3311/10339 cut-off events. For 118627/121026 co-relation queries the response was YES. Maximal size of possible extension queue 678. Compared 119745 event pairs, 788 based on Foata normal form. 253/9932 useless extension candidates. Maximal degree in co-relation 52702. Up to 2162 conditions per place. [2022-12-13 12:55:27,448 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 597 transitions, 8759 flow [2022-12-13 12:55:27,448 INFO L226 LiptonReduction]: Number of co-enabled transitions 5830 [2022-12-13 12:55:27,740 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 12:55:27,741 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1732 [2022-12-13 12:55:27,741 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 599 transitions, 8813 flow [2022-12-13 12:55:27,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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 12:55:27,741 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:55:27,741 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:55:27,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:55:27,741 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:55:27,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:55:27,741 INFO L85 PathProgramCache]: Analyzing trace with hash 263610296, now seen corresponding path program 1 times [2022-12-13 12:55:27,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:55:27,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496235103] [2022-12-13 12:55:27,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:55:27,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:55:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:55:27,992 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 12:55:27,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:55:27,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496235103] [2022-12-13 12:55:27,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496235103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:55:27,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:55:27,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:55:27,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819313528] [2022-12-13 12:55:27,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:55:27,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:55:27,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:55:27,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:55:27,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:55:27,994 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 96 [2022-12-13 12:55:27,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 599 transitions, 8813 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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 12:55:27,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:55:27,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 96 [2022-12-13 12:55:27,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:55:39,535 INFO L130 PetriNetUnfolder]: 42124/69193 cut-off events. [2022-12-13 12:55:39,535 INFO L131 PetriNetUnfolder]: For 638589/642214 co-relation queries the response was YES. [2022-12-13 12:55:40,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340155 conditions, 69193 events. 42124/69193 cut-off events. For 638589/642214 co-relation queries the response was YES. Maximal size of possible extension queue 2375. Compared 590540 event pairs, 19515 based on Foata normal form. 268/68511 useless extension candidates. Maximal degree in co-relation 313653. Up to 62676 conditions per place. [2022-12-13 12:55:40,495 INFO L137 encePairwiseOnDemand]: 78/96 looper letters, 578 selfloop transitions, 72 changer transitions 11/674 dead transitions. [2022-12-13 12:55:40,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 674 transitions, 10902 flow [2022-12-13 12:55:40,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:55:40,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:55:40,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 172 transitions. [2022-12-13 12:55:40,497 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2986111111111111 [2022-12-13 12:55:40,497 INFO L175 Difference]: Start difference. First operand has 175 places, 599 transitions, 8813 flow. Second operand 6 states and 172 transitions. [2022-12-13 12:55:40,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 674 transitions, 10902 flow [2022-12-13 12:55:45,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 674 transitions, 10693 flow, removed 74 selfloop flow, removed 1 redundant places. [2022-12-13 12:55:45,109 INFO L231 Difference]: Finished difference. Result has 182 places, 594 transitions, 8760 flow [2022-12-13 12:55:45,109 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=8538, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8760, PETRI_PLACES=182, PETRI_TRANSITIONS=594} [2022-12-13 12:55:45,110 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 129 predicate places. [2022-12-13 12:55:45,110 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:55:45,110 INFO L89 Accepts]: Start accepts. Operand has 182 places, 594 transitions, 8760 flow [2022-12-13 12:55:45,113 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:55:45,113 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:55:45,113 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 594 transitions, 8760 flow [2022-12-13 12:55:45,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 594 transitions, 8760 flow [2022-12-13 12:55:45,812 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([532] L146-->L149: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= (ite (not (and (or (= v_~n1~0_39 v_~n3~0_43) (< v_~n1~0_39 v_~n3~0_43)) (not (= v_~n1~0_39 0)))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|)) InVars {~n3~0=v_~n3~0_43, ~n1~0=v_~n1~0_39} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, ~n3~0=v_~n3~0_43, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, ~n1~0=v_~n1~0_39} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][105], [251#true, Black: 253#(= ~n3~0 0), Black: 255#(and (= ~n1~0 ~n3~0) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 257#(and (or (= ~n1~0 ~n3~0) (<= (+ ~n1~0 1) ~n3~0)) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 259#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n3~0 1))), 118#L149true, Black: 254#(and (<= ~n3~0 ~n1~0) (= ~n3~0 0)), 54#thread1EXITtrue, Black: 256#(and (or (and (= ~n2~0 ~n3~0) (<= (+ ~n1~0 1) ~n2~0)) (= ~n1~0 ~n3~0)) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 258#(and (<= (+ ~n1~0 1) ~n3~0) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 276#(= ~e2~0 1), 356#true, 6#L106true, Black: 289#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))), Black: 297#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n1~0 0)), Black: 291#(and (<= ~n2~0 0) (= ~n1~0 0)), Black: 283#(or (and (<= ~n2~0 0) (= ~n1~0 0)) (and (<= 1 ~n1~0) (<= ~n2~0 ~n1~0))), Black: 282#(or (and (<= ~n2~0 0) (= ~n1~0 0)) (and (= ~n2~0 ~n1~0) (<= 1 ~n2~0))), Black: 286#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n2~0 ~n3~0)), Black: 284#(or (and (<= 2 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)) (and (<= 1 ~n1~0) (<= ~n2~0 0))), Black: 285#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 293#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 287#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 158#(= ~i~0 0), Black: 315#(= ~e3~0 1), Black: 193#(and (<= (+ ~n2~0 1) ~n3~0) (<= 2 ~n2~0)), 42#L190-4true, Black: 190#(and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 192#(and (<= 2 ~n2~0) (= ~n2~0 ~n3~0)), Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 191#(and (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 329#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1)) (<= (+ ~n1~0 1) ~n3~0)), Black: 205#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n2~0 1))), Black: 326#(and (<= ~n1~0 ~n3~0) (or (= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0))), Black: 203#(and (<= 1 ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 322#(and (<= ~n1~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0) (<= ~n2~0 (+ ~n3~0 1))), Black: 202#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 183#true, Black: 319#(and (<= ~n1~0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 204#(and (<= 1 ~n1~0) (= ~n3~0 0) (< ~n1~0 (+ ~n2~0 1))), Black: 324#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), Black: 323#(and (<= ~n3~0 ~n2~0) (<= ~n2~0 ~n3~0) (<= (+ ~n1~0 1) ~n3~0)), 317#true, Black: 332#(and (<= ~n1~0 ~n3~0) (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), 156#true, Black: 320#(and (<= ~n1~0 ~n2~0) (or (= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0))), Black: 321#(and (<= ~n1~0 ~n3~0) (= ~n2~0 ~n3~0)), Black: 213#(and (= ~e1~0 1) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 350#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0) (< ~n3~0 (+ ~n2~0 1))), 281#(= ~n1~0 0), Black: 349#(and (<= 1 ~n2~0) (<= (+ ~n3~0 1) ~n2~0) (<= ~n2~0 (+ ~n3~0 1)) (= ~n1~0 0)), Black: 351#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), Black: 361#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 360#(and (<= 1 ~n2~0) (<= ~n2~0 1) (= ~n1~0 0) (= ~n3~0 1)), Black: 358#(and (= ~n2~0 ~n3~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 225#(and (or (= ~n3~0 0) (and (<= 2 ~n2~0) (<= ~n2~0 (+ ~n3~0 1)))) (or (and (<= 1 ~n2~0) (<= ~n2~0 1)) (not (= ~n3~0 0)))), Black: 220#(or (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)) (= ~n2~0 0)), Black: 236#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0)) (or (= ~n2~0 0) (= ~n2~0 ~n1~0))), Black: 224#(and (or (= ~n2~0 0) (not (= ~n3~0 0))) (or (and (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (= ~n3~0 0))), Black: 221#(or (= ~n2~0 0) (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0))), 200#true, Black: 234#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (= ~n2~0 0) (= ~n2~0 ~n1~0))), Black: 226#(or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (<= ~n2~0 ~n3~0)) (and (<= 2 ~n2~0) (<= ~n2~0 ~n3~0))), Black: 219#(and (or (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)) (= ~n2~0 0)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 223#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0))), Black: 222#(and (or (= ~n2~0 0) (<= ~n2~0 ~n3~0)) (or (= ~n2~0 0) (<= 1 ~n2~0))), Black: 232#(and (or (= ~n2~0 0) (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0))) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 216#true]) [2022-12-13 12:55:45,812 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2022-12-13 12:55:45,813 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-13 12:55:45,813 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-13 12:55:45,813 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-13 12:55:46,139 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L119-->thread2EXIT: Formula: (and (= v_~n2~0_178 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_178, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][516], [Black: 253#(= ~n3~0 0), Black: 255#(and (= ~n1~0 ~n3~0) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 257#(and (or (= ~n1~0 ~n3~0) (<= (+ ~n1~0 1) ~n3~0)) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 259#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n3~0 1))), Black: 254#(and (<= ~n3~0 ~n1~0) (= ~n3~0 0)), 54#thread1EXITtrue, Black: 256#(and (or (and (= ~n2~0 ~n3~0) (<= (+ ~n1~0 1) ~n2~0)) (= ~n1~0 ~n3~0)) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 276#(= ~e2~0 1), 356#true, Black: 281#(= ~n1~0 0), Black: 289#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))), Black: 297#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n1~0 0)), Black: 283#(or (and (<= ~n2~0 0) (= ~n1~0 0)) (and (<= 1 ~n1~0) (<= ~n2~0 ~n1~0))), Black: 282#(or (and (<= ~n2~0 0) (= ~n1~0 0)) (and (= ~n2~0 ~n1~0) (<= 1 ~n2~0))), Black: 286#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n2~0 ~n3~0)), Black: 284#(or (and (<= 2 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)) (and (<= 1 ~n1~0) (<= ~n2~0 0))), Black: 285#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 293#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 287#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 158#(= ~i~0 0), 291#(and (<= ~n2~0 0) (= ~n1~0 0)), 221#(or (= ~n2~0 0) (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0))), 11#thread2EXITtrue, Black: 315#(= ~e3~0 1), 42#L190-4true, Black: 193#(and (<= (+ ~n2~0 1) ~n3~0) (<= 2 ~n2~0)), Black: 190#(and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 192#(and (<= 2 ~n2~0) (= ~n2~0 ~n3~0)), Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 191#(and (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 205#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n2~0 1))), Black: 329#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1)) (<= (+ ~n1~0 1) ~n3~0)), Black: 203#(and (<= 1 ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 326#(and (<= ~n1~0 ~n3~0) (or (= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0))), Black: 322#(and (<= ~n1~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0) (<= ~n2~0 (+ ~n3~0 1))), Black: 202#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 204#(and (<= 1 ~n1~0) (= ~n3~0 0) (< ~n1~0 (+ ~n2~0 1))), Black: 319#(and (<= ~n1~0 ~n3~0) (<= ~n1~0 ~n2~0)), 183#true, Black: 324#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), Black: 323#(and (<= ~n3~0 ~n2~0) (<= ~n2~0 ~n3~0) (<= (+ ~n1~0 1) ~n3~0)), 317#true, Black: 332#(and (<= ~n1~0 ~n3~0) (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), 156#true, Black: 320#(and (<= ~n1~0 ~n2~0) (or (= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0))), Black: 321#(and (<= ~n1~0 ~n3~0) (= ~n2~0 ~n3~0)), Black: 213#(and (= ~e1~0 1) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 126#L155true, 258#(and (<= (+ ~n1~0 1) ~n3~0) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 350#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0) (< ~n3~0 (+ ~n2~0 1))), Black: 349#(and (<= 1 ~n2~0) (<= (+ ~n3~0 1) ~n2~0) (<= ~n2~0 (+ ~n3~0 1)) (= ~n1~0 0)), Black: 351#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), Black: 361#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 360#(and (<= 1 ~n2~0) (<= ~n2~0 1) (= ~n1~0 0) (= ~n3~0 1)), Black: 358#(and (= ~n2~0 ~n3~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 225#(and (or (= ~n3~0 0) (and (<= 2 ~n2~0) (<= ~n2~0 (+ ~n3~0 1)))) (or (and (<= 1 ~n2~0) (<= ~n2~0 1)) (not (= ~n3~0 0)))), Black: 220#(or (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)) (= ~n2~0 0)), Black: 236#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0)) (or (= ~n2~0 0) (= ~n2~0 ~n1~0))), Black: 224#(and (or (= ~n2~0 0) (not (= ~n3~0 0))) (or (and (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (= ~n3~0 0))), 200#true, Black: 234#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (= ~n2~0 0) (= ~n2~0 ~n1~0))), Black: 226#(or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (<= ~n2~0 ~n3~0)) (and (<= 2 ~n2~0) (<= ~n2~0 ~n3~0))), Black: 219#(and (or (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)) (= ~n2~0 0)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 223#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0))), Black: 222#(and (or (= ~n2~0 0) (<= ~n2~0 ~n3~0)) (or (= ~n2~0 0) (<= 1 ~n2~0))), Black: 232#(and (or (= ~n2~0 0) (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0))) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0))]) [2022-12-13 12:55:46,140 INFO L382 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-12-13 12:55:46,140 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 12:55:46,140 INFO L385 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 12:55:46,140 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 12:55:46,169 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([534] L152-->L155: Formula: (and (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= (ite (not (and (not (= v_~n2~0_35 0)) (or (< v_~n2~0_35 v_~n3~0_45) (= v_~n2~0_35 v_~n3~0_45)))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|)) InVars {~n2~0=v_~n2~0_35, ~n3~0=v_~n3~0_45} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_35, ~n3~0=v_~n3~0_45, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][519], [251#true, Black: 253#(= ~n3~0 0), Black: 255#(and (= ~n1~0 ~n3~0) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 257#(and (or (= ~n1~0 ~n3~0) (<= (+ ~n1~0 1) ~n3~0)) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 259#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n3~0 1))), Black: 254#(and (<= ~n3~0 ~n1~0) (= ~n3~0 0)), 54#thread1EXITtrue, Black: 256#(and (or (and (= ~n2~0 ~n3~0) (<= (+ ~n1~0 1) ~n2~0)) (= ~n1~0 ~n3~0)) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 258#(and (<= (+ ~n1~0 1) ~n3~0) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 276#(= ~e2~0 1), 356#true, Black: 289#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))), Black: 297#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n1~0 0)), Black: 291#(and (<= ~n2~0 0) (= ~n1~0 0)), Black: 283#(or (and (<= ~n2~0 0) (= ~n1~0 0)) (and (<= 1 ~n1~0) (<= ~n2~0 ~n1~0))), Black: 282#(or (and (<= ~n2~0 0) (= ~n1~0 0)) (and (= ~n2~0 ~n1~0) (<= 1 ~n2~0))), Black: 286#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n2~0 ~n3~0)), Black: 284#(or (and (<= 2 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)) (and (<= 1 ~n1~0) (<= ~n2~0 0))), Black: 285#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 293#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 287#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 158#(= ~i~0 0), 221#(or (= ~n2~0 0) (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0))), 11#thread2EXITtrue, Black: 315#(= ~e3~0 1), 42#L190-4true, Black: 193#(and (<= (+ ~n2~0 1) ~n3~0) (<= 2 ~n2~0)), Black: 190#(and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 192#(and (<= 2 ~n2~0) (= ~n2~0 ~n3~0)), Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 191#(and (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 205#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n2~0 1))), Black: 329#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1)) (<= (+ ~n1~0 1) ~n3~0)), Black: 326#(and (<= ~n1~0 ~n3~0) (or (= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0))), Black: 203#(and (<= 1 ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 322#(and (<= ~n1~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0) (<= ~n2~0 (+ ~n3~0 1))), Black: 202#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 204#(and (<= 1 ~n1~0) (= ~n3~0 0) (< ~n1~0 (+ ~n2~0 1))), 183#true, Black: 319#(and (<= ~n1~0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 324#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), 317#true, Black: 323#(and (<= ~n3~0 ~n2~0) (<= ~n2~0 ~n3~0) (<= (+ ~n1~0 1) ~n3~0)), Black: 332#(and (<= ~n1~0 ~n3~0) (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), 156#true, Black: 320#(and (<= ~n1~0 ~n2~0) (or (= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0))), Black: 321#(and (<= ~n1~0 ~n3~0) (= ~n2~0 ~n3~0)), Black: 213#(and (= ~e1~0 1) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 126#L155true, Black: 350#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0) (< ~n3~0 (+ ~n2~0 1))), 281#(= ~n1~0 0), Black: 349#(and (<= 1 ~n2~0) (<= (+ ~n3~0 1) ~n2~0) (<= ~n2~0 (+ ~n3~0 1)) (= ~n1~0 0)), Black: 351#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), Black: 361#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 360#(and (<= 1 ~n2~0) (<= ~n2~0 1) (= ~n1~0 0) (= ~n3~0 1)), Black: 358#(and (= ~n2~0 ~n3~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 225#(and (or (= ~n3~0 0) (and (<= 2 ~n2~0) (<= ~n2~0 (+ ~n3~0 1)))) (or (and (<= 1 ~n2~0) (<= ~n2~0 1)) (not (= ~n3~0 0)))), Black: 220#(or (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)) (= ~n2~0 0)), Black: 236#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0)) (or (= ~n2~0 0) (= ~n2~0 ~n1~0))), Black: 224#(and (or (= ~n2~0 0) (not (= ~n3~0 0))) (or (and (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (= ~n3~0 0))), 200#true, Black: 234#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (= ~n2~0 0) (= ~n2~0 ~n1~0))), Black: 226#(or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (<= ~n2~0 ~n3~0)) (and (<= 2 ~n2~0) (<= ~n2~0 ~n3~0))), Black: 219#(and (or (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)) (= ~n2~0 0)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 223#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0))), Black: 222#(and (or (= ~n2~0 0) (<= ~n2~0 ~n3~0)) (or (= ~n2~0 0) (<= 1 ~n2~0))), Black: 232#(and (or (= ~n2~0 0) (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0))) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0))]) [2022-12-13 12:55:46,169 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is not cut-off event [2022-12-13 12:55:46,169 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2022-12-13 12:55:46,169 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2022-12-13 12:55:46,169 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2022-12-13 12:55:46,223 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([599] L76-->thread1EXIT: Formula: (and (= v_~n1~0_165 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_7| 0)) InVars {} OutVars{~n1~0=v_~n1~0_165, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_7|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][567], [251#true, Black: 253#(= ~n3~0 0), Black: 255#(and (= ~n1~0 ~n3~0) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 257#(and (or (= ~n1~0 ~n3~0) (<= (+ ~n1~0 1) ~n3~0)) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 259#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n3~0 1))), Black: 254#(and (<= ~n3~0 ~n1~0) (= ~n3~0 0)), 54#thread1EXITtrue, Black: 256#(and (or (and (= ~n2~0 ~n3~0) (<= (+ ~n1~0 1) ~n2~0)) (= ~n1~0 ~n3~0)) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 258#(and (<= (+ ~n1~0 1) ~n3~0) (or (<= 1 ~n1~0) (= ~n1~0 0))), Black: 276#(= ~e2~0 1), 356#true, Black: 289#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1))), Black: 297#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (< ~n2~0 (+ ~n3~0 1)) (= ~n1~0 0)), Black: 291#(and (<= ~n2~0 0) (= ~n1~0 0)), Black: 283#(or (and (<= ~n2~0 0) (= ~n1~0 0)) (and (<= 1 ~n1~0) (<= ~n2~0 ~n1~0))), Black: 282#(or (and (<= ~n2~0 0) (= ~n1~0 0)) (and (= ~n2~0 ~n1~0) (<= 1 ~n2~0))), Black: 286#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n2~0 ~n3~0)), Black: 284#(or (and (<= 2 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)) (and (<= 1 ~n1~0) (<= ~n2~0 0))), Black: 285#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 293#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 172#(and (<= ~i~0 2) (= ~i3~0 0) (<= ~i1~0 1) (<= 1 ~i1~0) (<= 2 ~i~0)), Black: 287#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 168#(and (<= 1 ~i~0) (= ~i3~0 0) (<= ~i~0 1)), Black: 158#(= ~i~0 0), 11#thread2EXITtrue, Black: 315#(= ~e3~0 1), 42#L190-4true, Black: 193#(and (<= (+ ~n2~0 1) ~n3~0) (<= 2 ~n2~0)), Black: 190#(and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 192#(and (<= 2 ~n2~0) (= ~n2~0 ~n3~0)), Black: 186#(and (= ~n2~0 0) (<= ~n3~0 ~n1~0) (= ~n3~0 0)), Black: 191#(and (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0)), Black: 188#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (= ~n3~0 0)), Black: 329#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1)) (<= (+ ~n1~0 1) ~n3~0)), Black: 205#(and (<= 1 ~n1~0) (< ~n1~0 (+ ~n2~0 1))), Black: 326#(and (<= ~n1~0 ~n3~0) (or (= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0))), Black: 203#(and (<= 1 ~n2~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 202#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 322#(and (<= ~n1~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0) (<= ~n2~0 (+ ~n3~0 1))), Black: 319#(and (<= ~n1~0 ~n3~0) (<= ~n1~0 ~n2~0)), 183#true, Black: 204#(and (<= 1 ~n1~0) (= ~n3~0 0) (< ~n1~0 (+ ~n2~0 1))), Black: 324#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), 317#true, Black: 323#(and (<= ~n3~0 ~n2~0) (<= ~n2~0 ~n3~0) (<= (+ ~n1~0 1) ~n3~0)), 156#true, Black: 332#(and (<= ~n1~0 ~n3~0) (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), Black: 320#(and (<= ~n1~0 ~n2~0) (or (= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n2~0))), Black: 321#(and (<= ~n1~0 ~n3~0) (= ~n2~0 ~n3~0)), Black: 213#(and (= ~e1~0 1) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 223#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0))), 126#L155true, 281#(= ~n1~0 0), Black: 350#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0) (< ~n3~0 (+ ~n2~0 1))), Black: 349#(and (<= 1 ~n2~0) (<= (+ ~n3~0 1) ~n2~0) (<= ~n2~0 (+ ~n3~0 1)) (= ~n1~0 0)), Black: 351#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (< ~n3~0 (+ ~n2~0 1))), Black: 361#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 360#(and (<= 1 ~n2~0) (<= ~n2~0 1) (= ~n1~0 0) (= ~n3~0 1)), Black: 358#(and (= ~n2~0 ~n3~0) (= ~n3~0 0) (= ~n1~0 0)), Black: 225#(and (or (= ~n3~0 0) (and (<= 2 ~n2~0) (<= ~n2~0 (+ ~n3~0 1)))) (or (and (<= 1 ~n2~0) (<= ~n2~0 1)) (not (= ~n3~0 0)))), Black: 220#(or (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)) (= ~n2~0 0)), Black: 236#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0)) (or (= ~n2~0 0) (= ~n2~0 ~n1~0))), Black: 224#(and (or (= ~n2~0 0) (not (= ~n3~0 0))) (or (and (<= 1 ~n2~0) (< ~n2~0 (+ ~n3~0 1))) (= ~n3~0 0))), Black: 221#(or (= ~n2~0 0) (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0))), 200#true, Black: 234#(and (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (<= 1 ~n2~0)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (= ~n2~0 0) (= ~n2~0 ~n1~0))), Black: 226#(or (and (<= ~n3~0 ~n2~0) (<= 1 ~n2~0) (<= ~n2~0 ~n3~0)) (and (<= 2 ~n2~0) (<= ~n2~0 ~n3~0))), Black: 219#(and (or (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)) (= ~n2~0 0)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 222#(and (or (= ~n2~0 0) (<= ~n2~0 ~n3~0)) (or (= ~n2~0 0) (<= 1 ~n2~0))), Black: 232#(and (or (= ~n2~0 0) (and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0))) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0))]) [2022-12-13 12:55:46,223 INFO L382 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 12:55:46,223 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 12:55:46,223 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 12:55:46,223 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 12:55:46,281 INFO L130 PetriNetUnfolder]: 3310/10369 cut-off events. [2022-12-13 12:55:46,281 INFO L131 PetriNetUnfolder]: For 121604/123939 co-relation queries the response was YES. [2022-12-13 12:55:46,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53723 conditions, 10369 events. 3310/10369 cut-off events. For 121604/123939 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 120326 event pairs, 793 based on Foata normal form. 251/9962 useless extension candidates. Maximal degree in co-relation 52803. Up to 2138 conditions per place. [2022-12-13 12:55:46,461 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 181 places, 594 transitions, 8760 flow [2022-12-13 12:55:46,461 INFO L226 LiptonReduction]: Number of co-enabled transitions 5840 [2022-12-13 12:55:46,689 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:55:46,690 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1580 [2022-12-13 12:55:46,690 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 594 transitions, 8764 flow [2022-12-13 12:55:46,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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 12:55:46,690 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:55:46,690 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:55:46,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 12:55:46,690 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:55:46,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:55:46,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1540794122, now seen corresponding path program 1 times [2022-12-13 12:55:46,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:55:46,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383412134] [2022-12-13 12:55:46,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:55:46,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:55:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:55:47,089 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 12:55:47,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:55:47,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383412134] [2022-12-13 12:55:47,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383412134] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:55:47,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:55:47,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 12:55:47,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031275125] [2022-12-13 12:55:47,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:55:47,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 12:55:47,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:55:47,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 12:55:47,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:55:47,091 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 94 [2022-12-13 12:55:47,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 594 transitions, 8764 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:55:47,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:55:47,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 94 [2022-12-13 12:55:47,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand