/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:07:00,872 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:07:00,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:07:00,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:07:00,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:07:00,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:07:00,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:07:00,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:07:00,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:07:00,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:07:00,925 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:07:00,926 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:07:00,926 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:07:00,928 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:07:00,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:07:00,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:07:00,934 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:07:00,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:07:00,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:07:00,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:07:00,941 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:07:00,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:07:00,943 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:07:00,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:07:00,946 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:07:00,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:07:00,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:07:00,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:07:00,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:07:00,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:07:00,949 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:07:00,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:07:00,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:07:00,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:07:00,953 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:07:00,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:07:00,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:07:00,953 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:07:00,953 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:07:00,954 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:07:00,954 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:07:00,955 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-RepeatedSemanticLbe.epf [2022-12-06 00:07:00,982 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:07:00,982 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:07:00,984 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:07:00,984 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:07:00,984 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:07:00,984 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:07:00,985 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:07:00,985 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:07:00,985 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:07:00,985 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:07:00,985 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:07:00,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:07:00,986 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:07:00,986 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:07:00,986 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:07:00,986 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:07:00,986 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:07:00,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:07:00,986 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:07:00,986 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:07:00,986 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:07:00,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:07:00,987 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:07:00,987 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:07:00,987 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:07:00,987 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:07:00,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:07:00,987 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:07:00,987 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 00:07:01,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:07:01,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:07:01,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:07:01,237 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:07:01,237 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:07:01,238 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c [2022-12-06 00:07:02,104 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:07:02,278 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:07:02,279 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c [2022-12-06 00:07:02,284 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e79006139/1c777f9b791e4a2e981f87044ba661c6/FLAGd74500eb1 [2022-12-06 00:07:02,293 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e79006139/1c777f9b791e4a2e981f87044ba661c6 [2022-12-06 00:07:02,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:07:02,295 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:07:02,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:07:02,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:07:02,298 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:07:02,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:07:02" (1/1) ... [2022-12-06 00:07:02,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c0bc672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:02, skipping insertion in model container [2022-12-06 00:07:02,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:07:02" (1/1) ... [2022-12-06 00:07:02,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:07:02,327 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:07:02,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,488 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-ticket-6.wvr.c[4400,4413] [2022-12-06 00:07:02,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:07:02,503 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:07:02,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:07:02,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:07:02,549 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-ticket-6.wvr.c[4400,4413] [2022-12-06 00:07:02,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:07:02,562 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:07:02,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:02 WrapperNode [2022-12-06 00:07:02,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:07:02,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:07:02,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:07:02,563 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:07:02,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:02" (1/1) ... [2022-12-06 00:07:02,588 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:02" (1/1) ... [2022-12-06 00:07:02,618 INFO L138 Inliner]: procedures = 25, calls = 100, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 278 [2022-12-06 00:07:02,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:07:02,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:07:02,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:07:02,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:07:02,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:02" (1/1) ... [2022-12-06 00:07:02,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:02" (1/1) ... [2022-12-06 00:07:02,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:02" (1/1) ... [2022-12-06 00:07:02,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:02" (1/1) ... [2022-12-06 00:07:02,644 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:02" (1/1) ... [2022-12-06 00:07:02,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:02" (1/1) ... [2022-12-06 00:07:02,647 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:02" (1/1) ... [2022-12-06 00:07:02,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:02" (1/1) ... [2022-12-06 00:07:02,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:07:02,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:07:02,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:07:02,650 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:07:02,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:02" (1/1) ... [2022-12-06 00:07:02,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:07:02,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:07:02,682 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 00:07:02,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 00:07:02,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:07:02,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:07:02,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:07:02,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:07:02,712 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:07:02,712 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:07:02,712 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:07:02,712 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:07:02,712 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 00:07:02,712 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 00:07:02,712 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 00:07:02,713 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 00:07:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:07:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-12-06 00:07:02,713 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-12-06 00:07:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-12-06 00:07:02,713 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-12-06 00:07:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 00:07:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 00:07:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:07:02,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:07:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:07:02,715 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 00:07:02,852 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:07:02,853 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:07:03,127 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:07:03,285 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:07:03,285 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 00:07:03,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:07:03 BoogieIcfgContainer [2022-12-06 00:07:03,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:07:03,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:07:03,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:07:03,292 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:07:03,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:07:02" (1/3) ... [2022-12-06 00:07:03,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b51828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:07:03, skipping insertion in model container [2022-12-06 00:07:03,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:07:02" (2/3) ... [2022-12-06 00:07:03,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b51828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:07:03, skipping insertion in model container [2022-12-06 00:07:03,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:07:03" (3/3) ... [2022-12-06 00:07:03,294 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-6.wvr.c [2022-12-06 00:07:03,308 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:07:03,308 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:07:03,308 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:07:03,397 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2022-12-06 00:07:03,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 181 transitions, 410 flow [2022-12-06 00:07:03,523 INFO L130 PetriNetUnfolder]: 2/175 cut-off events. [2022-12-06 00:07:03,523 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 00:07:03,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 175 events. 2/175 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 78 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2022-12-06 00:07:03,527 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 181 transitions, 410 flow [2022-12-06 00:07:03,533 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 159 transitions, 354 flow [2022-12-06 00:07:03,534 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:03,556 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 159 transitions, 354 flow [2022-12-06 00:07:03,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 159 transitions, 354 flow [2022-12-06 00:07:03,599 INFO L130 PetriNetUnfolder]: 2/159 cut-off events. [2022-12-06 00:07:03,600 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 00:07:03,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 159 events. 2/159 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2022-12-06 00:07:03,604 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 159 transitions, 354 flow [2022-12-06 00:07:03,604 INFO L188 LiptonReduction]: Number of co-enabled transitions 3042 [2022-12-06 00:07:10,814 INFO L203 LiptonReduction]: Total number of compositions: 121 [2022-12-06 00:07:10,824 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:07:10,828 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;@3ea38e9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:07:10,828 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 00:07:10,833 INFO L130 PetriNetUnfolder]: 0/37 cut-off events. [2022-12-06 00:07:10,834 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 00:07:10,834 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:10,834 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:10,835 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 4 more)] === [2022-12-06 00:07:10,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:10,838 INFO L85 PathProgramCache]: Analyzing trace with hash -152965531, now seen corresponding path program 1 times [2022-12-06 00:07:10,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:10,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421951644] [2022-12-06 00:07:10,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:10,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:12,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:07:12,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:12,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421951644] [2022-12-06 00:07:12,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421951644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:12,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:12,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:12,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317016051] [2022-12-06 00:07:12,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:12,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:07:12,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:12,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:07:12,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:07:12,080 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 00:07:12,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 38 transitions, 112 flow. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:12,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:12,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 00:07:12,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:13,792 INFO L130 PetriNetUnfolder]: 17545/23053 cut-off events. [2022-12-06 00:07:13,792 INFO L131 PetriNetUnfolder]: For 1989/1989 co-relation queries the response was YES. [2022-12-06 00:07:13,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48140 conditions, 23053 events. 17545/23053 cut-off events. For 1989/1989 co-relation queries the response was YES. Maximal size of possible extension queue 654. Compared 109005 event pairs, 4719 based on Foata normal form. 1/23054 useless extension candidates. Maximal degree in co-relation 37576. Up to 10440 conditions per place. [2022-12-06 00:07:13,893 INFO L137 encePairwiseOnDemand]: 29/38 looper letters, 86 selfloop transitions, 13 changer transitions 12/111 dead transitions. [2022-12-06 00:07:13,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 111 transitions, 537 flow [2022-12-06 00:07:13,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:13,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:13,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-12-06 00:07:13,910 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5894736842105263 [2022-12-06 00:07:13,911 INFO L175 Difference]: Start difference. First operand has 57 places, 38 transitions, 112 flow. Second operand 5 states and 112 transitions. [2022-12-06 00:07:13,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 111 transitions, 537 flow [2022-12-06 00:07:13,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 111 transitions, 475 flow, removed 0 selfloop flow, removed 12 redundant places. [2022-12-06 00:07:13,968 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 179 flow [2022-12-06 00:07:13,969 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2022-12-06 00:07:13,972 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, -5 predicate places. [2022-12-06 00:07:13,973 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:13,973 INFO L89 Accepts]: Start accepts. Operand has 52 places, 49 transitions, 179 flow [2022-12-06 00:07:13,978 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:13,978 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:13,979 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 49 transitions, 179 flow [2022-12-06 00:07:13,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 49 transitions, 179 flow [2022-12-06 00:07:14,014 INFO L130 PetriNetUnfolder]: 253/440 cut-off events. [2022-12-06 00:07:14,014 INFO L131 PetriNetUnfolder]: For 98/307 co-relation queries the response was YES. [2022-12-06 00:07:14,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1179 conditions, 440 events. 253/440 cut-off events. For 98/307 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 1895 event pairs, 152 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 1111. Up to 343 conditions per place. [2022-12-06 00:07:14,020 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 49 transitions, 179 flow [2022-12-06 00:07:14,021 INFO L188 LiptonReduction]: Number of co-enabled transitions 600 [2022-12-06 00:07:14,084 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [675] L86-->thread3EXIT: Formula: (and (= (+ v_~s~0_637 1) v_~s~0_636) (= v_~b~0_239 (ite (= (ite (or (not (= (mod v_~b~0_240 256) 0)) (= v_~x~0_163 1)) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork5_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_39| |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_39|) (not (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_39| 0)) (= |v_thread3Thread1of1ForFork5_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_39| (ite (<= v_~m3~0_65 v_~s~0_637) 1 0))) InVars {~m3~0=v_~m3~0_65, ~b~0=v_~b~0_240, ~x~0=v_~x~0_163, ~s~0=v_~s~0_637} OutVars{~m3~0=v_~m3~0_65, thread3Thread1of1ForFork5_#res#1.base=|v_thread3Thread1of1ForFork5_#res#1.base_7|, ~b~0=v_~b~0_239, thread3Thread1of1ForFork5_#res#1.offset=|v_thread3Thread1of1ForFork5_#res#1.offset_7|, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_39|, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_39|, thread3Thread1of1ForFork5_#t~post6#1=|v_thread3Thread1of1ForFork5_#t~post6#1_59|, ~x~0=v_~x~0_163, ~s~0=v_~s~0_636} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_#res#1.base, ~b~0, thread3Thread1of1ForFork5_#res#1.offset, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork5_#t~post6#1, ~s~0] [2022-12-06 00:07:14,152 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [658] L143-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (= (ite (<= v_~m6~0_49 v_~s~0_537) 1 0) |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (not (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| 0)) (= |v_thread6Thread1of1ForFork0_#res#1.offset_41| 0) (= (+ v_~s~0_537 1) v_~s~0_536) (= |v_thread6Thread1of1ForFork0_#res#1.base_41| 0) (= v_~b~0_165 (ite (= (ite (or (not (= (mod v_~b~0_166 256) 0)) (= v_~x~0_121 1)) 1 0) 0) 0 1))) InVars {~b~0=v_~b~0_166, ~m6~0=v_~m6~0_49, ~x~0=v_~x~0_121, ~s~0=v_~s~0_537} OutVars{thread6Thread1of1ForFork0_#res#1.base=|v_thread6Thread1of1ForFork0_#res#1.base_41|, ~b~0=v_~b~0_165, ~m6~0=v_~m6~0_49, thread6Thread1of1ForFork0_#t~post12#1=|v_thread6Thread1of1ForFork0_#t~post12#1_45|, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29|, thread6Thread1of1ForFork0_#res#1.offset=|v_thread6Thread1of1ForFork0_#res#1.offset_41|, ~x~0=v_~x~0_121, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|, ~s~0=v_~s~0_536} AuxVars[] AssignedVars[thread6Thread1of1ForFork0_#res#1.base, ~b~0, thread6Thread1of1ForFork0_#t~post12#1, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork0_#res#1.offset, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-06 00:07:14,216 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [691] L105-->thread4EXIT: Formula: (and (= v_~b~0_281 (ite (= (ite (or (not (= (mod v_~b~0_282 256) 0)) (= v_~x~0_191 1)) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| 0)) (= (+ v_~s~0_685 1) v_~s~0_684) (= |v_thread4Thread1of1ForFork2_#res#1.base_25| 0) (= |v_thread4Thread1of1ForFork2_#res#1.offset_25| 0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m4~0_71 v_~s~0_685) 1 0))) InVars {~b~0=v_~b~0_282, ~m4~0=v_~m4~0_71, ~x~0=v_~x~0_191, ~s~0=v_~s~0_685} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_25|, ~b~0=v_~b~0_281, ~m4~0=v_~m4~0_71, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_55|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, ~x~0=v_~x~0_191, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_25|, ~s~0=v_~s~0_684} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, ~b~0, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#res#1.offset, ~s~0] [2022-12-06 00:07:14,283 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-06 00:07:14,347 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [661] L124-->thread5EXIT: Formula: (and (= |v_thread5Thread1of1ForFork4_#res#1.offset_29| 0) (not (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| 0)) (= v_~b~0_189 (ite (= (ite (or (= v_~x~0_136 1) (not (= (mod v_~b~0_190 256) 0))) 1 0) 0) 0 1)) (= |v_thread5Thread1of1ForFork4_#res#1.base_29| 0) (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (ite (<= v_~m5~0_59 v_~s~0_585) 1 0) |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (+ v_~s~0_585 1) v_~s~0_584)) InVars {~b~0=v_~b~0_190, ~m5~0=v_~m5~0_59, ~x~0=v_~x~0_136, ~s~0=v_~s~0_585} OutVars{thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|, thread5Thread1of1ForFork4_#res#1.offset=|v_thread5Thread1of1ForFork4_#res#1.offset_29|, ~b~0=v_~b~0_189, ~m5~0=v_~m5~0_59, thread5Thread1of1ForFork4_#res#1.base=|v_thread5Thread1of1ForFork4_#res#1.base_29|, thread5Thread1of1ForFork4_#t~post10#1=|v_thread5Thread1of1ForFork4_#t~post10#1_39|, ~x~0=v_~x~0_136, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31|, ~s~0=v_~s~0_584} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork4_#res#1.offset, ~b~0, thread5Thread1of1ForFork4_#res#1.base, thread5Thread1of1ForFork4_#t~post10#1, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:14,416 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [699] L45-->thread3EXIT: Formula: (let ((.cse0 (= v_~x~0_226 1))) (and (= |v_thread3Thread1of1ForFork5_#res#1.base_15| 0) (= |v_thread3Thread1of1ForFork5_#res#1.offset_15| 0) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_47| |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_47|) .cse0 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33| (ite (<= v_~m1~0_99 v_~s~0_747) 1 0)) (not (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_47| 0)) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_47| (ite (<= v_~m3~0_95 v_~s~0_747) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_33|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_33| 0)) (= (+ v_~s~0_747 1) v_~s~0_746) (= (ite (= (ite (or .cse0 (not (= (mod v_~b~0_342 256) 0))) 1 0) 0) 0 1) v_~b~0_341))) InVars {~m3~0=v_~m3~0_95, ~b~0=v_~b~0_342, ~m1~0=v_~m1~0_99, ~s~0=v_~s~0_747} OutVars{~m3~0=v_~m3~0_95, thread3Thread1of1ForFork5_#res#1.base=|v_thread3Thread1of1ForFork5_#res#1.base_15|, ~b~0=v_~b~0_341, thread3Thread1of1ForFork5_#res#1.offset=|v_thread3Thread1of1ForFork5_#res#1.offset_15|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33|, ~m1~0=v_~m1~0_99, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_47|, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_47|, thread3Thread1of1ForFork5_#t~post6#1=|v_thread3Thread1of1ForFork5_#t~post6#1_67|, ~x~0=v_~x~0_226, ~s~0=v_~s~0_746, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_33|} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_#res#1.base, ~b~0, thread3Thread1of1ForFork5_#res#1.offset, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork5_#t~post6#1, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [586] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_29| 0) (= v_~x~0_14 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_29| 0) (= (+ v_~s~0_179 1) v_~s~0_178)) InVars {~s~0=v_~s~0_179} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_31|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_29|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_29|, ~x~0=v_~x~0_14, ~s~0=v_~s~0_178} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0] [2022-12-06 00:07:14,497 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [700] L45-->thread6EXIT: Formula: (let ((.cse0 (= v_~x~0_228 1))) (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|) (= (ite (<= v_~m6~0_91 v_~s~0_751) 1 0) |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| 0)) (= (+ v_~s~0_751 1) v_~s~0_750) .cse0 (= |v_thread6Thread1of1ForFork0_#res#1.base_53| 0) (= |v_thread6Thread1of1ForFork0_#res#1.offset_53| 0) (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_41| |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35| (ite (<= v_~m1~0_101 v_~s~0_751) 1 0)) (not (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_41| 0)) (= v_~b~0_345 (ite (= (ite (or .cse0 (not (= (mod v_~b~0_346 256) 0))) 1 0) 0) 0 1)))) InVars {~b~0=v_~b~0_346, ~m6~0=v_~m6~0_91, ~m1~0=v_~m1~0_101, ~s~0=v_~s~0_751} OutVars{thread6Thread1of1ForFork0_#res#1.base=|v_thread6Thread1of1ForFork0_#res#1.base_53|, ~b~0=v_~b~0_345, ~m6~0=v_~m6~0_91, thread6Thread1of1ForFork0_#t~post12#1=|v_thread6Thread1of1ForFork0_#t~post12#1_57|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_41|, ~m1~0=v_~m1~0_101, thread6Thread1of1ForFork0_#res#1.offset=|v_thread6Thread1of1ForFork0_#res#1.offset_53|, ~x~0=v_~x~0_228, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|, ~s~0=v_~s~0_750, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|} AuxVars[] AssignedVars[thread6Thread1of1ForFork0_#res#1.base, ~b~0, thread6Thread1of1ForFork0_#t~post12#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork0_#res#1.offset, ~x~0, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [586] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_29| 0) (= v_~x~0_14 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_29| 0) (= (+ v_~s~0_179 1) v_~s~0_178)) InVars {~s~0=v_~s~0_179} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_31|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_29|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_29|, ~x~0=v_~x~0_14, ~s~0=v_~s~0_178} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0] [2022-12-06 00:07:14,575 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [701] L45-->thread4EXIT: Formula: (let ((.cse0 (= v_~x~0_230 1))) (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_45| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_45|) (= |v_thread4Thread1of1ForFork2_#res#1.offset_29| 0) (= (+ v_~s~0_755 1) v_~s~0_754) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_37| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_37|) (= (ite (<= v_~m1~0_103 v_~s~0_755) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_37|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_37| 0)) (= |v_thread4Thread1of1ForFork2_#res#1.base_29| 0) (= (ite (<= v_~m4~0_91 v_~s~0_755) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_45| 0)) (= (ite (= (ite (or (not (= (mod v_~b~0_350 256) 0)) .cse0) 1 0) 0) 0 1) v_~b~0_349) .cse0)) InVars {~b~0=v_~b~0_350, ~m4~0=v_~m4~0_91, ~m1~0=v_~m1~0_103, ~s~0=v_~s~0_755} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_45|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_29|, ~b~0=v_~b~0_349, ~m4~0=v_~m4~0_91, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_37|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_59|, ~m1~0=v_~m1~0_103, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_45|, ~x~0=v_~x~0_230, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_29|, ~s~0=v_~s~0_754, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_37|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~x~0, thread4Thread1of1ForFork2_#res#1.offset, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [586] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_29| 0) (= v_~x~0_14 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_29| 0) (= (+ v_~s~0_179 1) v_~s~0_178)) InVars {~s~0=v_~s~0_179} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_31|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_29|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_29|, ~x~0=v_~x~0_14, ~s~0=v_~s~0_178} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0] [2022-12-06 00:07:14,699 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L45-->thread2EXIT: Formula: (let ((.cse0 (= v_~x~0_232 1))) (and (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_49|) (= (ite (<= v_~m1~0_105 v_~s~0_759) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|) .cse0 (= (+ v_~s~0_759 1) v_~s~0_758) (= |v_thread2Thread1of1ForFork3_#res#1.offset_63| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_39|) (= |v_thread2Thread1of1ForFork3_#res#1.base_63| 0) (= (ite (<= v_~m2~0_103 v_~s~0_759) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_49|) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_49| 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_39| 0)) (= v_~b~0_353 (ite (= (ite (or (not (= 0 (mod v_~b~0_354 256))) .cse0) 1 0) 0) 0 1)))) InVars {~b~0=v_~b~0_354, ~m2~0=v_~m2~0_103, ~m1~0=v_~m1~0_105, ~s~0=v_~s~0_759} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_75|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_49|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_63|, ~b~0=v_~b~0_353, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|, ~m2~0=v_~m2~0_103, ~m1~0=v_~m1~0_105, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_63|, ~x~0=v_~x~0_232, ~s~0=v_~s~0_758, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_39|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [586] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_29| 0) (= v_~x~0_14 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_29| 0) (= (+ v_~s~0_179 1) v_~s~0_178)) InVars {~s~0=v_~s~0_179} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_31|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_29|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_29|, ~x~0=v_~x~0_14, ~s~0=v_~s~0_178} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0] [2022-12-06 00:07:14,798 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [703] L45-->thread5EXIT: Formula: (let ((.cse0 (= v_~x~0_234 1))) (and (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m5~0_99 v_~s~0_763) 1 0)) .cse0 (= |v_thread5Thread1of1ForFork4_#res#1.base_39| 0) (not (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| 0)) (= (ite (= (ite (or (not (= (mod v_~b~0_358 256) 0)) .cse0) 1 0) 0) 0 1) v_~b~0_357) (= |v_thread5Thread1of1ForFork4_#res#1.offset_39| 0) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| 0)) (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|) (= (+ v_~s~0_763 1) v_~s~0_762) (= (ite (<= v_~m1~0_107 v_~s~0_763) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|))) InVars {~b~0=v_~b~0_358, ~m5~0=v_~m5~0_99, ~m1~0=v_~m1~0_107, ~s~0=v_~s~0_763} OutVars{thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|, thread5Thread1of1ForFork4_#res#1.offset=|v_thread5Thread1of1ForFork4_#res#1.offset_39|, ~b~0=v_~b~0_357, ~m5~0=v_~m5~0_99, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|, ~m1~0=v_~m1~0_107, thread5Thread1of1ForFork4_#res#1.base=|v_thread5Thread1of1ForFork4_#res#1.base_39|, thread5Thread1of1ForFork4_#t~post10#1=|v_thread5Thread1of1ForFork4_#t~post10#1_49|, ~x~0=v_~x~0_234, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|, ~s~0=v_~s~0_762, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork4_#res#1.offset, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork4_#res#1.base, thread5Thread1of1ForFork4_#t~post10#1, ~x~0, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [586] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_29| 0) (= v_~x~0_14 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_29| 0) (= (+ v_~s~0_179 1) v_~s~0_178)) InVars {~s~0=v_~s~0_179} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_31|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_29|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_29|, ~x~0=v_~x~0_14, ~s~0=v_~s~0_178} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0] [2022-12-06 00:07:14,888 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:07:14,889 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 916 [2022-12-06 00:07:14,889 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 193 flow [2022-12-06 00:07:14,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:14,890 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:14,890 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:14,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:07:14,890 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 4 more)] === [2022-12-06 00:07:14,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:14,890 INFO L85 PathProgramCache]: Analyzing trace with hash 294621299, now seen corresponding path program 2 times [2022-12-06 00:07:14,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:14,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871671676] [2022-12-06 00:07:14,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:14,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:15,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:07:15,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:15,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871671676] [2022-12-06 00:07:15,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871671676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:15,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:15,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:15,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401771720] [2022-12-06 00:07:15,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:15,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:15,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:15,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:15,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:15,473 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 00:07:15,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 193 flow. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:15,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:15,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 00:07:15,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:16,783 INFO L130 PetriNetUnfolder]: 15716/20622 cut-off events. [2022-12-06 00:07:16,784 INFO L131 PetriNetUnfolder]: For 11142/11142 co-relation queries the response was YES. [2022-12-06 00:07:16,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60631 conditions, 20622 events. 15716/20622 cut-off events. For 11142/11142 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 96077 event pairs, 2093 based on Foata normal form. 1/20623 useless extension candidates. Maximal degree in co-relation 33501. Up to 10256 conditions per place. [2022-12-06 00:07:16,869 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 86 selfloop transitions, 17 changer transitions 19/122 dead transitions. [2022-12-06 00:07:16,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 122 transitions, 667 flow [2022-12-06 00:07:16,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:16,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:16,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2022-12-06 00:07:16,871 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5488372093023256 [2022-12-06 00:07:16,871 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 193 flow. Second operand 5 states and 118 transitions. [2022-12-06 00:07:16,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 122 transitions, 667 flow [2022-12-06 00:07:16,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 122 transitions, 648 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 00:07:16,882 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 285 flow [2022-12-06 00:07:16,882 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2022-12-06 00:07:16,882 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2022-12-06 00:07:16,883 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:16,883 INFO L89 Accepts]: Start accepts. Operand has 56 places, 53 transitions, 285 flow [2022-12-06 00:07:16,884 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:16,884 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:16,884 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 53 transitions, 285 flow [2022-12-06 00:07:16,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 53 transitions, 285 flow [2022-12-06 00:07:16,932 INFO L130 PetriNetUnfolder]: 248/421 cut-off events. [2022-12-06 00:07:16,932 INFO L131 PetriNetUnfolder]: For 949/1659 co-relation queries the response was YES. [2022-12-06 00:07:16,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1742 conditions, 421 events. 248/421 cut-off events. For 949/1659 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 1700 event pairs, 69 based on Foata normal form. 1/380 useless extension candidates. Maximal degree in co-relation 1653. Up to 337 conditions per place. [2022-12-06 00:07:16,937 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 53 transitions, 285 flow [2022-12-06 00:07:16,937 INFO L188 LiptonReduction]: Number of co-enabled transitions 654 [2022-12-06 00:07:16,984 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [661] L124-->thread5EXIT: Formula: (and (= |v_thread5Thread1of1ForFork4_#res#1.offset_29| 0) (not (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| 0)) (= v_~b~0_189 (ite (= (ite (or (= v_~x~0_136 1) (not (= (mod v_~b~0_190 256) 0))) 1 0) 0) 0 1)) (= |v_thread5Thread1of1ForFork4_#res#1.base_29| 0) (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (ite (<= v_~m5~0_59 v_~s~0_585) 1 0) |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (+ v_~s~0_585 1) v_~s~0_584)) InVars {~b~0=v_~b~0_190, ~m5~0=v_~m5~0_59, ~x~0=v_~x~0_136, ~s~0=v_~s~0_585} OutVars{thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|, thread5Thread1of1ForFork4_#res#1.offset=|v_thread5Thread1of1ForFork4_#res#1.offset_29|, ~b~0=v_~b~0_189, ~m5~0=v_~m5~0_59, thread5Thread1of1ForFork4_#res#1.base=|v_thread5Thread1of1ForFork4_#res#1.base_29|, thread5Thread1of1ForFork4_#t~post10#1=|v_thread5Thread1of1ForFork4_#t~post10#1_39|, ~x~0=v_~x~0_136, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31|, ~s~0=v_~s~0_584} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork4_#res#1.offset, ~b~0, thread5Thread1of1ForFork4_#res#1.base, thread5Thread1of1ForFork4_#t~post10#1, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:17,047 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [675] L86-->thread3EXIT: Formula: (and (= (+ v_~s~0_637 1) v_~s~0_636) (= v_~b~0_239 (ite (= (ite (or (not (= (mod v_~b~0_240 256) 0)) (= v_~x~0_163 1)) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork5_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_39| |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_39|) (not (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_39| 0)) (= |v_thread3Thread1of1ForFork5_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_39| (ite (<= v_~m3~0_65 v_~s~0_637) 1 0))) InVars {~m3~0=v_~m3~0_65, ~b~0=v_~b~0_240, ~x~0=v_~x~0_163, ~s~0=v_~s~0_637} OutVars{~m3~0=v_~m3~0_65, thread3Thread1of1ForFork5_#res#1.base=|v_thread3Thread1of1ForFork5_#res#1.base_7|, ~b~0=v_~b~0_239, thread3Thread1of1ForFork5_#res#1.offset=|v_thread3Thread1of1ForFork5_#res#1.offset_7|, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_39|, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_39|, thread3Thread1of1ForFork5_#t~post6#1=|v_thread3Thread1of1ForFork5_#t~post6#1_59|, ~x~0=v_~x~0_163, ~s~0=v_~s~0_636} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_#res#1.base, ~b~0, thread3Thread1of1ForFork5_#res#1.offset, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork5_#t~post6#1, ~s~0] [2022-12-06 00:07:17,117 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [658] L143-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (= (ite (<= v_~m6~0_49 v_~s~0_537) 1 0) |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (not (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| 0)) (= |v_thread6Thread1of1ForFork0_#res#1.offset_41| 0) (= (+ v_~s~0_537 1) v_~s~0_536) (= |v_thread6Thread1of1ForFork0_#res#1.base_41| 0) (= v_~b~0_165 (ite (= (ite (or (not (= (mod v_~b~0_166 256) 0)) (= v_~x~0_121 1)) 1 0) 0) 0 1))) InVars {~b~0=v_~b~0_166, ~m6~0=v_~m6~0_49, ~x~0=v_~x~0_121, ~s~0=v_~s~0_537} OutVars{thread6Thread1of1ForFork0_#res#1.base=|v_thread6Thread1of1ForFork0_#res#1.base_41|, ~b~0=v_~b~0_165, ~m6~0=v_~m6~0_49, thread6Thread1of1ForFork0_#t~post12#1=|v_thread6Thread1of1ForFork0_#t~post12#1_45|, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29|, thread6Thread1of1ForFork0_#res#1.offset=|v_thread6Thread1of1ForFork0_#res#1.offset_41|, ~x~0=v_~x~0_121, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|, ~s~0=v_~s~0_536} AuxVars[] AssignedVars[thread6Thread1of1ForFork0_#res#1.base, ~b~0, thread6Thread1of1ForFork0_#t~post12#1, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork0_#res#1.offset, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-06 00:07:17,189 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [691] L105-->thread4EXIT: Formula: (and (= v_~b~0_281 (ite (= (ite (or (not (= (mod v_~b~0_282 256) 0)) (= v_~x~0_191 1)) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| 0)) (= (+ v_~s~0_685 1) v_~s~0_684) (= |v_thread4Thread1of1ForFork2_#res#1.base_25| 0) (= |v_thread4Thread1of1ForFork2_#res#1.offset_25| 0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m4~0_71 v_~s~0_685) 1 0))) InVars {~b~0=v_~b~0_282, ~m4~0=v_~m4~0_71, ~x~0=v_~x~0_191, ~s~0=v_~s~0_685} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_25|, ~b~0=v_~b~0_281, ~m4~0=v_~m4~0_71, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_55|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, ~x~0=v_~x~0_191, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_25|, ~s~0=v_~s~0_684} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, ~b~0, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#res#1.offset, ~s~0] [2022-12-06 00:07:17,254 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-06 00:07:17,321 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:17,322 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 439 [2022-12-06 00:07:17,322 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 305 flow [2022-12-06 00:07:17,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:17,322 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:17,323 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:17,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:07:17,323 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 4 more)] === [2022-12-06 00:07:17,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:17,323 INFO L85 PathProgramCache]: Analyzing trace with hash 261006528, now seen corresponding path program 1 times [2022-12-06 00:07:17,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:17,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330794668] [2022-12-06 00:07:17,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:17,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:17,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:07:17,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:17,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330794668] [2022-12-06 00:07:17,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330794668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:17,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:17,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:17,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577214050] [2022-12-06 00:07:17,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:17,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:07:17,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:17,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:07:17,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:07:17,560 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 00:07:17,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 305 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:17,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:17,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 00:07:17,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:18,639 INFO L130 PetriNetUnfolder]: 12357/16036 cut-off events. [2022-12-06 00:07:18,639 INFO L131 PetriNetUnfolder]: For 36150/36150 co-relation queries the response was YES. [2022-12-06 00:07:18,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60541 conditions, 16036 events. 12357/16036 cut-off events. For 36150/36150 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 70336 event pairs, 2324 based on Foata normal form. 124/16160 useless extension candidates. Maximal degree in co-relation 25973. Up to 15182 conditions per place. [2022-12-06 00:07:18,831 INFO L137 encePairwiseOnDemand]: 31/48 looper letters, 88 selfloop transitions, 24 changer transitions 3/115 dead transitions. [2022-12-06 00:07:18,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 115 transitions, 828 flow [2022-12-06 00:07:18,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:18,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-12-06 00:07:18,835 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-06 00:07:18,835 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 305 flow. Second operand 5 states and 112 transitions. [2022-12-06 00:07:18,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 115 transitions, 828 flow [2022-12-06 00:07:18,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 115 transitions, 649 flow, removed 32 selfloop flow, removed 5 redundant places. [2022-12-06 00:07:18,863 INFO L231 Difference]: Finished difference. Result has 57 places, 75 transitions, 410 flow [2022-12-06 00:07:18,863 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=410, PETRI_PLACES=57, PETRI_TRANSITIONS=75} [2022-12-06 00:07:18,864 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 0 predicate places. [2022-12-06 00:07:18,864 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:18,864 INFO L89 Accepts]: Start accepts. Operand has 57 places, 75 transitions, 410 flow [2022-12-06 00:07:18,866 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:18,866 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:18,866 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 75 transitions, 410 flow [2022-12-06 00:07:18,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 75 transitions, 410 flow [2022-12-06 00:07:19,010 INFO L130 PetriNetUnfolder]: 1259/2304 cut-off events. [2022-12-06 00:07:19,011 INFO L131 PetriNetUnfolder]: For 2855/3520 co-relation queries the response was YES. [2022-12-06 00:07:19,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7039 conditions, 2304 events. 1259/2304 cut-off events. For 2855/3520 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 15305 event pairs, 297 based on Foata normal form. 30/2091 useless extension candidates. Maximal degree in co-relation 6591. Up to 1479 conditions per place. [2022-12-06 00:07:19,035 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 75 transitions, 410 flow [2022-12-06 00:07:19,035 INFO L188 LiptonReduction]: Number of co-enabled transitions 900 [2022-12-06 00:07:19,040 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [710] L45-->thread3EXIT: Formula: (let ((.cse0 (= v_~x~0_258 1))) (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_55|) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_51| |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_51|) (= |v_thread3Thread1of1ForFork5_#res#1.offset_19| 0) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_51| (ite (<= v_~m3~0_99 v_~s~0_801) 1 0)) (= (+ v_~s~0_801 1) v_~s~0_800) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_55| 0)) (= |v_thread3Thread1of1ForFork5_#res#1.base_19| 0) (not (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_51| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55| (ite (<= v_~m1~0_121 v_~s~0_801) 1 0)) (= v_~b~0_385 (ite (= (ite (or (not (= (mod v_~b~0_386 256) 0)) .cse0) 1 0) 0) 0 1)) .cse0)) InVars {~m3~0=v_~m3~0_99, ~b~0=v_~b~0_386, ~m1~0=v_~m1~0_121, ~s~0=v_~s~0_801} OutVars{~m3~0=v_~m3~0_99, thread3Thread1of1ForFork5_#res#1.base=|v_thread3Thread1of1ForFork5_#res#1.base_19|, ~b~0=v_~b~0_385, thread3Thread1of1ForFork5_#res#1.offset=|v_thread3Thread1of1ForFork5_#res#1.offset_19|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|, ~m1~0=v_~m1~0_121, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_51|, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_51|, thread3Thread1of1ForFork5_#t~post6#1=|v_thread3Thread1of1ForFork5_#t~post6#1_71|, ~x~0=v_~x~0_258, ~s~0=v_~s~0_800, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_55|} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_#res#1.base, ~b~0, thread3Thread1of1ForFork5_#res#1.offset, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork5_#t~post6#1, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [586] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_29| 0) (= v_~x~0_14 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_29| 0) (= (+ v_~s~0_179 1) v_~s~0_178)) InVars {~s~0=v_~s~0_179} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_31|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_29|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_29|, ~x~0=v_~x~0_14, ~s~0=v_~s~0_178} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0] [2022-12-06 00:07:19,135 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:19,136 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 272 [2022-12-06 00:07:19,136 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 75 transitions, 414 flow [2022-12-06 00:07:19,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:19,136 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:19,136 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:19,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:07:19,136 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 4 more)] === [2022-12-06 00:07:19,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:19,137 INFO L85 PathProgramCache]: Analyzing trace with hash -600684432, now seen corresponding path program 2 times [2022-12-06 00:07:19,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:19,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687187226] [2022-12-06 00:07:19,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:19,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:19,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:07:19,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:19,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687187226] [2022-12-06 00:07:19,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687187226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:19,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:19,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 00:07:19,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365351926] [2022-12-06 00:07:19,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:19,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:07:19,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:19,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:07:19,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:07:19,410 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 00:07:19,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 75 transitions, 414 flow. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:19,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:19,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 00:07:19,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:20,640 INFO L130 PetriNetUnfolder]: 11860/15329 cut-off events. [2022-12-06 00:07:20,640 INFO L131 PetriNetUnfolder]: For 30192/30192 co-relation queries the response was YES. [2022-12-06 00:07:20,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57018 conditions, 15329 events. 11860/15329 cut-off events. For 30192/30192 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 65538 event pairs, 3880 based on Foata normal form. 24/15353 useless extension candidates. Maximal degree in co-relation 23704. Up to 14913 conditions per place. [2022-12-06 00:07:20,801 INFO L137 encePairwiseOnDemand]: 26/48 looper letters, 108 selfloop transitions, 109 changer transitions 0/217 dead transitions. [2022-12-06 00:07:20,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 217 transitions, 1600 flow [2022-12-06 00:07:20,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:07:20,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:07:20,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2022-12-06 00:07:20,807 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35984848484848486 [2022-12-06 00:07:20,807 INFO L175 Difference]: Start difference. First operand has 56 places, 75 transitions, 414 flow. Second operand 11 states and 190 transitions. [2022-12-06 00:07:20,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 217 transitions, 1600 flow [2022-12-06 00:07:20,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 217 transitions, 1574 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-12-06 00:07:20,878 INFO L231 Difference]: Finished difference. Result has 66 places, 168 transitions, 1303 flow [2022-12-06 00:07:20,879 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1303, PETRI_PLACES=66, PETRI_TRANSITIONS=168} [2022-12-06 00:07:20,880 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2022-12-06 00:07:20,880 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:20,880 INFO L89 Accepts]: Start accepts. Operand has 66 places, 168 transitions, 1303 flow [2022-12-06 00:07:20,884 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:20,884 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:20,884 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 168 transitions, 1303 flow [2022-12-06 00:07:20,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 168 transitions, 1303 flow [2022-12-06 00:07:21,115 INFO L130 PetriNetUnfolder]: 1778/3195 cut-off events. [2022-12-06 00:07:21,115 INFO L131 PetriNetUnfolder]: For 4754/6845 co-relation queries the response was YES. [2022-12-06 00:07:21,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10523 conditions, 3195 events. 1778/3195 cut-off events. For 4754/6845 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 21829 event pairs, 298 based on Foata normal form. 20/2994 useless extension candidates. Maximal degree in co-relation 9921. Up to 1835 conditions per place. [2022-12-06 00:07:21,151 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 168 transitions, 1303 flow [2022-12-06 00:07:21,151 INFO L188 LiptonReduction]: Number of co-enabled transitions 1238 [2022-12-06 00:07:21,164 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] $Ultimate##0-->L45: Formula: (and (= v_~m1~0_9 v_~t~0_73) (= v_~t~0_72 (+ v_~t~0_73 1))) InVars {~t~0=v_~t~0_73} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_72} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m1~0, ~t~0] and [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] [2022-12-06 00:07:21,184 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] $Ultimate##0-->L45: Formula: (and (= v_~m1~0_9 v_~t~0_73) (= v_~t~0_72 (+ v_~t~0_73 1))) InVars {~t~0=v_~t~0_73} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_72} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m1~0, ~t~0] and [535] $Ultimate##0-->L105: Formula: (and (= v_~m4~0_7 v_~t~0_77) (= v_~t~0_76 (+ v_~t~0_77 1))) InVars {~t~0=v_~t~0_77} OutVars{thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, ~m4~0=v_~m4~0_7, ~t~0=v_~t~0_76} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post7#1, ~m4~0, ~t~0] [2022-12-06 00:07:21,199 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] $Ultimate##0-->L45: Formula: (and (= v_~m1~0_9 v_~t~0_73) (= v_~t~0_72 (+ v_~t~0_73 1))) InVars {~t~0=v_~t~0_73} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_72} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m1~0, ~t~0] and [541] $Ultimate##0-->L124: Formula: (and (= (+ v_~t~0_69 1) v_~t~0_68) (= v_~m5~0_9 v_~t~0_69)) InVars {~t~0=v_~t~0_69} OutVars{thread5Thread1of1ForFork4_#t~post9#1=|v_thread5Thread1of1ForFork4_#t~post9#1_1|, ~m5~0=v_~m5~0_9, ~t~0=v_~t~0_68} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_#t~post9#1, ~m5~0, ~t~0] [2022-12-06 00:07:21,213 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] $Ultimate##0-->L45: Formula: (and (= v_~m1~0_9 v_~t~0_73) (= v_~t~0_72 (+ v_~t~0_73 1))) InVars {~t~0=v_~t~0_73} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_72} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m1~0, ~t~0] and [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] [2022-12-06 00:07:21,229 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] $Ultimate##0-->L45: Formula: (and (= v_~m1~0_9 v_~t~0_73) (= v_~t~0_72 (+ v_~t~0_73 1))) InVars {~t~0=v_~t~0_73} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_72} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m1~0, ~t~0] and [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] [2022-12-06 00:07:21,314 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] and [661] L124-->thread5EXIT: Formula: (and (= |v_thread5Thread1of1ForFork4_#res#1.offset_29| 0) (not (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| 0)) (= v_~b~0_189 (ite (= (ite (or (= v_~x~0_136 1) (not (= (mod v_~b~0_190 256) 0))) 1 0) 0) 0 1)) (= |v_thread5Thread1of1ForFork4_#res#1.base_29| 0) (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (ite (<= v_~m5~0_59 v_~s~0_585) 1 0) |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (+ v_~s~0_585 1) v_~s~0_584)) InVars {~b~0=v_~b~0_190, ~m5~0=v_~m5~0_59, ~x~0=v_~x~0_136, ~s~0=v_~s~0_585} OutVars{thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|, thread5Thread1of1ForFork4_#res#1.offset=|v_thread5Thread1of1ForFork4_#res#1.offset_29|, ~b~0=v_~b~0_189, ~m5~0=v_~m5~0_59, thread5Thread1of1ForFork4_#res#1.base=|v_thread5Thread1of1ForFork4_#res#1.base_29|, thread5Thread1of1ForFork4_#t~post10#1=|v_thread5Thread1of1ForFork4_#t~post10#1_39|, ~x~0=v_~x~0_136, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31|, ~s~0=v_~s~0_584} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork4_#res#1.offset, ~b~0, thread5Thread1of1ForFork4_#res#1.base, thread5Thread1of1ForFork4_#t~post10#1, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:21,363 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] and [691] L105-->thread4EXIT: Formula: (and (= v_~b~0_281 (ite (= (ite (or (not (= (mod v_~b~0_282 256) 0)) (= v_~x~0_191 1)) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| 0)) (= (+ v_~s~0_685 1) v_~s~0_684) (= |v_thread4Thread1of1ForFork2_#res#1.base_25| 0) (= |v_thread4Thread1of1ForFork2_#res#1.offset_25| 0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m4~0_71 v_~s~0_685) 1 0))) InVars {~b~0=v_~b~0_282, ~m4~0=v_~m4~0_71, ~x~0=v_~x~0_191, ~s~0=v_~s~0_685} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_25|, ~b~0=v_~b~0_281, ~m4~0=v_~m4~0_71, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_55|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, ~x~0=v_~x~0_191, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_25|, ~s~0=v_~s~0_684} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, ~b~0, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#res#1.offset, ~s~0] [2022-12-06 00:07:21,417 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] and [658] L143-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (= (ite (<= v_~m6~0_49 v_~s~0_537) 1 0) |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (not (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| 0)) (= |v_thread6Thread1of1ForFork0_#res#1.offset_41| 0) (= (+ v_~s~0_537 1) v_~s~0_536) (= |v_thread6Thread1of1ForFork0_#res#1.base_41| 0) (= v_~b~0_165 (ite (= (ite (or (not (= (mod v_~b~0_166 256) 0)) (= v_~x~0_121 1)) 1 0) 0) 0 1))) InVars {~b~0=v_~b~0_166, ~m6~0=v_~m6~0_49, ~x~0=v_~x~0_121, ~s~0=v_~s~0_537} OutVars{thread6Thread1of1ForFork0_#res#1.base=|v_thread6Thread1of1ForFork0_#res#1.base_41|, ~b~0=v_~b~0_165, ~m6~0=v_~m6~0_49, thread6Thread1of1ForFork0_#t~post12#1=|v_thread6Thread1of1ForFork0_#t~post12#1_45|, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29|, thread6Thread1of1ForFork0_#res#1.offset=|v_thread6Thread1of1ForFork0_#res#1.offset_41|, ~x~0=v_~x~0_121, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|, ~s~0=v_~s~0_536} AuxVars[] AssignedVars[thread6Thread1of1ForFork0_#res#1.base, ~b~0, thread6Thread1of1ForFork0_#t~post12#1, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork0_#res#1.offset, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-06 00:07:21,469 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] and [709] L45-->thread5EXIT: Formula: (let ((.cse0 (= v_~x~0_256 1))) (and (= (+ v_~s~0_797 1) v_~s~0_796) (= |v_thread5Thread1of1ForFork4_#res#1.base_43| 0) (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_45| |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_45|) (= (ite (= (ite (or .cse0 (not (= (mod v_~b~0_382 256) 0))) 1 0) 0) 0 1) v_~b~0_381) .cse0 (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_53| 0)) (not (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_45| 0)) (= |v_thread5Thread1of1ForFork4_#res#1.offset_43| 0) (= (ite (<= v_~m1~0_119 v_~s~0_797) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_53|) (= (ite (<= v_~m5~0_103 v_~s~0_797) 1 0) |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_45|))) InVars {~b~0=v_~b~0_382, ~m5~0=v_~m5~0_103, ~m1~0=v_~m1~0_119, ~s~0=v_~s~0_797} OutVars{thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_45|, thread5Thread1of1ForFork4_#res#1.offset=|v_thread5Thread1of1ForFork4_#res#1.offset_43|, ~b~0=v_~b~0_381, ~m5~0=v_~m5~0_103, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|, ~m1~0=v_~m1~0_119, thread5Thread1of1ForFork4_#res#1.base=|v_thread5Thread1of1ForFork4_#res#1.base_43|, thread5Thread1of1ForFork4_#t~post10#1=|v_thread5Thread1of1ForFork4_#t~post10#1_53|, ~x~0=v_~x~0_256, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_45|, ~s~0=v_~s~0_796, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_53|} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork4_#res#1.offset, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork4_#res#1.base, thread5Thread1of1ForFork4_#t~post10#1, ~x~0, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 00:07:21,543 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] and [710] L45-->thread3EXIT: Formula: (let ((.cse0 (= v_~x~0_258 1))) (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_55|) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_51| |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_51|) (= |v_thread3Thread1of1ForFork5_#res#1.offset_19| 0) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_51| (ite (<= v_~m3~0_99 v_~s~0_801) 1 0)) (= (+ v_~s~0_801 1) v_~s~0_800) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_55| 0)) (= |v_thread3Thread1of1ForFork5_#res#1.base_19| 0) (not (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_51| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55| (ite (<= v_~m1~0_121 v_~s~0_801) 1 0)) (= v_~b~0_385 (ite (= (ite (or (not (= (mod v_~b~0_386 256) 0)) .cse0) 1 0) 0) 0 1)) .cse0)) InVars {~m3~0=v_~m3~0_99, ~b~0=v_~b~0_386, ~m1~0=v_~m1~0_121, ~s~0=v_~s~0_801} OutVars{~m3~0=v_~m3~0_99, thread3Thread1of1ForFork5_#res#1.base=|v_thread3Thread1of1ForFork5_#res#1.base_19|, ~b~0=v_~b~0_385, thread3Thread1of1ForFork5_#res#1.offset=|v_thread3Thread1of1ForFork5_#res#1.offset_19|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|, ~m1~0=v_~m1~0_121, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_51|, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_51|, thread3Thread1of1ForFork5_#t~post6#1=|v_thread3Thread1of1ForFork5_#t~post6#1_71|, ~x~0=v_~x~0_258, ~s~0=v_~s~0_800, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_55|} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_#res#1.base, ~b~0, thread3Thread1of1ForFork5_#res#1.offset, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork5_#t~post6#1, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 00:07:21,634 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] and [712] L45-->thread4EXIT: Formula: (let ((.cse0 (= v_~x~0_262 1))) (and (= |v_thread4Thread1of1ForFork2_#res#1.offset_33| 0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_49| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (ite (<= v_~m1~0_125 v_~s~0_809) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|) .cse0 (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_49| 0)) (= v_~b~0_393 (ite (= (ite (or .cse0 (not (= (mod v_~b~0_394 256) 0))) 1 0) 0) 0 1)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_59| 0)) (= (ite (<= v_~m4~0_95 v_~s~0_809) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (+ v_~s~0_809 1) v_~s~0_808) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_59|) (= |v_thread4Thread1of1ForFork2_#res#1.base_33| 0))) InVars {~b~0=v_~b~0_394, ~m4~0=v_~m4~0_95, ~m1~0=v_~m1~0_125, ~s~0=v_~s~0_809} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_49|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_33|, ~b~0=v_~b~0_393, ~m4~0=v_~m4~0_95, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_63|, ~m1~0=v_~m1~0_125, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, ~x~0=v_~x~0_262, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_33|, ~s~0=v_~s~0_808, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_59|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~x~0, thread4Thread1of1ForFork2_#res#1.offset, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 00:07:21,718 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] and [675] L86-->thread3EXIT: Formula: (and (= (+ v_~s~0_637 1) v_~s~0_636) (= v_~b~0_239 (ite (= (ite (or (not (= (mod v_~b~0_240 256) 0)) (= v_~x~0_163 1)) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork5_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_39| |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_39|) (not (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_39| 0)) (= |v_thread3Thread1of1ForFork5_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_39| (ite (<= v_~m3~0_65 v_~s~0_637) 1 0))) InVars {~m3~0=v_~m3~0_65, ~b~0=v_~b~0_240, ~x~0=v_~x~0_163, ~s~0=v_~s~0_637} OutVars{~m3~0=v_~m3~0_65, thread3Thread1of1ForFork5_#res#1.base=|v_thread3Thread1of1ForFork5_#res#1.base_7|, ~b~0=v_~b~0_239, thread3Thread1of1ForFork5_#res#1.offset=|v_thread3Thread1of1ForFork5_#res#1.offset_7|, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_39|, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_39|, thread3Thread1of1ForFork5_#t~post6#1=|v_thread3Thread1of1ForFork5_#t~post6#1_59|, ~x~0=v_~x~0_163, ~s~0=v_~s~0_636} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_#res#1.base, ~b~0, thread3Thread1of1ForFork5_#res#1.offset, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork5_#t~post6#1, ~s~0] [2022-12-06 00:07:21,773 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] and [711] L45-->thread6EXIT: Formula: (let ((.cse0 (= v_~x~0_260 1))) (and (not (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= (+ v_~s~0_805 1) v_~s~0_804) (= |v_thread6Thread1of1ForFork0_#res#1.offset_57| 0) .cse0 (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_45| |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45|) (= |v_thread6Thread1of1ForFork0_#res#1.base_57| 0) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_57| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_57| (ite (<= v_~m1~0_123 v_~s~0_805) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_57| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_57|) (= v_~b~0_389 (ite (= (ite (or .cse0 (not (= (mod v_~b~0_390 256) 0))) 1 0) 0) 0 1)) (= (ite (<= v_~m6~0_95 v_~s~0_805) 1 0) |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45|))) InVars {~b~0=v_~b~0_390, ~m6~0=v_~m6~0_95, ~m1~0=v_~m1~0_123, ~s~0=v_~s~0_805} OutVars{thread6Thread1of1ForFork0_#res#1.base=|v_thread6Thread1of1ForFork0_#res#1.base_57|, ~b~0=v_~b~0_389, ~m6~0=v_~m6~0_95, thread6Thread1of1ForFork0_#t~post12#1=|v_thread6Thread1of1ForFork0_#t~post12#1_61|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_57|, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_45|, ~m1~0=v_~m1~0_123, thread6Thread1of1ForFork0_#res#1.offset=|v_thread6Thread1of1ForFork0_#res#1.offset_57|, ~x~0=v_~x~0_260, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45|, ~s~0=v_~s~0_804, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_57|} AuxVars[] AssignedVars[thread6Thread1of1ForFork0_#res#1.base, ~b~0, thread6Thread1of1ForFork0_#t~post12#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork0_#res#1.offset, ~x~0, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 00:07:21,852 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:07:21,853 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 973 [2022-12-06 00:07:21,853 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 167 transitions, 1335 flow [2022-12-06 00:07:21,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:21,853 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:21,853 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:21,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 00:07:21,853 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 4 more)] === [2022-12-06 00:07:21,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:21,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1389034247, now seen corresponding path program 1 times [2022-12-06 00:07:21,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:21,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578788261] [2022-12-06 00:07:21,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:21,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:22,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:07:22,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:22,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578788261] [2022-12-06 00:07:22,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578788261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:22,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:22,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:22,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512433815] [2022-12-06 00:07:22,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:22,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:07:22,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:22,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:07:22,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:07:22,017 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 00:07:22,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 167 transitions, 1335 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:22,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:22,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 00:07:22,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:23,241 INFO L130 PetriNetUnfolder]: 12035/15532 cut-off events. [2022-12-06 00:07:23,242 INFO L131 PetriNetUnfolder]: For 35340/35340 co-relation queries the response was YES. [2022-12-06 00:07:23,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63661 conditions, 15532 events. 12035/15532 cut-off events. For 35340/35340 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 66719 event pairs, 3040 based on Foata normal form. 80/15612 useless extension candidates. Maximal degree in co-relation 26533. Up to 15045 conditions per place. [2022-12-06 00:07:23,323 INFO L137 encePairwiseOnDemand]: 29/61 looper letters, 110 selfloop transitions, 131 changer transitions 2/243 dead transitions. [2022-12-06 00:07:23,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 243 transitions, 2407 flow [2022-12-06 00:07:23,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:23,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:23,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2022-12-06 00:07:23,324 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 00:07:23,324 INFO L175 Difference]: Start difference. First operand has 65 places, 167 transitions, 1335 flow. Second operand 5 states and 122 transitions. [2022-12-06 00:07:23,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 243 transitions, 2407 flow [2022-12-06 00:07:23,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 243 transitions, 2256 flow, removed 70 selfloop flow, removed 2 redundant places. [2022-12-06 00:07:23,422 INFO L231 Difference]: Finished difference. Result has 68 places, 208 transitions, 1973 flow [2022-12-06 00:07:23,422 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1973, PETRI_PLACES=68, PETRI_TRANSITIONS=208} [2022-12-06 00:07:23,424 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places. [2022-12-06 00:07:23,424 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:23,425 INFO L89 Accepts]: Start accepts. Operand has 68 places, 208 transitions, 1973 flow [2022-12-06 00:07:23,427 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:23,427 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:23,427 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 208 transitions, 1973 flow [2022-12-06 00:07:23,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 208 transitions, 1973 flow [2022-12-06 00:07:23,552 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([691] L105-->thread4EXIT: Formula: (and (= v_~b~0_281 (ite (= (ite (or (not (= (mod v_~b~0_282 256) 0)) (= v_~x~0_191 1)) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| 0)) (= (+ v_~s~0_685 1) v_~s~0_684) (= |v_thread4Thread1of1ForFork2_#res#1.base_25| 0) (= |v_thread4Thread1of1ForFork2_#res#1.offset_25| 0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m4~0_71 v_~s~0_685) 1 0))) InVars {~b~0=v_~b~0_282, ~m4~0=v_~m4~0_71, ~x~0=v_~x~0_191, ~s~0=v_~s~0_685} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_25|, ~b~0=v_~b~0_281, ~m4~0=v_~m4~0_71, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_55|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, ~x~0=v_~x~0_191, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_25|, ~s~0=v_~s~0_684} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, ~b~0, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#res#1.offset, ~s~0][65], [Black: 256#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ 2 ~s~0) ~m6~0)), 33#$Ultimate##0true, 77#thread2EXITtrue, Black: 227#(and (= ~t~0 0) (= ~s~0 0)), 102#thread4EXITtrue, 47#L45true, Black: 231#(and (<= (+ ~m1~0 1) ~t~0) (= ~m1~0 0) (<= (+ ~m1~0 1) ~m2~0) (= ~s~0 0)), 117#L181-4true, 234#true, 209#(and (= ~x~0 0) (<= ~b~0 0) (<= 0 ~b~0)), 225#true, Black: 243#(and (<= (+ ~s~0 ~m1~0 4) ~m2~0) (= ~m1~0 0)), 250#true, 76#L86true, 121#thread6EXITtrue, Black: 216#(and (= ~x~0 0) (= ~b~0 (* (div ~b~0 256) 256)))]) [2022-12-06 00:07:23,552 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-06 00:07:23,552 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 00:07:23,552 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 00:07:23,552 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 00:07:23,553 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([706] L45-->thread1EXIT: Formula: (and (= v_~b~0_369 1) (= |v_thread1Thread1of1ForFork1_#res#1.offset_61| 0) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_47| 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_47| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_47|) (= |v_thread1Thread1of1ForFork1_#res#1.base_61| 0) (= |v_thread4Thread1of1ForFork2_#res#1.base_31| 0) (= |v_thread4Thread1of1ForFork2_#res#1.offset_31| 0) (= (+ 2 v_~s~0_780) v_~s~0_778) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47| (ite (<= v_~m1~0_113 v_~s~0_780) 1 0)) (= v_~x~0_244 0) (= (ite (<= v_~m4~0_93 v_~s~0_780) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_47|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|)) InVars {~m4~0=v_~m4~0_93, ~m1~0=v_~m1~0_113, ~s~0=v_~s~0_780} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_63|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_47|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_31|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_47|, ~b~0=v_~b~0_369, ~m4~0=v_~m4~0_93, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_61|, ~m1~0=v_~m1~0_113, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_61|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_61|, ~x~0=v_~x~0_244, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_31|, ~s~0=v_~s~0_778, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#t~post8#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, thread4Thread1of1ForFork2_#res#1.offset, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][67], [60#thread1EXITtrue, Black: 256#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ 2 ~s~0) ~m6~0)), 33#$Ultimate##0true, 77#thread2EXITtrue, Black: 227#(and (= ~t~0 0) (= ~s~0 0)), 102#thread4EXITtrue, Black: 231#(and (<= (+ ~m1~0 1) ~t~0) (= ~m1~0 0) (<= (+ ~m1~0 1) ~m2~0) (= ~s~0 0)), 117#L181-4true, 234#true, 225#true, Black: 243#(and (<= (+ ~s~0 ~m1~0 4) ~m2~0) (= ~m1~0 0)), 250#true, 76#L86true, 121#thread6EXITtrue, Black: 216#(and (= ~x~0 0) (= ~b~0 (* (div ~b~0 256) 256)))]) [2022-12-06 00:07:23,553 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-06 00:07:23,553 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 00:07:23,553 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 00:07:23,553 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 00:07:23,553 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([661] L124-->thread5EXIT: Formula: (and (= |v_thread5Thread1of1ForFork4_#res#1.offset_29| 0) (not (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| 0)) (= v_~b~0_189 (ite (= (ite (or (= v_~x~0_136 1) (not (= (mod v_~b~0_190 256) 0))) 1 0) 0) 0 1)) (= |v_thread5Thread1of1ForFork4_#res#1.base_29| 0) (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (ite (<= v_~m5~0_59 v_~s~0_585) 1 0) |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (+ v_~s~0_585 1) v_~s~0_584)) InVars {~b~0=v_~b~0_190, ~m5~0=v_~m5~0_59, ~x~0=v_~x~0_136, ~s~0=v_~s~0_585} OutVars{thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|, thread5Thread1of1ForFork4_#res#1.offset=|v_thread5Thread1of1ForFork4_#res#1.offset_29|, ~b~0=v_~b~0_189, ~m5~0=v_~m5~0_59, thread5Thread1of1ForFork4_#res#1.base=|v_thread5Thread1of1ForFork4_#res#1.base_29|, thread5Thread1of1ForFork4_#t~post10#1=|v_thread5Thread1of1ForFork4_#t~post10#1_39|, ~x~0=v_~x~0_136, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31|, ~s~0=v_~s~0_584} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork4_#res#1.offset, ~b~0, thread5Thread1of1ForFork4_#res#1.base, thread5Thread1of1ForFork4_#t~post10#1, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~s~0][91], [Black: 256#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ 2 ~s~0) ~m6~0)), 111#$Ultimate##0true, 77#thread2EXITtrue, Black: 227#(and (= ~t~0 0) (= ~s~0 0)), Black: 231#(and (<= (+ ~m1~0 1) ~t~0) (= ~m1~0 0) (<= (+ ~m1~0 1) ~m2~0) (= ~s~0 0)), 47#L45true, 234#true, 117#L181-4true, 209#(and (= ~x~0 0) (<= ~b~0 0) (<= 0 ~b~0)), 225#true, 250#true, Black: 243#(and (<= (+ ~s~0 ~m1~0 4) ~m2~0) (= ~m1~0 0)), 76#L86true, 11#thread5EXITtrue, 121#thread6EXITtrue, Black: 216#(and (= ~x~0 0) (= ~b~0 (* (div ~b~0 256) 256)))]) [2022-12-06 00:07:23,553 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-06 00:07:23,553 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 00:07:23,554 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 00:07:23,554 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 00:07:23,554 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([708] L45-->thread1EXIT: Formula: (and (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_43| |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_43|) (= (ite (<= v_~m1~0_117 v_~s~0_792) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (= (+ 2 v_~s~0_792) v_~s~0_790) (= |v_thread1Thread1of1ForFork1_#res#1.offset_65| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_65| 0) (= |v_thread5Thread1of1ForFork4_#res#1.base_41| 0) (= v_~x~0_252 0) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_51| 0)) (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_43| (ite (<= v_~m5~0_101 v_~s~0_792) 1 0)) (not (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_43| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_51|) (= v_~b~0_377 1) (= |v_thread5Thread1of1ForFork4_#res#1.offset_41| 0)) InVars {~m5~0=v_~m5~0_101, ~m1~0=v_~m1~0_117, ~s~0=v_~s~0_792} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_67|, thread5Thread1of1ForFork4_#res#1.offset=|v_thread5Thread1of1ForFork4_#res#1.offset_41|, thread5Thread1of1ForFork4_#res#1.base=|v_thread5Thread1of1ForFork4_#res#1.base_41|, thread5Thread1of1ForFork4_#t~post10#1=|v_thread5Thread1of1ForFork4_#t~post10#1_51|, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_43|, thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_43|, ~b~0=v_~b~0_377, ~m5~0=v_~m5~0_101, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, ~m1~0=v_~m1~0_117, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_65|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_65|, ~x~0=v_~x~0_252, ~s~0=v_~s~0_790, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread5Thread1of1ForFork4_#res#1.offset, thread5Thread1of1ForFork4_#res#1.base, thread5Thread1of1ForFork4_#t~post10#1, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][93], [60#thread1EXITtrue, Black: 256#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ 2 ~s~0) ~m6~0)), 111#$Ultimate##0true, 77#thread2EXITtrue, Black: 227#(and (= ~t~0 0) (= ~s~0 0)), Black: 231#(and (<= (+ ~m1~0 1) ~t~0) (= ~m1~0 0) (<= (+ ~m1~0 1) ~m2~0) (= ~s~0 0)), 117#L181-4true, 234#true, 225#true, Black: 243#(and (<= (+ ~s~0 ~m1~0 4) ~m2~0) (= ~m1~0 0)), 250#true, 76#L86true, 11#thread5EXITtrue, 121#thread6EXITtrue, Black: 216#(and (= ~x~0 0) (= ~b~0 (* (div ~b~0 256) 256)))]) [2022-12-06 00:07:23,554 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-06 00:07:23,554 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 00:07:23,554 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 00:07:23,554 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 00:07:23,599 INFO L130 PetriNetUnfolder]: 1717/2900 cut-off events. [2022-12-06 00:07:23,599 INFO L131 PetriNetUnfolder]: For 3577/5113 co-relation queries the response was YES. [2022-12-06 00:07:23,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8695 conditions, 2900 events. 1717/2900 cut-off events. For 3577/5113 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 17781 event pairs, 290 based on Foata normal form. 20/2560 useless extension candidates. Maximal degree in co-relation 8252. Up to 1646 conditions per place. [2022-12-06 00:07:23,623 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 208 transitions, 1973 flow [2022-12-06 00:07:23,623 INFO L188 LiptonReduction]: Number of co-enabled transitions 1298 [2022-12-06 00:07:23,625 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:23,626 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-06 00:07:23,626 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 208 transitions, 1973 flow [2022-12-06 00:07:23,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:23,626 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:23,626 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:23,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 00:07:23,627 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 4 more)] === [2022-12-06 00:07:23,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:23,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1918834542, now seen corresponding path program 1 times [2022-12-06 00:07:23,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:23,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616472675] [2022-12-06 00:07:23,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:23,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:23,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:07:23,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:23,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616472675] [2022-12-06 00:07:23,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616472675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:23,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:23,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:23,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760832283] [2022-12-06 00:07:23,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:23,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:23,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:23,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:23,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:23,759 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 00:07:23,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 208 transitions, 1973 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:23,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:23,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 00:07:23,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:25,557 INFO L130 PetriNetUnfolder]: 19935/25520 cut-off events. [2022-12-06 00:07:25,558 INFO L131 PetriNetUnfolder]: For 43815/43815 co-relation queries the response was YES. [2022-12-06 00:07:25,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95518 conditions, 25520 events. 19935/25520 cut-off events. For 43815/43815 co-relation queries the response was YES. Maximal size of possible extension queue 927. Compared 115943 event pairs, 3848 based on Foata normal form. 260/25780 useless extension candidates. Maximal degree in co-relation 85954. Up to 18799 conditions per place. [2022-12-06 00:07:25,715 INFO L137 encePairwiseOnDemand]: 27/61 looper letters, 141 selfloop transitions, 222 changer transitions 0/363 dead transitions. [2022-12-06 00:07:25,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 363 transitions, 3851 flow [2022-12-06 00:07:25,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:07:25,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:07:25,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 176 transitions. [2022-12-06 00:07:25,716 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4808743169398907 [2022-12-06 00:07:25,716 INFO L175 Difference]: Start difference. First operand has 67 places, 208 transitions, 1973 flow. Second operand 6 states and 176 transitions. [2022-12-06 00:07:25,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 363 transitions, 3851 flow [2022-12-06 00:07:25,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 363 transitions, 3679 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 00:07:25,881 INFO L231 Difference]: Finished difference. Result has 72 places, 301 transitions, 3511 flow [2022-12-06 00:07:25,881 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1847, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3511, PETRI_PLACES=72, PETRI_TRANSITIONS=301} [2022-12-06 00:07:25,882 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 15 predicate places. [2022-12-06 00:07:25,882 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:25,882 INFO L89 Accepts]: Start accepts. Operand has 72 places, 301 transitions, 3511 flow [2022-12-06 00:07:25,883 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:25,883 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:25,883 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 301 transitions, 3511 flow [2022-12-06 00:07:25,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 301 transitions, 3511 flow [2022-12-06 00:07:26,436 INFO L130 PetriNetUnfolder]: 4722/7005 cut-off events. [2022-12-06 00:07:26,437 INFO L131 PetriNetUnfolder]: For 16569/22183 co-relation queries the response was YES. [2022-12-06 00:07:26,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28120 conditions, 7005 events. 4722/7005 cut-off events. For 16569/22183 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 41037 event pairs, 674 based on Foata normal form. 42/6629 useless extension candidates. Maximal degree in co-relation 27417. Up to 4034 conditions per place. [2022-12-06 00:07:26,489 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 301 transitions, 3511 flow [2022-12-06 00:07:26,490 INFO L188 LiptonReduction]: Number of co-enabled transitions 1954 [2022-12-06 00:07:26,494 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:26,494 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 612 [2022-12-06 00:07:26,494 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 301 transitions, 3511 flow [2022-12-06 00:07:26,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:26,495 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:26,495 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:26,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 00:07:26,495 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 4 more)] === [2022-12-06 00:07:26,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:26,495 INFO L85 PathProgramCache]: Analyzing trace with hash 396203711, now seen corresponding path program 1 times [2022-12-06 00:07:26,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:26,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841087604] [2022-12-06 00:07:26,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:26,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:26,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:07:26,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:26,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841087604] [2022-12-06 00:07:26,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841087604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:26,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:26,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:07:26,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839099306] [2022-12-06 00:07:26,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:26,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:07:26,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:26,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:07:26,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:07:26,661 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 00:07:26,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 301 transitions, 3511 flow. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:26,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:26,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 00:07:26,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:29,571 INFO L130 PetriNetUnfolder]: 25797/33100 cut-off events. [2022-12-06 00:07:29,571 INFO L131 PetriNetUnfolder]: For 93455/93455 co-relation queries the response was YES. [2022-12-06 00:07:29,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155823 conditions, 33100 events. 25797/33100 cut-off events. For 93455/93455 co-relation queries the response was YES. Maximal size of possible extension queue 1329. Compared 157131 event pairs, 4022 based on Foata normal form. 348/33448 useless extension candidates. Maximal degree in co-relation 133053. Up to 19633 conditions per place. [2022-12-06 00:07:29,759 INFO L137 encePairwiseOnDemand]: 29/61 looper letters, 159 selfloop transitions, 440 changer transitions 0/599 dead transitions. [2022-12-06 00:07:29,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 599 transitions, 7592 flow [2022-12-06 00:07:29,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:07:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:07:29,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 240 transitions. [2022-12-06 00:07:29,761 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4371584699453552 [2022-12-06 00:07:29,761 INFO L175 Difference]: Start difference. First operand has 72 places, 301 transitions, 3511 flow. Second operand 9 states and 240 transitions. [2022-12-06 00:07:29,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 599 transitions, 7592 flow [2022-12-06 00:07:30,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 599 transitions, 7345 flow, removed 118 selfloop flow, removed 1 redundant places. [2022-12-06 00:07:30,909 INFO L231 Difference]: Finished difference. Result has 81 places, 526 transitions, 7256 flow [2022-12-06 00:07:30,909 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=3430, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=238, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7256, PETRI_PLACES=81, PETRI_TRANSITIONS=526} [2022-12-06 00:07:30,909 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2022-12-06 00:07:30,910 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:30,910 INFO L89 Accepts]: Start accepts. Operand has 81 places, 526 transitions, 7256 flow [2022-12-06 00:07:30,911 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:30,911 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:30,912 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 526 transitions, 7256 flow [2022-12-06 00:07:30,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 526 transitions, 7256 flow [2022-12-06 00:07:31,610 INFO L130 PetriNetUnfolder]: 6802/9718 cut-off events. [2022-12-06 00:07:31,610 INFO L131 PetriNetUnfolder]: For 30476/44957 co-relation queries the response was YES. [2022-12-06 00:07:31,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47504 conditions, 9718 events. 6802/9718 cut-off events. For 30476/44957 co-relation queries the response was YES. Maximal size of possible extension queue 835. Compared 56849 event pairs, 749 based on Foata normal form. 45/9285 useless extension candidates. Maximal degree in co-relation 46758. Up to 5425 conditions per place. [2022-12-06 00:07:31,699 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 526 transitions, 7256 flow [2022-12-06 00:07:31,699 INFO L188 LiptonReduction]: Number of co-enabled transitions 2900 [2022-12-06 00:07:31,706 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:31,707 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 797 [2022-12-06 00:07:31,707 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 526 transitions, 7256 flow [2022-12-06 00:07:31,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:31,707 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:31,707 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:31,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 00:07:31,707 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 4 more)] === [2022-12-06 00:07:31,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:31,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1930979095, now seen corresponding path program 2 times [2022-12-06 00:07:31,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:31,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077195148] [2022-12-06 00:07:31,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:31,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:31,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:07:31,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:31,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077195148] [2022-12-06 00:07:31,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077195148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:31,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:31,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:31,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407162012] [2022-12-06 00:07:31,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:31,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:07:31,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:31,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:07:31,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:07:31,910 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 00:07:31,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 526 transitions, 7256 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:31,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:31,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 00:07:31,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:35,008 INFO L130 PetriNetUnfolder]: 26012/33427 cut-off events. [2022-12-06 00:07:35,008 INFO L131 PetriNetUnfolder]: For 130855/130855 co-relation queries the response was YES. [2022-12-06 00:07:35,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184255 conditions, 33427 events. 26012/33427 cut-off events. For 130855/130855 co-relation queries the response was YES. Maximal size of possible extension queue 1321. Compared 159268 event pairs, 4285 based on Foata normal form. 356/33783 useless extension candidates. Maximal degree in co-relation 156578. Up to 32621 conditions per place. [2022-12-06 00:07:35,215 INFO L137 encePairwiseOnDemand]: 34/61 looper letters, 285 selfloop transitions, 380 changer transitions 0/665 dead transitions. [2022-12-06 00:07:35,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 665 transitions, 10603 flow [2022-12-06 00:07:35,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:35,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:35,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2022-12-06 00:07:35,216 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3901639344262295 [2022-12-06 00:07:35,216 INFO L175 Difference]: Start difference. First operand has 81 places, 526 transitions, 7256 flow. Second operand 5 states and 119 transitions. [2022-12-06 00:07:35,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 665 transitions, 10603 flow [2022-12-06 00:07:35,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 665 transitions, 10494 flow, removed 49 selfloop flow, removed 1 redundant places. [2022-12-06 00:07:35,712 INFO L231 Difference]: Finished difference. Result has 84 places, 628 transitions, 9764 flow [2022-12-06 00:07:35,712 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=6937, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=266, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9764, PETRI_PLACES=84, PETRI_TRANSITIONS=628} [2022-12-06 00:07:35,713 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 27 predicate places. [2022-12-06 00:07:35,713 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:35,713 INFO L89 Accepts]: Start accepts. Operand has 84 places, 628 transitions, 9764 flow [2022-12-06 00:07:35,715 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:35,715 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:35,715 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 628 transitions, 9764 flow [2022-12-06 00:07:35,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 628 transitions, 9764 flow [2022-12-06 00:07:36,665 INFO L130 PetriNetUnfolder]: 6839/9796 cut-off events. [2022-12-06 00:07:36,666 INFO L131 PetriNetUnfolder]: For 30104/43208 co-relation queries the response was YES. [2022-12-06 00:07:36,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45302 conditions, 9796 events. 6839/9796 cut-off events. For 30104/43208 co-relation queries the response was YES. Maximal size of possible extension queue 827. Compared 56926 event pairs, 767 based on Foata normal form. 45/9353 useless extension candidates. Maximal degree in co-relation 44555. Up to 4484 conditions per place. [2022-12-06 00:07:36,764 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 628 transitions, 9764 flow [2022-12-06 00:07:36,765 INFO L188 LiptonReduction]: Number of co-enabled transitions 3224 [2022-12-06 00:07:36,771 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:36,772 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1059 [2022-12-06 00:07:36,772 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 628 transitions, 9764 flow [2022-12-06 00:07:36,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:36,772 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:36,772 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:36,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 00:07:36,773 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 4 more)] === [2022-12-06 00:07:36,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:36,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1193440958, now seen corresponding path program 2 times [2022-12-06 00:07:36,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:36,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998634301] [2022-12-06 00:07:36,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:36,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:07:36,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:36,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998634301] [2022-12-06 00:07:36,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998634301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:36,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:36,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:36,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610204149] [2022-12-06 00:07:36,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:36,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:07:36,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:36,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:07:36,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:07:36,914 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 00:07:36,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 628 transitions, 9764 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:36,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:36,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 00:07:36,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:39,871 INFO L130 PetriNetUnfolder]: 26012/33481 cut-off events. [2022-12-06 00:07:39,872 INFO L131 PetriNetUnfolder]: For 120169/120169 co-relation queries the response was YES. [2022-12-06 00:07:39,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176027 conditions, 33481 events. 26012/33481 cut-off events. For 120169/120169 co-relation queries the response was YES. Maximal size of possible extension queue 1316. Compared 160274 event pairs, 3982 based on Foata normal form. 244/33725 useless extension candidates. Maximal degree in co-relation 150673. Up to 32467 conditions per place. [2022-12-06 00:07:40,115 INFO L137 encePairwiseOnDemand]: 29/61 looper letters, 279 selfloop transitions, 418 changer transitions 0/697 dead transitions. [2022-12-06 00:07:40,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 697 transitions, 11984 flow [2022-12-06 00:07:40,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:40,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:40,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2022-12-06 00:07:40,117 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39344262295081966 [2022-12-06 00:07:40,117 INFO L175 Difference]: Start difference. First operand has 84 places, 628 transitions, 9764 flow. Second operand 5 states and 120 transitions. [2022-12-06 00:07:40,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 697 transitions, 11984 flow [2022-12-06 00:07:40,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 697 transitions, 11569 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 00:07:40,483 INFO L231 Difference]: Finished difference. Result has 87 places, 662 transitions, 11101 flow [2022-12-06 00:07:40,483 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=9013, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=364, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=11101, PETRI_PLACES=87, PETRI_TRANSITIONS=662} [2022-12-06 00:07:40,484 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 30 predicate places. [2022-12-06 00:07:40,484 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:40,484 INFO L89 Accepts]: Start accepts. Operand has 87 places, 662 transitions, 11101 flow [2022-12-06 00:07:40,486 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:40,486 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:40,486 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 662 transitions, 11101 flow [2022-12-06 00:07:40,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 662 transitions, 11101 flow [2022-12-06 00:07:41,223 INFO L130 PetriNetUnfolder]: 6819/9752 cut-off events. [2022-12-06 00:07:41,223 INFO L131 PetriNetUnfolder]: For 32849/46706 co-relation queries the response was YES. [2022-12-06 00:07:41,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45557 conditions, 9752 events. 6819/9752 cut-off events. For 32849/46706 co-relation queries the response was YES. Maximal size of possible extension queue 831. Compared 56545 event pairs, 733 based on Foata normal form. 45/9331 useless extension candidates. Maximal degree in co-relation 44853. Up to 4453 conditions per place. [2022-12-06 00:07:41,478 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 662 transitions, 11101 flow [2022-12-06 00:07:41,478 INFO L188 LiptonReduction]: Number of co-enabled transitions 3324 [2022-12-06 00:07:41,483 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:41,483 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 999 [2022-12-06 00:07:41,483 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 662 transitions, 11101 flow [2022-12-06 00:07:41,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:41,484 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:41,484 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:41,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 00:07:41,484 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 4 more)] === [2022-12-06 00:07:41,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:41,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1626210604, now seen corresponding path program 1 times [2022-12-06 00:07:41,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:41,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758281856] [2022-12-06 00:07:41,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:41,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:07:41,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:41,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758281856] [2022-12-06 00:07:41,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758281856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:41,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:41,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:07:41,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124539971] [2022-12-06 00:07:41,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:41,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:41,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:41,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:41,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:41,621 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 00:07:41,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 662 transitions, 11101 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:41,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:41,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 00:07:41,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:44,681 INFO L130 PetriNetUnfolder]: 25645/33110 cut-off events. [2022-12-06 00:07:44,681 INFO L131 PetriNetUnfolder]: For 125039/125039 co-relation queries the response was YES. [2022-12-06 00:07:44,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174113 conditions, 33110 events. 25645/33110 cut-off events. For 125039/125039 co-relation queries the response was YES. Maximal size of possible extension queue 1331. Compared 160060 event pairs, 4087 based on Foata normal form. 276/33386 useless extension candidates. Maximal degree in co-relation 148840. Up to 32863 conditions per place. [2022-12-06 00:07:44,936 INFO L137 encePairwiseOnDemand]: 46/61 looper letters, 610 selfloop transitions, 10 changer transitions 26/646 dead transitions. [2022-12-06 00:07:44,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 646 transitions, 11506 flow [2022-12-06 00:07:44,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:44,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-12-06 00:07:44,937 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36885245901639346 [2022-12-06 00:07:44,937 INFO L175 Difference]: Start difference. First operand has 87 places, 662 transitions, 11101 flow. Second operand 4 states and 90 transitions. [2022-12-06 00:07:44,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 646 transitions, 11506 flow [2022-12-06 00:07:45,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 646 transitions, 11165 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 00:07:45,414 INFO L231 Difference]: Finished difference. Result has 89 places, 611 transitions, 9760 flow [2022-12-06 00:07:45,414 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=9655, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=9760, PETRI_PLACES=89, PETRI_TRANSITIONS=611} [2022-12-06 00:07:45,415 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 32 predicate places. [2022-12-06 00:07:45,415 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:45,415 INFO L89 Accepts]: Start accepts. Operand has 89 places, 611 transitions, 9760 flow [2022-12-06 00:07:45,417 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:45,417 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:45,417 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 611 transitions, 9760 flow [2022-12-06 00:07:45,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 611 transitions, 9760 flow [2022-12-06 00:07:46,261 INFO L130 PetriNetUnfolder]: 6660/9562 cut-off events. [2022-12-06 00:07:46,261 INFO L131 PetriNetUnfolder]: For 31111/40824 co-relation queries the response was YES. [2022-12-06 00:07:46,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43896 conditions, 9562 events. 6660/9562 cut-off events. For 31111/40824 co-relation queries the response was YES. Maximal size of possible extension queue 826. Compared 55661 event pairs, 739 based on Foata normal form. 45/9150 useless extension candidates. Maximal degree in co-relation 43171. Up to 4345 conditions per place. [2022-12-06 00:07:46,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 611 transitions, 9760 flow [2022-12-06 00:07:46,339 INFO L188 LiptonReduction]: Number of co-enabled transitions 3126 [2022-12-06 00:07:46,344 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:46,344 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 929 [2022-12-06 00:07:46,344 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 611 transitions, 9760 flow [2022-12-06 00:07:46,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:46,344 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:46,345 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:46,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 00:07:46,345 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 4 more)] === [2022-12-06 00:07:46,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:46,345 INFO L85 PathProgramCache]: Analyzing trace with hash 733317168, now seen corresponding path program 1 times [2022-12-06 00:07:46,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:46,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791955019] [2022-12-06 00:07:46,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:46,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:46,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:07:46,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:46,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791955019] [2022-12-06 00:07:46,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791955019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:46,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:46,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:07:46,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053979029] [2022-12-06 00:07:46,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:46,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:46,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:46,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:46,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:46,484 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-06 00:07:46,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 611 transitions, 9760 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:46,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:46,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-06 00:07:46,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:49,272 INFO L130 PetriNetUnfolder]: 22883/29600 cut-off events. [2022-12-06 00:07:49,272 INFO L131 PetriNetUnfolder]: For 111069/111069 co-relation queries the response was YES. [2022-12-06 00:07:49,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152281 conditions, 29600 events. 22883/29600 cut-off events. For 111069/111069 co-relation queries the response was YES. Maximal size of possible extension queue 1220. Compared 141966 event pairs, 3967 based on Foata normal form. 268/29868 useless extension candidates. Maximal degree in co-relation 133819. Up to 29361 conditions per place. [2022-12-06 00:07:49,511 INFO L137 encePairwiseOnDemand]: 42/60 looper letters, 511 selfloop transitions, 78 changer transitions 0/589 dead transitions. [2022-12-06 00:07:49,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 589 transitions, 10039 flow [2022-12-06 00:07:49,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:49,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:49,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-06 00:07:49,512 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37083333333333335 [2022-12-06 00:07:49,512 INFO L175 Difference]: Start difference. First operand has 88 places, 611 transitions, 9760 flow. Second operand 4 states and 89 transitions. [2022-12-06 00:07:49,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 589 transitions, 10039 flow [2022-12-06 00:07:49,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 589 transitions, 9903 flow, removed 58 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:49,828 INFO L231 Difference]: Finished difference. Result has 89 places, 557 transitions, 8823 flow [2022-12-06 00:07:49,828 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=7741, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=8823, PETRI_PLACES=89, PETRI_TRANSITIONS=557} [2022-12-06 00:07:49,828 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 32 predicate places. [2022-12-06 00:07:49,829 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:49,829 INFO L89 Accepts]: Start accepts. Operand has 89 places, 557 transitions, 8823 flow [2022-12-06 00:07:49,830 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:49,830 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:49,831 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 557 transitions, 8823 flow [2022-12-06 00:07:49,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 557 transitions, 8823 flow [2022-12-06 00:07:50,456 INFO L130 PetriNetUnfolder]: 5808/8488 cut-off events. [2022-12-06 00:07:50,457 INFO L131 PetriNetUnfolder]: For 26357/31755 co-relation queries the response was YES. [2022-12-06 00:07:50,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38213 conditions, 8488 events. 5808/8488 cut-off events. For 26357/31755 co-relation queries the response was YES. Maximal size of possible extension queue 742. Compared 50125 event pairs, 684 based on Foata normal form. 45/8106 useless extension candidates. Maximal degree in co-relation 37506. Up to 3799 conditions per place. [2022-12-06 00:07:50,528 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 557 transitions, 8823 flow [2022-12-06 00:07:50,528 INFO L188 LiptonReduction]: Number of co-enabled transitions 2854 [2022-12-06 00:07:50,534 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:50,535 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 706 [2022-12-06 00:07:50,535 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 557 transitions, 8823 flow [2022-12-06 00:07:50,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:50,535 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:50,535 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:50,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 00:07:50,535 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 4 more)] === [2022-12-06 00:07:50,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:50,536 INFO L85 PathProgramCache]: Analyzing trace with hash -2067901108, now seen corresponding path program 1 times [2022-12-06 00:07:50,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:50,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578150035] [2022-12-06 00:07:50,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:50,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:50,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:07:50,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:50,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578150035] [2022-12-06 00:07:50,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578150035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:50,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:50,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:07:50,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164328721] [2022-12-06 00:07:50,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:50,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:07:50,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:50,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:07:50,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:07:50,696 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 00:07:50,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 557 transitions, 8823 flow. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:50,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:50,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 00:07:50,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:54,191 INFO L130 PetriNetUnfolder]: 25594/33253 cut-off events. [2022-12-06 00:07:54,192 INFO L131 PetriNetUnfolder]: For 121983/121983 co-relation queries the response was YES. [2022-12-06 00:07:54,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173484 conditions, 33253 events. 25594/33253 cut-off events. For 121983/121983 co-relation queries the response was YES. Maximal size of possible extension queue 1393. Compared 164655 event pairs, 4504 based on Foata normal form. 1218/34471 useless extension candidates. Maximal degree in co-relation 153626. Up to 24587 conditions per place. [2022-12-06 00:07:54,428 INFO L137 encePairwiseOnDemand]: 28/58 looper letters, 239 selfloop transitions, 613 changer transitions 0/852 dead transitions. [2022-12-06 00:07:54,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 852 transitions, 13773 flow [2022-12-06 00:07:54,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:07:54,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:07:54,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 226 transitions. [2022-12-06 00:07:54,429 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4870689655172414 [2022-12-06 00:07:54,429 INFO L175 Difference]: Start difference. First operand has 89 places, 557 transitions, 8823 flow. Second operand 8 states and 226 transitions. [2022-12-06 00:07:54,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 852 transitions, 13773 flow [2022-12-06 00:07:55,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 852 transitions, 13686 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 00:07:55,056 INFO L231 Difference]: Finished difference. Result has 95 places, 743 transitions, 12947 flow [2022-12-06 00:07:55,057 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=8736, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=427, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12947, PETRI_PLACES=95, PETRI_TRANSITIONS=743} [2022-12-06 00:07:55,057 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 38 predicate places. [2022-12-06 00:07:55,057 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:55,057 INFO L89 Accepts]: Start accepts. Operand has 95 places, 743 transitions, 12947 flow [2022-12-06 00:07:55,059 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:55,059 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:55,060 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 743 transitions, 12947 flow [2022-12-06 00:07:55,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 743 transitions, 12947 flow [2022-12-06 00:07:55,928 INFO L130 PetriNetUnfolder]: 6677/9775 cut-off events. [2022-12-06 00:07:55,928 INFO L131 PetriNetUnfolder]: For 38459/45004 co-relation queries the response was YES. [2022-12-06 00:07:55,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50227 conditions, 9775 events. 6677/9775 cut-off events. For 38459/45004 co-relation queries the response was YES. Maximal size of possible extension queue 841. Compared 59213 event pairs, 773 based on Foata normal form. 47/9354 useless extension candidates. Maximal degree in co-relation 49451. Up to 4422 conditions per place. [2022-12-06 00:07:56,020 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 743 transitions, 12947 flow [2022-12-06 00:07:56,020 INFO L188 LiptonReduction]: Number of co-enabled transitions 3626 [2022-12-06 00:07:56,027 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:56,028 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 971 [2022-12-06 00:07:56,028 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 743 transitions, 12947 flow [2022-12-06 00:07:56,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:56,028 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:56,028 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:56,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 00:07:56,029 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 4 more)] === [2022-12-06 00:07:56,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:56,029 INFO L85 PathProgramCache]: Analyzing trace with hash -4460429, now seen corresponding path program 1 times [2022-12-06 00:07:56,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:56,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764530660] [2022-12-06 00:07:56,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:56,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:07:56,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:56,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764530660] [2022-12-06 00:07:56,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764530660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:56,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:56,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:56,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790167218] [2022-12-06 00:07:56,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:56,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:07:56,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:56,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:07:56,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:07:56,174 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 00:07:56,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 743 transitions, 12947 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:56,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:56,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 00:07:56,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:59,163 INFO L130 PetriNetUnfolder]: 20903/27370 cut-off events. [2022-12-06 00:07:59,163 INFO L131 PetriNetUnfolder]: For 124719/124719 co-relation queries the response was YES. [2022-12-06 00:07:59,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147389 conditions, 27370 events. 20903/27370 cut-off events. For 124719/124719 co-relation queries the response was YES. Maximal size of possible extension queue 1176. Compared 134445 event pairs, 4145 based on Foata normal form. 604/27974 useless extension candidates. Maximal degree in co-relation 146375. Up to 26530 conditions per place. [2022-12-06 00:07:59,329 INFO L137 encePairwiseOnDemand]: 36/58 looper letters, 333 selfloop transitions, 195 changer transitions 12/540 dead transitions. [2022-12-06 00:07:59,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 540 transitions, 8939 flow [2022-12-06 00:07:59,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:59,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:59,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2022-12-06 00:07:59,330 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36551724137931035 [2022-12-06 00:07:59,330 INFO L175 Difference]: Start difference. First operand has 95 places, 743 transitions, 12947 flow. Second operand 5 states and 106 transitions. [2022-12-06 00:07:59,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 540 transitions, 8939 flow [2022-12-06 00:07:59,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 540 transitions, 8470 flow, removed 22 selfloop flow, removed 4 redundant places. [2022-12-06 00:07:59,705 INFO L231 Difference]: Finished difference. Result has 95 places, 505 transitions, 7607 flow [2022-12-06 00:07:59,705 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=6774, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7607, PETRI_PLACES=95, PETRI_TRANSITIONS=505} [2022-12-06 00:07:59,706 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 38 predicate places. [2022-12-06 00:07:59,706 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:59,706 INFO L89 Accepts]: Start accepts. Operand has 95 places, 505 transitions, 7607 flow [2022-12-06 00:07:59,708 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:59,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:59,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 505 transitions, 7607 flow [2022-12-06 00:07:59,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 505 transitions, 7607 flow [2022-12-06 00:08:00,327 INFO L130 PetriNetUnfolder]: 5277/7793 cut-off events. [2022-12-06 00:08:00,327 INFO L131 PetriNetUnfolder]: For 23769/25786 co-relation queries the response was YES. [2022-12-06 00:08:00,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35400 conditions, 7793 events. 5277/7793 cut-off events. For 23769/25786 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 46816 event pairs, 683 based on Foata normal form. 36/7415 useless extension candidates. Maximal degree in co-relation 34755. Up to 3540 conditions per place. [2022-12-06 00:08:00,388 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 505 transitions, 7607 flow [2022-12-06 00:08:00,389 INFO L188 LiptonReduction]: Number of co-enabled transitions 2470 [2022-12-06 00:08:00,392 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:08:00,392 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 686 [2022-12-06 00:08:00,392 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 505 transitions, 7607 flow [2022-12-06 00:08:00,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:00,392 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:00,392 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:00,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 00:08:00,393 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:08:00,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:00,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1902372427, now seen corresponding path program 1 times [2022-12-06 00:08:00,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:00,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747001095] [2022-12-06 00:08:00,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:00,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:00,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:08:00,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:00,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747001095] [2022-12-06 00:08:00,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747001095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:00,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:00,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:08:00,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173602796] [2022-12-06 00:08:00,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:00,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:08:00,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:00,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:08:00,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:08:00,574 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 00:08:00,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 505 transitions, 7607 flow. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:00,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:00,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 00:08:00,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:03,355 INFO L130 PetriNetUnfolder]: 21156/27539 cut-off events. [2022-12-06 00:08:03,355 INFO L131 PetriNetUnfolder]: For 98804/98804 co-relation queries the response was YES. [2022-12-06 00:08:03,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143106 conditions, 27539 events. 21156/27539 cut-off events. For 98804/98804 co-relation queries the response was YES. Maximal size of possible extension queue 1163. Compared 133358 event pairs, 4926 based on Foata normal form. 200/27739 useless extension candidates. Maximal degree in co-relation 131052. Up to 17579 conditions per place. [2022-12-06 00:08:03,533 INFO L137 encePairwiseOnDemand]: 30/53 looper letters, 126 selfloop transitions, 514 changer transitions 0/640 dead transitions. [2022-12-06 00:08:03,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 640 transitions, 10328 flow [2022-12-06 00:08:03,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:08:03,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:08:03,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2022-12-06 00:08:03,534 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39832285115303984 [2022-12-06 00:08:03,534 INFO L175 Difference]: Start difference. First operand has 94 places, 505 transitions, 7607 flow. Second operand 9 states and 190 transitions. [2022-12-06 00:08:03,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 640 transitions, 10328 flow [2022-12-06 00:08:03,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 640 transitions, 9900 flow, removed 28 selfloop flow, removed 4 redundant places. [2022-12-06 00:08:03,827 INFO L231 Difference]: Finished difference. Result has 98 places, 589 transitions, 9433 flow [2022-12-06 00:08:03,827 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=7223, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=430, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9433, PETRI_PLACES=98, PETRI_TRANSITIONS=589} [2022-12-06 00:08:03,828 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 41 predicate places. [2022-12-06 00:08:03,828 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:03,828 INFO L89 Accepts]: Start accepts. Operand has 98 places, 589 transitions, 9433 flow [2022-12-06 00:08:03,829 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:03,829 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:03,830 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 589 transitions, 9433 flow [2022-12-06 00:08:03,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 589 transitions, 9433 flow [2022-12-06 00:08:04,442 INFO L130 PetriNetUnfolder]: 5451/8125 cut-off events. [2022-12-06 00:08:04,442 INFO L131 PetriNetUnfolder]: For 27200/28917 co-relation queries the response was YES. [2022-12-06 00:08:04,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40881 conditions, 8125 events. 5451/8125 cut-off events. For 27200/28917 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 49835 event pairs, 898 based on Foata normal form. 36/7719 useless extension candidates. Maximal degree in co-relation 40148. Up to 3609 conditions per place. [2022-12-06 00:08:04,518 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 589 transitions, 9433 flow [2022-12-06 00:08:04,519 INFO L188 LiptonReduction]: Number of co-enabled transitions 2690 [2022-12-06 00:08:04,524 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:08:04,524 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 696 [2022-12-06 00:08:04,524 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 589 transitions, 9433 flow [2022-12-06 00:08:04,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:04,525 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:04,525 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:04,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 00:08:04,525 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:08:04,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:04,525 INFO L85 PathProgramCache]: Analyzing trace with hash 545984768, now seen corresponding path program 2 times [2022-12-06 00:08:04,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:04,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241924808] [2022-12-06 00:08:04,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:04,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:04,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:08:04,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:04,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241924808] [2022-12-06 00:08:04,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241924808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:04,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:04,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:08:04,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622192096] [2022-12-06 00:08:04,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:04,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:04,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:04,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:04,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:04,643 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 00:08:04,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 589 transitions, 9433 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:04,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:04,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 00:08:04,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:06,717 INFO L130 PetriNetUnfolder]: 16215/21210 cut-off events. [2022-12-06 00:08:06,717 INFO L131 PetriNetUnfolder]: For 95998/95998 co-relation queries the response was YES. [2022-12-06 00:08:06,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110872 conditions, 21210 events. 16215/21210 cut-off events. For 95998/95998 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 99871 event pairs, 4858 based on Foata normal form. 252/21462 useless extension candidates. Maximal degree in co-relation 99032. Up to 20989 conditions per place. [2022-12-06 00:08:06,832 INFO L137 encePairwiseOnDemand]: 41/53 looper letters, 387 selfloop transitions, 7 changer transitions 22/416 dead transitions. [2022-12-06 00:08:06,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 416 transitions, 6837 flow [2022-12-06 00:08:06,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:06,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:06,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-06 00:08:06,833 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3584905660377358 [2022-12-06 00:08:06,833 INFO L175 Difference]: Start difference. First operand has 98 places, 589 transitions, 9433 flow. Second operand 4 states and 76 transitions. [2022-12-06 00:08:06,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 416 transitions, 6837 flow [2022-12-06 00:08:07,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 416 transitions, 6399 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-06 00:08:07,040 INFO L231 Difference]: Finished difference. Result has 96 places, 385 transitions, 5356 flow [2022-12-06 00:08:07,040 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=5407, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=5356, PETRI_PLACES=96, PETRI_TRANSITIONS=385} [2022-12-06 00:08:07,040 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 39 predicate places. [2022-12-06 00:08:07,040 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:07,040 INFO L89 Accepts]: Start accepts. Operand has 96 places, 385 transitions, 5356 flow [2022-12-06 00:08:07,041 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:07,041 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:07,042 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 385 transitions, 5356 flow [2022-12-06 00:08:07,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 385 transitions, 5356 flow [2022-12-06 00:08:07,436 INFO L130 PetriNetUnfolder]: 3881/5975 cut-off events. [2022-12-06 00:08:07,436 INFO L131 PetriNetUnfolder]: For 16724/18128 co-relation queries the response was YES. [2022-12-06 00:08:07,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24896 conditions, 5975 events. 3881/5975 cut-off events. For 16724/18128 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 37190 event pairs, 791 based on Foata normal form. 32/5571 useless extension candidates. Maximal degree in co-relation 24215. Up to 3081 conditions per place. [2022-12-06 00:08:07,559 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 385 transitions, 5356 flow [2022-12-06 00:08:07,559 INFO L188 LiptonReduction]: Number of co-enabled transitions 1674 [2022-12-06 00:08:07,563 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [719] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_97 (+ v_~t~0_235 1)) (= v_~t~0_233 (+ v_~t~0_235 2)) (= v_~t~0_235 v_~m1~0_141)) InVars {~t~0=v_~t~0_235} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_29|, ~m6~0=v_~m6~0_97, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_9|, ~m1~0=v_~m1~0_141, ~t~0=v_~t~0_233} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~m1~0, ~t~0] and [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] [2022-12-06 00:08:07,639 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [719] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_97 (+ v_~t~0_235 1)) (= v_~t~0_233 (+ v_~t~0_235 2)) (= v_~t~0_235 v_~m1~0_141)) InVars {~t~0=v_~t~0_235} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_29|, ~m6~0=v_~m6~0_97, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_9|, ~m1~0=v_~m1~0_141, ~t~0=v_~t~0_233} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~m1~0, ~t~0] and [711] L45-->thread6EXIT: Formula: (let ((.cse0 (= v_~x~0_260 1))) (and (not (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= (+ v_~s~0_805 1) v_~s~0_804) (= |v_thread6Thread1of1ForFork0_#res#1.offset_57| 0) .cse0 (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_45| |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45|) (= |v_thread6Thread1of1ForFork0_#res#1.base_57| 0) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_57| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_57| (ite (<= v_~m1~0_123 v_~s~0_805) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_57| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_57|) (= v_~b~0_389 (ite (= (ite (or .cse0 (not (= (mod v_~b~0_390 256) 0))) 1 0) 0) 0 1)) (= (ite (<= v_~m6~0_95 v_~s~0_805) 1 0) |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45|))) InVars {~b~0=v_~b~0_390, ~m6~0=v_~m6~0_95, ~m1~0=v_~m1~0_123, ~s~0=v_~s~0_805} OutVars{thread6Thread1of1ForFork0_#res#1.base=|v_thread6Thread1of1ForFork0_#res#1.base_57|, ~b~0=v_~b~0_389, ~m6~0=v_~m6~0_95, thread6Thread1of1ForFork0_#t~post12#1=|v_thread6Thread1of1ForFork0_#t~post12#1_61|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_57|, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_45|, ~m1~0=v_~m1~0_123, thread6Thread1of1ForFork0_#res#1.offset=|v_thread6Thread1of1ForFork0_#res#1.offset_57|, ~x~0=v_~x~0_260, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45|, ~s~0=v_~s~0_804, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_57|} AuxVars[] AssignedVars[thread6Thread1of1ForFork0_#res#1.base, ~b~0, thread6Thread1of1ForFork0_#t~post12#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork0_#res#1.offset, ~x~0, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 00:08:07,779 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [719] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_97 (+ v_~t~0_235 1)) (= v_~t~0_233 (+ v_~t~0_235 2)) (= v_~t~0_235 v_~m1~0_141)) InVars {~t~0=v_~t~0_235} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_29|, ~m6~0=v_~m6~0_97, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_9|, ~m1~0=v_~m1~0_141, ~t~0=v_~t~0_233} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~m1~0, ~t~0] and [535] $Ultimate##0-->L105: Formula: (and (= v_~m4~0_7 v_~t~0_77) (= v_~t~0_76 (+ v_~t~0_77 1))) InVars {~t~0=v_~t~0_77} OutVars{thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, ~m4~0=v_~m4~0_7, ~t~0=v_~t~0_76} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post7#1, ~m4~0, ~t~0] [2022-12-06 00:08:07,799 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [719] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_97 (+ v_~t~0_235 1)) (= v_~t~0_233 (+ v_~t~0_235 2)) (= v_~t~0_235 v_~m1~0_141)) InVars {~t~0=v_~t~0_235} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_29|, ~m6~0=v_~m6~0_97, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_9|, ~m1~0=v_~m1~0_141, ~t~0=v_~t~0_233} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~m1~0, ~t~0] and [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] [2022-12-06 00:08:07,820 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [719] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_97 (+ v_~t~0_235 1)) (= v_~t~0_233 (+ v_~t~0_235 2)) (= v_~t~0_235 v_~m1~0_141)) InVars {~t~0=v_~t~0_235} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_29|, ~m6~0=v_~m6~0_97, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_9|, ~m1~0=v_~m1~0_141, ~t~0=v_~t~0_233} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~m1~0, ~t~0] and [541] $Ultimate##0-->L124: Formula: (and (= (+ v_~t~0_69 1) v_~t~0_68) (= v_~m5~0_9 v_~t~0_69)) InVars {~t~0=v_~t~0_69} OutVars{thread5Thread1of1ForFork4_#t~post9#1=|v_thread5Thread1of1ForFork4_#t~post9#1_1|, ~m5~0=v_~m5~0_9, ~t~0=v_~t~0_68} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_#t~post9#1, ~m5~0, ~t~0] [2022-12-06 00:08:07,846 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:08:07,847 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 807 [2022-12-06 00:08:07,847 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 384 transitions, 5376 flow [2022-12-06 00:08:07,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:07,847 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:07,847 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:07,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 00:08:07,848 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:08:07,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:07,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1239498762, now seen corresponding path program 1 times [2022-12-06 00:08:07,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:07,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216304274] [2022-12-06 00:08:07,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:07,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:07,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:08:07,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:07,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216304274] [2022-12-06 00:08:07,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216304274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:07,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:07,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:08:07,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631305701] [2022-12-06 00:08:07,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:07,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:07,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:07,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:07,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:07,988 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 00:08:07,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 384 transitions, 5376 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:07,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:07,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 00:08:07,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:09,223 INFO L130 PetriNetUnfolder]: 10886/14227 cut-off events. [2022-12-06 00:08:09,223 INFO L131 PetriNetUnfolder]: For 63260/63260 co-relation queries the response was YES. [2022-12-06 00:08:09,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63731 conditions, 14227 events. 10886/14227 cut-off events. For 63260/63260 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 61986 event pairs, 4682 based on Foata normal form. 198/14425 useless extension candidates. Maximal degree in co-relation 63715. Up to 14065 conditions per place. [2022-12-06 00:08:09,298 INFO L137 encePairwiseOnDemand]: 39/55 looper letters, 60 selfloop transitions, 6 changer transitions 19/85 dead transitions. [2022-12-06 00:08:09,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 85 transitions, 750 flow [2022-12-06 00:08:09,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:09,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:09,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-06 00:08:09,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34545454545454546 [2022-12-06 00:08:09,299 INFO L175 Difference]: Start difference. First operand has 91 places, 384 transitions, 5376 flow. Second operand 4 states and 76 transitions. [2022-12-06 00:08:09,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 85 transitions, 750 flow [2022-12-06 00:08:09,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 85 transitions, 666 flow, removed 12 selfloop flow, removed 9 redundant places. [2022-12-06 00:08:09,490 INFO L231 Difference]: Finished difference. Result has 80 places, 57 transitions, 310 flow [2022-12-06 00:08:09,490 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=310, PETRI_PLACES=80, PETRI_TRANSITIONS=57} [2022-12-06 00:08:09,490 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 23 predicate places. [2022-12-06 00:08:09,490 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:09,491 INFO L89 Accepts]: Start accepts. Operand has 80 places, 57 transitions, 310 flow [2022-12-06 00:08:09,491 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:09,491 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:09,491 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 57 transitions, 310 flow [2022-12-06 00:08:09,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 57 transitions, 310 flow [2022-12-06 00:08:09,661 INFO L130 PetriNetUnfolder]: 1885/3131 cut-off events. [2022-12-06 00:08:09,662 INFO L131 PetriNetUnfolder]: For 4531/5941 co-relation queries the response was YES. [2022-12-06 00:08:09,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9303 conditions, 3131 events. 1885/3131 cut-off events. For 4531/5941 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 20514 event pairs, 716 based on Foata normal form. 32/2711 useless extension candidates. Maximal degree in co-relation 8767. Up to 2276 conditions per place. [2022-12-06 00:08:09,687 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 57 transitions, 310 flow [2022-12-06 00:08:09,687 INFO L188 LiptonReduction]: Number of co-enabled transitions 586 [2022-12-06 00:08:09,689 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:08:09,690 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-06 00:08:09,690 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 310 flow [2022-12-06 00:08:09,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:09,690 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:09,690 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:09,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 00:08:09,690 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:08:09,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:09,690 INFO L85 PathProgramCache]: Analyzing trace with hash -781022548, now seen corresponding path program 3 times [2022-12-06 00:08:09,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:09,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720545050] [2022-12-06 00:08:09,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:09,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:09,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:09,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:08:09,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:09,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720545050] [2022-12-06 00:08:09,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720545050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:09,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:09,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:08:09,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896123431] [2022-12-06 00:08:09,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:09,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:08:09,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:09,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:08:09,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:08:09,902 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 00:08:09,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 310 flow. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:09,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:09,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 00:08:09,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:11,212 INFO L130 PetriNetUnfolder]: 14069/18068 cut-off events. [2022-12-06 00:08:11,212 INFO L131 PetriNetUnfolder]: For 50454/50454 co-relation queries the response was YES. [2022-12-06 00:08:11,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75934 conditions, 18068 events. 14069/18068 cut-off events. For 50454/50454 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 80062 event pairs, 1388 based on Foata normal form. 470/18538 useless extension candidates. Maximal degree in co-relation 48138. Up to 15112 conditions per place. [2022-12-06 00:08:11,301 INFO L137 encePairwiseOnDemand]: 24/47 looper letters, 109 selfloop transitions, 68 changer transitions 0/177 dead transitions. [2022-12-06 00:08:11,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 177 transitions, 1304 flow [2022-12-06 00:08:11,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:08:11,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:08:11,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions. [2022-12-06 00:08:11,302 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4601063829787234 [2022-12-06 00:08:11,302 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 310 flow. Second operand 8 states and 173 transitions. [2022-12-06 00:08:11,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 177 transitions, 1304 flow [2022-12-06 00:08:11,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 177 transitions, 1198 flow, removed 44 selfloop flow, removed 5 redundant places. [2022-12-06 00:08:11,336 INFO L231 Difference]: Finished difference. Result has 63 places, 109 transitions, 853 flow [2022-12-06 00:08:11,336 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=853, PETRI_PLACES=63, PETRI_TRANSITIONS=109} [2022-12-06 00:08:11,336 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2022-12-06 00:08:11,336 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:11,336 INFO L89 Accepts]: Start accepts. Operand has 63 places, 109 transitions, 853 flow [2022-12-06 00:08:11,337 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:11,337 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:11,337 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 109 transitions, 853 flow [2022-12-06 00:08:11,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 109 transitions, 853 flow [2022-12-06 00:08:11,603 INFO L130 PetriNetUnfolder]: 3081/4609 cut-off events. [2022-12-06 00:08:11,604 INFO L131 PetriNetUnfolder]: For 10797/15783 co-relation queries the response was YES. [2022-12-06 00:08:11,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18201 conditions, 4609 events. 3081/4609 cut-off events. For 10797/15783 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 26746 event pairs, 759 based on Foata normal form. 188/4243 useless extension candidates. Maximal degree in co-relation 17663. Up to 3037 conditions per place. [2022-12-06 00:08:11,641 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 109 transitions, 853 flow [2022-12-06 00:08:11,641 INFO L188 LiptonReduction]: Number of co-enabled transitions 1182 [2022-12-06 00:08:11,650 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] and [535] $Ultimate##0-->L105: Formula: (and (= v_~m4~0_7 v_~t~0_77) (= v_~t~0_76 (+ v_~t~0_77 1))) InVars {~t~0=v_~t~0_77} OutVars{thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, ~m4~0=v_~m4~0_7, ~t~0=v_~t~0_76} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post7#1, ~m4~0, ~t~0] [2022-12-06 00:08:11,664 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] and [516] $Ultimate##0-->L45: Formula: (and (= v_~m1~0_9 v_~t~0_73) (= v_~t~0_72 (+ v_~t~0_73 1))) InVars {~t~0=v_~t~0_73} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_72} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m1~0, ~t~0] [2022-12-06 00:08:11,685 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] and [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] [2022-12-06 00:08:11,702 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] and [541] $Ultimate##0-->L124: Formula: (and (= (+ v_~t~0_69 1) v_~t~0_68) (= v_~m5~0_9 v_~t~0_69)) InVars {~t~0=v_~t~0_69} OutVars{thread5Thread1of1ForFork4_#t~post9#1=|v_thread5Thread1of1ForFork4_#t~post9#1_1|, ~m5~0=v_~m5~0_9, ~t~0=v_~t~0_68} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_#t~post9#1, ~m5~0, ~t~0] [2022-12-06 00:08:11,771 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] and [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] [2022-12-06 00:08:11,790 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:11,791 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 455 [2022-12-06 00:08:11,791 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 108 transitions, 870 flow [2022-12-06 00:08:11,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:11,791 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:11,791 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:11,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 00:08:11,791 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:08:11,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:11,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1292579190, now seen corresponding path program 1 times [2022-12-06 00:08:11,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:11,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371855372] [2022-12-06 00:08:11,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:11,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:11,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:08:11,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:11,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371855372] [2022-12-06 00:08:11,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371855372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:11,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:11,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:08:11,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014882296] [2022-12-06 00:08:11,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:11,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:08:11,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:11,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:08:11,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:08:11,946 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 00:08:11,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 108 transitions, 870 flow. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:11,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:11,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 00:08:11,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:14,610 INFO L130 PetriNetUnfolder]: 29728/38221 cut-off events. [2022-12-06 00:08:14,610 INFO L131 PetriNetUnfolder]: For 113234/113234 co-relation queries the response was YES. [2022-12-06 00:08:14,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179692 conditions, 38221 events. 29728/38221 cut-off events. For 113234/113234 co-relation queries the response was YES. Maximal size of possible extension queue 1517. Compared 190067 event pairs, 2517 based on Foata normal form. 382/38603 useless extension candidates. Maximal degree in co-relation 128776. Up to 22575 conditions per place. [2022-12-06 00:08:14,861 INFO L137 encePairwiseOnDemand]: 25/53 looper letters, 119 selfloop transitions, 213 changer transitions 0/332 dead transitions. [2022-12-06 00:08:14,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 332 transitions, 3130 flow [2022-12-06 00:08:14,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:08:14,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:08:14,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 198 transitions. [2022-12-06 00:08:14,862 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5336927223719676 [2022-12-06 00:08:14,862 INFO L175 Difference]: Start difference. First operand has 62 places, 108 transitions, 870 flow. Second operand 7 states and 198 transitions. [2022-12-06 00:08:14,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 332 transitions, 3130 flow [2022-12-06 00:08:15,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 332 transitions, 3009 flow, removed 55 selfloop flow, removed 2 redundant places. [2022-12-06 00:08:15,088 INFO L231 Difference]: Finished difference. Result has 69 places, 257 transitions, 2863 flow [2022-12-06 00:08:15,089 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2863, PETRI_PLACES=69, PETRI_TRANSITIONS=257} [2022-12-06 00:08:15,089 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 12 predicate places. [2022-12-06 00:08:15,089 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:15,089 INFO L89 Accepts]: Start accepts. Operand has 69 places, 257 transitions, 2863 flow [2022-12-06 00:08:15,090 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:15,090 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:15,090 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 257 transitions, 2863 flow [2022-12-06 00:08:15,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 257 transitions, 2863 flow [2022-12-06 00:08:16,010 INFO L130 PetriNetUnfolder]: 8185/11452 cut-off events. [2022-12-06 00:08:16,011 INFO L131 PetriNetUnfolder]: For 48693/92030 co-relation queries the response was YES. [2022-12-06 00:08:16,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61596 conditions, 11452 events. 8185/11452 cut-off events. For 48693/92030 co-relation queries the response was YES. Maximal size of possible extension queue 940. Compared 65722 event pairs, 758 based on Foata normal form. 6/11255 useless extension candidates. Maximal degree in co-relation 60857. Up to 7527 conditions per place. [2022-12-06 00:08:16,125 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 257 transitions, 2863 flow [2022-12-06 00:08:16,125 INFO L188 LiptonReduction]: Number of co-enabled transitions 2162 [2022-12-06 00:08:16,135 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:08:16,135 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1046 [2022-12-06 00:08:16,135 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 257 transitions, 2863 flow [2022-12-06 00:08:16,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:16,135 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:16,136 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:16,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 00:08:16,136 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:08:16,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:16,136 INFO L85 PathProgramCache]: Analyzing trace with hash 321641492, now seen corresponding path program 1 times [2022-12-06 00:08:16,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:16,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749285506] [2022-12-06 00:08:16,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:16,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:16,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:08:16,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:16,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749285506] [2022-12-06 00:08:16,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749285506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:16,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:16,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:08:16,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391506601] [2022-12-06 00:08:16,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:16,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:08:16,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:16,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:08:16,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:08:16,252 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 00:08:16,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 257 transitions, 2863 flow. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:16,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:16,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 00:08:16,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:21,239 INFO L130 PetriNetUnfolder]: 42521/55116 cut-off events. [2022-12-06 00:08:21,239 INFO L131 PetriNetUnfolder]: For 240549/240549 co-relation queries the response was YES. [2022-12-06 00:08:21,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328360 conditions, 55116 events. 42521/55116 cut-off events. For 240549/240549 co-relation queries the response was YES. Maximal size of possible extension queue 2210. Compared 290837 event pairs, 4205 based on Foata normal form. 1100/56216 useless extension candidates. Maximal degree in co-relation 231724. Up to 32998 conditions per place. [2022-12-06 00:08:21,634 INFO L137 encePairwiseOnDemand]: 25/53 looper letters, 172 selfloop transitions, 318 changer transitions 0/490 dead transitions. [2022-12-06 00:08:21,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 490 transitions, 6084 flow [2022-12-06 00:08:21,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:08:21,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:08:21,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 167 transitions. [2022-12-06 00:08:21,636 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5251572327044025 [2022-12-06 00:08:21,636 INFO L175 Difference]: Start difference. First operand has 69 places, 257 transitions, 2863 flow. Second operand 6 states and 167 transitions. [2022-12-06 00:08:21,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 490 transitions, 6084 flow [2022-12-06 00:08:24,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 490 transitions, 5722 flow, removed 181 selfloop flow, removed 0 redundant places. [2022-12-06 00:08:24,021 INFO L231 Difference]: Finished difference. Result has 77 places, 419 transitions, 5715 flow [2022-12-06 00:08:24,021 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2657, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5715, PETRI_PLACES=77, PETRI_TRANSITIONS=419} [2022-12-06 00:08:24,022 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places. [2022-12-06 00:08:24,022 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:24,022 INFO L89 Accepts]: Start accepts. Operand has 77 places, 419 transitions, 5715 flow [2022-12-06 00:08:24,023 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:24,023 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:24,023 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 419 transitions, 5715 flow [2022-12-06 00:08:24,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 419 transitions, 5715 flow [2022-12-06 00:08:25,326 INFO L130 PetriNetUnfolder]: 11631/16313 cut-off events. [2022-12-06 00:08:25,326 INFO L131 PetriNetUnfolder]: For 79339/111564 co-relation queries the response was YES. [2022-12-06 00:08:25,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95016 conditions, 16313 events. 11631/16313 cut-off events. For 79339/111564 co-relation queries the response was YES. Maximal size of possible extension queue 1344. Compared 97328 event pairs, 937 based on Foata normal form. 16/16032 useless extension candidates. Maximal degree in co-relation 94126. Up to 8980 conditions per place. [2022-12-06 00:08:25,461 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 419 transitions, 5715 flow [2022-12-06 00:08:25,461 INFO L188 LiptonReduction]: Number of co-enabled transitions 3446 [2022-12-06 00:08:25,487 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [691] L105-->thread4EXIT: Formula: (and (= v_~b~0_281 (ite (= (ite (or (not (= (mod v_~b~0_282 256) 0)) (= v_~x~0_191 1)) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| 0)) (= (+ v_~s~0_685 1) v_~s~0_684) (= |v_thread4Thread1of1ForFork2_#res#1.base_25| 0) (= |v_thread4Thread1of1ForFork2_#res#1.offset_25| 0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m4~0_71 v_~s~0_685) 1 0))) InVars {~b~0=v_~b~0_282, ~m4~0=v_~m4~0_71, ~x~0=v_~x~0_191, ~s~0=v_~s~0_685} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_25|, ~b~0=v_~b~0_281, ~m4~0=v_~m4~0_71, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_55|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, ~x~0=v_~x~0_191, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_25|, ~s~0=v_~s~0_684} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, ~b~0, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#res#1.offset, ~s~0] [2022-12-06 00:08:25,534 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [704] L45-->thread1EXIT: Formula: (and (= |v_thread3Thread1of1ForFork5_#res#1.offset_17| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_57| 0) (= |v_thread3Thread1of1ForFork5_#res#1.base_17| 0) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_49| |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_49|) (= v_~x~0_236 0) (= v_~b~0_361 1) (not (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_49| 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_43| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_43|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_57| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43| (ite (<= v_~m1~0_109 v_~s~0_768) 1 0)) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_49| (ite (<= v_~m3~0_97 v_~s~0_768) 1 0)) (= v_~s~0_766 (+ 2 v_~s~0_768))) InVars {~m3~0=v_~m3~0_97, ~m1~0=v_~m1~0_109, ~s~0=v_~s~0_768} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_59|, thread3Thread1of1ForFork5_#t~post6#1=|v_thread3Thread1of1ForFork5_#t~post6#1_69|, ~m3~0=v_~m3~0_97, thread3Thread1of1ForFork5_#res#1.base=|v_thread3Thread1of1ForFork5_#res#1.base_17|, ~b~0=v_~b~0_361, thread3Thread1of1ForFork5_#res#1.offset=|v_thread3Thread1of1ForFork5_#res#1.offset_17|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43|, ~m1~0=v_~m1~0_109, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_49|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_57|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_57|, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_49|, ~x~0=v_~x~0_236, ~s~0=v_~s~0_766, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_43|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread3Thread1of1ForFork5_#t~post6#1, thread3Thread1of1ForFork5_#res#1.base, ~b~0, thread3Thread1of1ForFork5_#res#1.offset, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 00:08:25,611 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [706] L45-->thread1EXIT: Formula: (and (= v_~b~0_369 1) (= |v_thread1Thread1of1ForFork1_#res#1.offset_61| 0) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_47| 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_47| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_47|) (= |v_thread1Thread1of1ForFork1_#res#1.base_61| 0) (= |v_thread4Thread1of1ForFork2_#res#1.base_31| 0) (= |v_thread4Thread1of1ForFork2_#res#1.offset_31| 0) (= (+ 2 v_~s~0_780) v_~s~0_778) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47| (ite (<= v_~m1~0_113 v_~s~0_780) 1 0)) (= v_~x~0_244 0) (= (ite (<= v_~m4~0_93 v_~s~0_780) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_47|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|)) InVars {~m4~0=v_~m4~0_93, ~m1~0=v_~m1~0_113, ~s~0=v_~s~0_780} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_63|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_47|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_31|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_47|, ~b~0=v_~b~0_369, ~m4~0=v_~m4~0_93, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_61|, ~m1~0=v_~m1~0_113, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_61|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_61|, ~x~0=v_~x~0_244, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_31|, ~s~0=v_~s~0_778, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#t~post8#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, thread4Thread1of1ForFork2_#res#1.offset, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 00:08:25,697 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [675] L86-->thread3EXIT: Formula: (and (= (+ v_~s~0_637 1) v_~s~0_636) (= v_~b~0_239 (ite (= (ite (or (not (= (mod v_~b~0_240 256) 0)) (= v_~x~0_163 1)) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork5_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_39| |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_39|) (not (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_39| 0)) (= |v_thread3Thread1of1ForFork5_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_39| (ite (<= v_~m3~0_65 v_~s~0_637) 1 0))) InVars {~m3~0=v_~m3~0_65, ~b~0=v_~b~0_240, ~x~0=v_~x~0_163, ~s~0=v_~s~0_637} OutVars{~m3~0=v_~m3~0_65, thread3Thread1of1ForFork5_#res#1.base=|v_thread3Thread1of1ForFork5_#res#1.base_7|, ~b~0=v_~b~0_239, thread3Thread1of1ForFork5_#res#1.offset=|v_thread3Thread1of1ForFork5_#res#1.offset_7|, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_39|, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_39|, thread3Thread1of1ForFork5_#t~post6#1=|v_thread3Thread1of1ForFork5_#t~post6#1_59|, ~x~0=v_~x~0_163, ~s~0=v_~s~0_636} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_#res#1.base, ~b~0, thread3Thread1of1ForFork5_#res#1.offset, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork5_#t~post6#1, ~s~0] [2022-12-06 00:08:25,752 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [708] L45-->thread1EXIT: Formula: (and (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_43| |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_43|) (= (ite (<= v_~m1~0_117 v_~s~0_792) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (= (+ 2 v_~s~0_792) v_~s~0_790) (= |v_thread1Thread1of1ForFork1_#res#1.offset_65| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_65| 0) (= |v_thread5Thread1of1ForFork4_#res#1.base_41| 0) (= v_~x~0_252 0) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_51| 0)) (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_43| (ite (<= v_~m5~0_101 v_~s~0_792) 1 0)) (not (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_43| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_51|) (= v_~b~0_377 1) (= |v_thread5Thread1of1ForFork4_#res#1.offset_41| 0)) InVars {~m5~0=v_~m5~0_101, ~m1~0=v_~m1~0_117, ~s~0=v_~s~0_792} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_67|, thread5Thread1of1ForFork4_#res#1.offset=|v_thread5Thread1of1ForFork4_#res#1.offset_41|, thread5Thread1of1ForFork4_#res#1.base=|v_thread5Thread1of1ForFork4_#res#1.base_41|, thread5Thread1of1ForFork4_#t~post10#1=|v_thread5Thread1of1ForFork4_#t~post10#1_51|, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_43|, thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_43|, ~b~0=v_~b~0_377, ~m5~0=v_~m5~0_101, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, ~m1~0=v_~m1~0_117, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_65|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_65|, ~x~0=v_~x~0_252, ~s~0=v_~s~0_790, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread5Thread1of1ForFork4_#res#1.offset, thread5Thread1of1ForFork4_#res#1.base, thread5Thread1of1ForFork4_#t~post10#1, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 00:08:25,836 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [661] L124-->thread5EXIT: Formula: (and (= |v_thread5Thread1of1ForFork4_#res#1.offset_29| 0) (not (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| 0)) (= v_~b~0_189 (ite (= (ite (or (= v_~x~0_136 1) (not (= (mod v_~b~0_190 256) 0))) 1 0) 0) 0 1)) (= |v_thread5Thread1of1ForFork4_#res#1.base_29| 0) (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (ite (<= v_~m5~0_59 v_~s~0_585) 1 0) |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (+ v_~s~0_585 1) v_~s~0_584)) InVars {~b~0=v_~b~0_190, ~m5~0=v_~m5~0_59, ~x~0=v_~x~0_136, ~s~0=v_~s~0_585} OutVars{thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|, thread5Thread1of1ForFork4_#res#1.offset=|v_thread5Thread1of1ForFork4_#res#1.offset_29|, ~b~0=v_~b~0_189, ~m5~0=v_~m5~0_59, thread5Thread1of1ForFork4_#res#1.base=|v_thread5Thread1of1ForFork4_#res#1.base_29|, thread5Thread1of1ForFork4_#t~post10#1=|v_thread5Thread1of1ForFork4_#t~post10#1_39|, ~x~0=v_~x~0_136, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31|, ~s~0=v_~s~0_584} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork4_#res#1.offset, ~b~0, thread5Thread1of1ForFork4_#res#1.base, thread5Thread1of1ForFork4_#t~post10#1, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:08:25,886 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-06 00:08:25,933 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [707] L45-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_63| 0) (= (+ 2 v_~s~0_786) v_~s~0_784) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread2Thread1of1ForFork3_#res#1.offset_65| 0) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_51| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_51|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_63| 0) (= v_~b~0_373 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49| (ite (<= v_~m1~0_115 v_~s~0_786) 1 0)) (= (ite (<= v_~m2~0_105 v_~s~0_786) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_51|) (= |v_thread2Thread1of1ForFork3_#res#1.base_65| 0) (= v_~x~0_248 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_51| 0))) InVars {~m2~0=v_~m2~0_105, ~m1~0=v_~m1~0_115, ~s~0=v_~s~0_786} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_65|, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_77|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_65|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_65|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_51|, ~b~0=v_~b~0_373, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|, ~m2~0=v_~m2~0_105, ~m1~0=v_~m1~0_115, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_63|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_63|, ~x~0=v_~x~0_248, ~s~0=v_~s~0_784, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 00:08:26,012 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [586] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_29| 0) (= v_~x~0_14 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_29| 0) (= (+ v_~s~0_179 1) v_~s~0_178)) InVars {~s~0=v_~s~0_179} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_31|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_29|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_29|, ~x~0=v_~x~0_14, ~s~0=v_~s~0_178} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0] [2022-12-06 00:08:26,205 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:26,206 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2184 [2022-12-06 00:08:26,206 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 419 transitions, 5769 flow [2022-12-06 00:08:26,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:26,206 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:26,206 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:26,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 00:08:26,207 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:08:26,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:26,207 INFO L85 PathProgramCache]: Analyzing trace with hash -2076990970, now seen corresponding path program 2 times [2022-12-06 00:08:26,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:26,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063496314] [2022-12-06 00:08:26,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:26,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:26,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:08:26,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:26,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063496314] [2022-12-06 00:08:26,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063496314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:26,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:26,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:08:26,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903594694] [2022-12-06 00:08:26,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:26,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:08:26,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:26,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:08:26,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:08:26,339 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-06 00:08:26,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 419 transitions, 5769 flow. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:26,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:26,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-06 00:08:26,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:32,898 INFO L130 PetriNetUnfolder]: 48842/64027 cut-off events. [2022-12-06 00:08:32,898 INFO L131 PetriNetUnfolder]: For 336745/336745 co-relation queries the response was YES. [2022-12-06 00:08:33,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401644 conditions, 64027 events. 48842/64027 cut-off events. For 336745/336745 co-relation queries the response was YES. Maximal size of possible extension queue 2705. Compared 357807 event pairs, 3915 based on Foata normal form. 3260/67287 useless extension candidates. Maximal degree in co-relation 291507. Up to 30953 conditions per place. [2022-12-06 00:08:33,431 INFO L137 encePairwiseOnDemand]: 25/62 looper letters, 164 selfloop transitions, 652 changer transitions 0/816 dead transitions. [2022-12-06 00:08:33,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 816 transitions, 11940 flow [2022-12-06 00:08:33,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 00:08:33,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 00:08:33,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 294 transitions. [2022-12-06 00:08:33,434 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47419354838709676 [2022-12-06 00:08:33,434 INFO L175 Difference]: Start difference. First operand has 77 places, 419 transitions, 5769 flow. Second operand 10 states and 294 transitions. [2022-12-06 00:08:33,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 816 transitions, 11940 flow [2022-12-06 00:08:37,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 816 transitions, 11885 flow, removed 20 selfloop flow, removed 1 redundant places. [2022-12-06 00:08:37,128 INFO L231 Difference]: Finished difference. Result has 88 places, 702 transitions, 11724 flow [2022-12-06 00:08:37,128 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=5598, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=360, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11724, PETRI_PLACES=88, PETRI_TRANSITIONS=702} [2022-12-06 00:08:37,129 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places. [2022-12-06 00:08:37,129 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:37,129 INFO L89 Accepts]: Start accepts. Operand has 88 places, 702 transitions, 11724 flow [2022-12-06 00:08:37,131 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:37,131 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:37,131 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 702 transitions, 11724 flow [2022-12-06 00:08:37,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 702 transitions, 11724 flow [2022-12-06 00:08:39,167 INFO L130 PetriNetUnfolder]: 13354/19019 cut-off events. [2022-12-06 00:08:39,167 INFO L131 PetriNetUnfolder]: For 128071/211613 co-relation queries the response was YES. [2022-12-06 00:08:39,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133737 conditions, 19019 events. 13354/19019 cut-off events. For 128071/211613 co-relation queries the response was YES. Maximal size of possible extension queue 1606. Compared 119720 event pairs, 1028 based on Foata normal form. 32/18744 useless extension candidates. Maximal degree in co-relation 132703. Up to 10572 conditions per place. [2022-12-06 00:08:39,342 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 702 transitions, 11724 flow [2022-12-06 00:08:39,343 INFO L188 LiptonReduction]: Number of co-enabled transitions 5104 [2022-12-06 00:08:39,372 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [586] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_29| 0) (= v_~x~0_14 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_29| 0) (= (+ v_~s~0_179 1) v_~s~0_178)) InVars {~s~0=v_~s~0_179} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_31|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_29|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_29|, ~x~0=v_~x~0_14, ~s~0=v_~s~0_178} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0] [2022-12-06 00:08:39,394 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [586] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_29| 0) (= v_~x~0_14 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_29| 0) (= (+ v_~s~0_179 1) v_~s~0_178)) InVars {~s~0=v_~s~0_179} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_31|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_29|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_29|, ~x~0=v_~x~0_14, ~s~0=v_~s~0_178} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0] [2022-12-06 00:08:39,417 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [707] L45-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_63| 0) (= (+ 2 v_~s~0_786) v_~s~0_784) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread2Thread1of1ForFork3_#res#1.offset_65| 0) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_51| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_51|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_63| 0) (= v_~b~0_373 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49| (ite (<= v_~m1~0_115 v_~s~0_786) 1 0)) (= (ite (<= v_~m2~0_105 v_~s~0_786) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_51|) (= |v_thread2Thread1of1ForFork3_#res#1.base_65| 0) (= v_~x~0_248 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_51| 0))) InVars {~m2~0=v_~m2~0_105, ~m1~0=v_~m1~0_115, ~s~0=v_~s~0_786} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_65|, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_77|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_65|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_65|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_51|, ~b~0=v_~b~0_373, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|, ~m2~0=v_~m2~0_105, ~m1~0=v_~m1~0_115, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_63|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_63|, ~x~0=v_~x~0_248, ~s~0=v_~s~0_784, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 00:08:39,495 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-06 00:08:39,545 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-06 00:08:39,593 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [707] L45-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_63| 0) (= (+ 2 v_~s~0_786) v_~s~0_784) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread2Thread1of1ForFork3_#res#1.offset_65| 0) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_51| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_51|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_63| 0) (= v_~b~0_373 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49| (ite (<= v_~m1~0_115 v_~s~0_786) 1 0)) (= (ite (<= v_~m2~0_105 v_~s~0_786) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_51|) (= |v_thread2Thread1of1ForFork3_#res#1.base_65| 0) (= v_~x~0_248 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_51| 0))) InVars {~m2~0=v_~m2~0_105, ~m1~0=v_~m1~0_115, ~s~0=v_~s~0_786} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_65|, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_77|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_65|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_65|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_51|, ~b~0=v_~b~0_373, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|, ~m2~0=v_~m2~0_105, ~m1~0=v_~m1~0_115, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_63|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_63|, ~x~0=v_~x~0_248, ~s~0=v_~s~0_784, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 00:08:39,673 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-06 00:08:39,720 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [691] L105-->thread4EXIT: Formula: (and (= v_~b~0_281 (ite (= (ite (or (not (= (mod v_~b~0_282 256) 0)) (= v_~x~0_191 1)) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| 0)) (= (+ v_~s~0_685 1) v_~s~0_684) (= |v_thread4Thread1of1ForFork2_#res#1.base_25| 0) (= |v_thread4Thread1of1ForFork2_#res#1.offset_25| 0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m4~0_71 v_~s~0_685) 1 0))) InVars {~b~0=v_~b~0_282, ~m4~0=v_~m4~0_71, ~x~0=v_~x~0_191, ~s~0=v_~s~0_685} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_25|, ~b~0=v_~b~0_281, ~m4~0=v_~m4~0_71, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_55|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, ~x~0=v_~x~0_191, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_25|, ~s~0=v_~s~0_684} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, ~b~0, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#res#1.offset, ~s~0] [2022-12-06 00:08:39,767 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [713] L45-->thread2EXIT: Formula: (let ((.cse0 (= v_~x~0_264 1))) (and (= v_~b~0_397 (ite (= (ite (or .cse0 (not (= (mod v_~b~0_398 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork3_#res#1.base_67| 0) .cse0 (= |v_thread2Thread1of1ForFork3_#res#1.offset_67| 0) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_53| 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_61| 0)) (= v_~s~0_812 (+ v_~s~0_813 1)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61| (ite (<= v_~m1~0_127 v_~s~0_813) 1 0)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_53| (ite (<= v_~m2~0_107 v_~s~0_813) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_61|) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_53| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_53|))) InVars {~b~0=v_~b~0_398, ~m2~0=v_~m2~0_107, ~m1~0=v_~m1~0_127, ~s~0=v_~s~0_813} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_79|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_53|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_67|, ~b~0=v_~b~0_397, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61|, ~m2~0=v_~m2~0_107, ~m1~0=v_~m1~0_127, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_53|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_67|, ~x~0=v_~x~0_264, ~s~0=v_~s~0_812, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_61|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 00:08:39,838 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [712] L45-->thread4EXIT: Formula: (let ((.cse0 (= v_~x~0_262 1))) (and (= |v_thread4Thread1of1ForFork2_#res#1.offset_33| 0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_49| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (ite (<= v_~m1~0_125 v_~s~0_809) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|) .cse0 (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_49| 0)) (= v_~b~0_393 (ite (= (ite (or .cse0 (not (= (mod v_~b~0_394 256) 0))) 1 0) 0) 0 1)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_59| 0)) (= (ite (<= v_~m4~0_95 v_~s~0_809) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (+ v_~s~0_809 1) v_~s~0_808) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_59|) (= |v_thread4Thread1of1ForFork2_#res#1.base_33| 0))) InVars {~b~0=v_~b~0_394, ~m4~0=v_~m4~0_95, ~m1~0=v_~m1~0_125, ~s~0=v_~s~0_809} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_49|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_33|, ~b~0=v_~b~0_393, ~m4~0=v_~m4~0_95, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_63|, ~m1~0=v_~m1~0_125, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, ~x~0=v_~x~0_262, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_33|, ~s~0=v_~s~0_808, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_59|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~x~0, thread4Thread1of1ForFork2_#res#1.offset, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 00:08:39,947 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:39,948 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2819 [2022-12-06 00:08:39,948 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 702 transitions, 11792 flow [2022-12-06 00:08:39,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:39,948 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:39,948 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:39,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 00:08:39,948 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:08:39,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:39,949 INFO L85 PathProgramCache]: Analyzing trace with hash -374080374, now seen corresponding path program 1 times [2022-12-06 00:08:39,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:39,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865875017] [2022-12-06 00:08:39,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:39,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:40,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:08:40,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:40,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865875017] [2022-12-06 00:08:40,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865875017] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:40,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:40,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:08:40,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755631748] [2022-12-06 00:08:40,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:40,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:08:40,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:40,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:08:40,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:08:40,193 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-06 00:08:40,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 702 transitions, 11792 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:40,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:40,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-06 00:08:40,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:48,463 INFO L130 PetriNetUnfolder]: 50652/66457 cut-off events. [2022-12-06 00:08:48,463 INFO L131 PetriNetUnfolder]: For 497430/497430 co-relation queries the response was YES. [2022-12-06 00:08:48,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486014 conditions, 66457 events. 50652/66457 cut-off events. For 497430/497430 co-relation queries the response was YES. Maximal size of possible extension queue 2804. Compared 371874 event pairs, 5393 based on Foata normal form. 724/67181 useless extension candidates. Maximal degree in co-relation 382355. Up to 64465 conditions per place. [2022-12-06 00:08:49,024 INFO L137 encePairwiseOnDemand]: 44/72 looper letters, 680 selfloop transitions, 244 changer transitions 0/924 dead transitions. [2022-12-06 00:08:49,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 924 transitions, 16736 flow [2022-12-06 00:08:49,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:08:49,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:08:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2022-12-06 00:08:49,026 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35119047619047616 [2022-12-06 00:08:49,026 INFO L175 Difference]: Start difference. First operand has 88 places, 702 transitions, 11792 flow. Second operand 7 states and 177 transitions. [2022-12-06 00:08:49,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 924 transitions, 16736 flow [2022-12-06 00:08:57,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 924 transitions, 16575 flow, removed 24 selfloop flow, removed 2 redundant places. [2022-12-06 00:08:57,548 INFO L231 Difference]: Finished difference. Result has 95 places, 846 transitions, 15205 flow [2022-12-06 00:08:57,548 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=11648, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=15205, PETRI_PLACES=95, PETRI_TRANSITIONS=846} [2022-12-06 00:08:57,548 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 38 predicate places. [2022-12-06 00:08:57,549 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:57,549 INFO L89 Accepts]: Start accepts. Operand has 95 places, 846 transitions, 15205 flow [2022-12-06 00:08:57,551 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:57,551 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:57,552 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 846 transitions, 15205 flow [2022-12-06 00:08:57,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 846 transitions, 15205 flow [2022-12-06 00:08:59,888 INFO L130 PetriNetUnfolder]: 13926/19865 cut-off events. [2022-12-06 00:08:59,888 INFO L131 PetriNetUnfolder]: For 152009/279347 co-relation queries the response was YES. [2022-12-06 00:08:59,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143449 conditions, 19865 events. 13926/19865 cut-off events. For 152009/279347 co-relation queries the response was YES. Maximal size of possible extension queue 1689. Compared 125990 event pairs, 1068 based on Foata normal form. 35/19576 useless extension candidates. Maximal degree in co-relation 142366. Up to 11035 conditions per place. [2022-12-06 00:09:00,074 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 846 transitions, 15205 flow [2022-12-06 00:09:00,074 INFO L188 LiptonReduction]: Number of co-enabled transitions 5692 [2022-12-06 00:09:00,080 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [736] $Ultimate##0-->L86: Formula: (and (= v_~t~0_315 (+ v_~t~0_317 2)) (= v_~t~0_317 v_~m2~0_136) (= v_~t~0_315 (+ v_~m3~0_111 1))) InVars {~t~0=v_~t~0_317} OutVars{~m3~0=v_~m3~0_111, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_38|, ~m2~0=v_~m2~0_136, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_13|, ~t~0=v_~t~0_315} AuxVars[] AssignedVars[~m3~0, thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-06 00:09:00,187 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:00,187 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2638 [2022-12-06 00:09:00,187 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 846 transitions, 15211 flow [2022-12-06 00:09:00,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:00,187 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:00,188 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:00,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 00:09:00,188 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:09:00,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:00,188 INFO L85 PathProgramCache]: Analyzing trace with hash -114305744, now seen corresponding path program 1 times [2022-12-06 00:09:00,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:00,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135224984] [2022-12-06 00:09:00,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:00,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:00,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:09:00,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:00,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135224984] [2022-12-06 00:09:00,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135224984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:00,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:00,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:00,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787695876] [2022-12-06 00:09:00,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:00,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:09:00,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:00,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:09:00,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:09:00,299 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-06 00:09:00,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 846 transitions, 15211 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:00,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:00,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-06 00:09:00,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:09,594 INFO L130 PetriNetUnfolder]: 50158/65897 cut-off events. [2022-12-06 00:09:09,595 INFO L131 PetriNetUnfolder]: For 539136/539136 co-relation queries the response was YES. [2022-12-06 00:09:09,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486746 conditions, 65897 events. 50158/65897 cut-off events. For 539136/539136 co-relation queries the response was YES. Maximal size of possible extension queue 2740. Compared 369662 event pairs, 5448 based on Foata normal form. 236/66133 useless extension candidates. Maximal degree in co-relation 430057. Up to 65050 conditions per place. [2022-12-06 00:09:10,222 INFO L137 encePairwiseOnDemand]: 51/73 looper letters, 754 selfloop transitions, 172 changer transitions 0/926 dead transitions. [2022-12-06 00:09:10,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 926 transitions, 18213 flow [2022-12-06 00:09:10,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:09:10,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:09:10,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2022-12-06 00:09:10,223 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3424657534246575 [2022-12-06 00:09:10,224 INFO L175 Difference]: Start difference. First operand has 95 places, 846 transitions, 15211 flow. Second operand 5 states and 125 transitions. [2022-12-06 00:09:10,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 926 transitions, 18213 flow [2022-12-06 00:09:19,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 926 transitions, 18125 flow, removed 36 selfloop flow, removed 1 redundant places. [2022-12-06 00:09:19,439 INFO L231 Difference]: Finished difference. Result has 99 places, 891 transitions, 16524 flow [2022-12-06 00:09:19,439 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=14665, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=824, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=716, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=16524, PETRI_PLACES=99, PETRI_TRANSITIONS=891} [2022-12-06 00:09:19,440 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 42 predicate places. [2022-12-06 00:09:19,440 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:19,440 INFO L89 Accepts]: Start accepts. Operand has 99 places, 891 transitions, 16524 flow [2022-12-06 00:09:19,442 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:19,443 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:19,443 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 891 transitions, 16524 flow [2022-12-06 00:09:19,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 891 transitions, 16524 flow [2022-12-06 00:09:22,185 INFO L130 PetriNetUnfolder]: 13768/19675 cut-off events. [2022-12-06 00:09:22,186 INFO L131 PetriNetUnfolder]: For 155438/287327 co-relation queries the response was YES. [2022-12-06 00:09:22,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142621 conditions, 19675 events. 13768/19675 cut-off events. For 155438/287327 co-relation queries the response was YES. Maximal size of possible extension queue 1682. Compared 125208 event pairs, 1052 based on Foata normal form. 38/19384 useless extension candidates. Maximal degree in co-relation 141546. Up to 10866 conditions per place. [2022-12-06 00:09:22,397 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 891 transitions, 16524 flow [2022-12-06 00:09:22,397 INFO L188 LiptonReduction]: Number of co-enabled transitions 5850 [2022-12-06 00:09:22,438 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [713] L45-->thread2EXIT: Formula: (let ((.cse0 (= v_~x~0_264 1))) (and (= v_~b~0_397 (ite (= (ite (or .cse0 (not (= (mod v_~b~0_398 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork3_#res#1.base_67| 0) .cse0 (= |v_thread2Thread1of1ForFork3_#res#1.offset_67| 0) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_53| 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_61| 0)) (= v_~s~0_812 (+ v_~s~0_813 1)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61| (ite (<= v_~m1~0_127 v_~s~0_813) 1 0)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_53| (ite (<= v_~m2~0_107 v_~s~0_813) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_61|) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_53| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_53|))) InVars {~b~0=v_~b~0_398, ~m2~0=v_~m2~0_107, ~m1~0=v_~m1~0_127, ~s~0=v_~s~0_813} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_79|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_53|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_67|, ~b~0=v_~b~0_397, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61|, ~m2~0=v_~m2~0_107, ~m1~0=v_~m1~0_127, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_53|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_67|, ~x~0=v_~x~0_264, ~s~0=v_~s~0_812, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_61|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 00:09:22,516 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-06 00:09:22,593 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [707] L45-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_63| 0) (= (+ 2 v_~s~0_786) v_~s~0_784) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread2Thread1of1ForFork3_#res#1.offset_65| 0) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_51| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_51|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_63| 0) (= v_~b~0_373 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49| (ite (<= v_~m1~0_115 v_~s~0_786) 1 0)) (= (ite (<= v_~m2~0_105 v_~s~0_786) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_51|) (= |v_thread2Thread1of1ForFork3_#res#1.base_65| 0) (= v_~x~0_248 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_51| 0))) InVars {~m2~0=v_~m2~0_105, ~m1~0=v_~m1~0_115, ~s~0=v_~s~0_786} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_65|, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_77|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_65|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_65|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_51|, ~b~0=v_~b~0_373, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|, ~m2~0=v_~m2~0_105, ~m1~0=v_~m1~0_115, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_63|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_63|, ~x~0=v_~x~0_248, ~s~0=v_~s~0_784, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 00:09:22,684 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-06 00:09:22,736 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-06 00:09:22,788 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [713] L45-->thread2EXIT: Formula: (let ((.cse0 (= v_~x~0_264 1))) (and (= v_~b~0_397 (ite (= (ite (or .cse0 (not (= (mod v_~b~0_398 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork3_#res#1.base_67| 0) .cse0 (= |v_thread2Thread1of1ForFork3_#res#1.offset_67| 0) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_53| 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_61| 0)) (= v_~s~0_812 (+ v_~s~0_813 1)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61| (ite (<= v_~m1~0_127 v_~s~0_813) 1 0)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_53| (ite (<= v_~m2~0_107 v_~s~0_813) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_61|) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_53| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_53|))) InVars {~b~0=v_~b~0_398, ~m2~0=v_~m2~0_107, ~m1~0=v_~m1~0_127, ~s~0=v_~s~0_813} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_79|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_53|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_67|, ~b~0=v_~b~0_397, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61|, ~m2~0=v_~m2~0_107, ~m1~0=v_~m1~0_127, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_53|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_67|, ~x~0=v_~x~0_264, ~s~0=v_~s~0_812, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_61|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 00:09:22,911 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:22,912 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3472 [2022-12-06 00:09:22,912 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 891 transitions, 16568 flow [2022-12-06 00:09:22,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:22,914 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:22,914 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:22,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 00:09:22,914 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:09:22,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:22,915 INFO L85 PathProgramCache]: Analyzing trace with hash -197580648, now seen corresponding path program 1 times [2022-12-06 00:09:22,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:22,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355803723] [2022-12-06 00:09:22,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:22,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:23,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:09:23,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:23,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355803723] [2022-12-06 00:09:23,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355803723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:23,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:23,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:09:23,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421026443] [2022-12-06 00:09:23,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:23,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:09:23,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:23,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:09:23,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:09:23,129 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 79 [2022-12-06 00:09:23,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 891 transitions, 16568 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:23,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:23,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 79 [2022-12-06 00:09:23,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:36,671 INFO L130 PetriNetUnfolder]: 57070/75251 cut-off events. [2022-12-06 00:09:36,672 INFO L131 PetriNetUnfolder]: For 642207/642207 co-relation queries the response was YES. [2022-12-06 00:09:37,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 565466 conditions, 75251 events. 57070/75251 cut-off events. For 642207/642207 co-relation queries the response was YES. Maximal size of possible extension queue 3167. Compared 433484 event pairs, 5583 based on Foata normal form. 674/75925 useless extension candidates. Maximal degree in co-relation 481519. Up to 64680 conditions per place. [2022-12-06 00:09:37,550 INFO L137 encePairwiseOnDemand]: 40/79 looper letters, 641 selfloop transitions, 636 changer transitions 0/1277 dead transitions. [2022-12-06 00:09:37,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 1277 transitions, 25456 flow [2022-12-06 00:09:37,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:09:37,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:09:37,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2022-12-06 00:09:37,551 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3924050632911392 [2022-12-06 00:09:37,551 INFO L175 Difference]: Start difference. First operand has 99 places, 891 transitions, 16568 flow. Second operand 6 states and 186 transitions. [2022-12-06 00:09:37,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 1277 transitions, 25456 flow [2022-12-06 00:09:51,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 1277 transitions, 25256 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 00:09:52,023 INFO L231 Difference]: Finished difference. Result has 105 places, 1211 transitions, 25076 flow [2022-12-06 00:09:52,024 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=15702, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=859, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=361, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=25076, PETRI_PLACES=105, PETRI_TRANSITIONS=1211} [2022-12-06 00:09:52,025 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 48 predicate places. [2022-12-06 00:09:52,025 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:52,025 INFO L89 Accepts]: Start accepts. Operand has 105 places, 1211 transitions, 25076 flow [2022-12-06 00:09:52,044 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:52,044 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:52,044 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 1211 transitions, 25076 flow [2022-12-06 00:09:52,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 1211 transitions, 25076 flow [2022-12-06 00:09:55,994 INFO L130 PetriNetUnfolder]: 15569/22536 cut-off events. [2022-12-06 00:09:55,994 INFO L131 PetriNetUnfolder]: For 231965/414348 co-relation queries the response was YES. [2022-12-06 00:09:56,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182365 conditions, 22536 events. 15569/22536 cut-off events. For 231965/414348 co-relation queries the response was YES. Maximal size of possible extension queue 1912. Compared 149474 event pairs, 1079 based on Foata normal form. 54/22253 useless extension candidates. Maximal degree in co-relation 181023. Up to 12613 conditions per place. [2022-12-06 00:09:56,280 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 1211 transitions, 25076 flow [2022-12-06 00:09:56,280 INFO L188 LiptonReduction]: Number of co-enabled transitions 7566 [2022-12-06 00:09:56,290 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:09:56,291 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4266 [2022-12-06 00:09:56,291 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 1211 transitions, 25076 flow [2022-12-06 00:09:56,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:56,291 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:56,291 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:56,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 00:09:56,292 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:09:56,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:56,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1713389144, now seen corresponding path program 2 times [2022-12-06 00:09:56,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:56,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853065597] [2022-12-06 00:09:56,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:56,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:56,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-06 00:09:56,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:56,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853065597] [2022-12-06 00:09:56,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853065597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:56,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:56,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:09:56,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360626598] [2022-12-06 00:09:56,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:56,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:09:56,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:56,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:09:56,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:09:56,521 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 79 [2022-12-06 00:09:56,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 1211 transitions, 25076 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:56,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:56,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 79 [2022-12-06 00:09:56,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand