/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:25:27,490 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:25:27,492 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:25:27,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:25:27,534 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:25:27,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:25:27,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:25:27,544 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:25:27,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:25:27,552 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:25:27,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:25:27,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:25:27,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:25:27,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:25:27,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:25:27,557 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:25:27,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:25:27,562 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:25:27,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:25:27,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:25:27,566 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:25:27,568 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:25:27,569 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:25:27,570 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:25:27,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:25:27,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:25:27,573 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:25:27,574 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:25:27,574 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:25:27,575 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:25:27,575 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:25:27,576 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:25:27,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:25:27,577 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:25:27,578 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:25:27,578 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:25:27,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:25:27,579 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:25:27,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:25:27,588 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:25:27,589 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:25:27,590 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:25:27,617 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:25:27,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:25:27,619 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:25:27,619 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:25:27,619 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:25:27,620 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:25:27,620 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:25:27,620 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:25:27,620 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:25:27,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:25:27,621 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:25:27,621 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:25:27,621 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:25:27,621 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:25:27,621 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:25:27,621 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:25:27,622 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:25:27,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:25:27,622 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:25:27,622 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:25:27,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:25:27,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:25:27,623 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:25:27,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:25:27,623 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:25:27,623 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:25:27,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:25:27,623 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:25:27,623 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 06:25:27,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:25:27,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:25:27,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:25:27,963 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:25:27,963 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:25:27,964 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2022-12-06 06:25:29,191 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:25:29,474 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:25:29,475 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2022-12-06 06:25:29,493 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caec51aca/5c098abe536448e6badb419f2cca44e8/FLAG060ed01f3 [2022-12-06 06:25:29,512 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caec51aca/5c098abe536448e6badb419f2cca44e8 [2022-12-06 06:25:29,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:25:29,516 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:25:29,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:25:29,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:25:29,520 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:25:29,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:25:29" (1/1) ... [2022-12-06 06:25:29,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e8672cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:29, skipping insertion in model container [2022-12-06 06:25:29,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:25:29" (1/1) ... [2022-12-06 06:25:29,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:25:29,591 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:25:29,758 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i[949,962] [2022-12-06 06:25:29,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:29,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:29,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:29,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:29,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:29,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:29,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:29,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:29,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:29,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:29,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:29,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:29,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:29,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:29,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:29,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:29,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:29,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:29,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:29,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:29,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:29,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:29,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:29,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:29,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:29,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:29,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:29,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:29,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:29,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:29,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:29,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:29,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:29,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:29,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:29,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:29,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:29,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:29,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:29,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:29,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:29,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:29,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:25:30,003 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:25:30,015 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i[949,962] [2022-12-06 06:25:30,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:30,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:30,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:30,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:30,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:30,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:30,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:30,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:30,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:30,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:30,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:30,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:30,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:30,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:30,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:30,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:30,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:30,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:30,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:30,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:30,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:30,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:30,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:30,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:30,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:30,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:30,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:30,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:30,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:30,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:30,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:30,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:30,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:30,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:30,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:30,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:30,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:30,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:30,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:30,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:30,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:30,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:30,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:25:30,143 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:25:30,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:30 WrapperNode [2022-12-06 06:25:30,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:25:30,145 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:25:30,145 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:25:30,146 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:25:30,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:30" (1/1) ... [2022-12-06 06:25:30,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:30" (1/1) ... [2022-12-06 06:25:30,221 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2022-12-06 06:25:30,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:25:30,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:25:30,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:25:30,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:25:30,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:30" (1/1) ... [2022-12-06 06:25:30,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:30" (1/1) ... [2022-12-06 06:25:30,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:30" (1/1) ... [2022-12-06 06:25:30,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:30" (1/1) ... [2022-12-06 06:25:30,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:30" (1/1) ... [2022-12-06 06:25:30,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:30" (1/1) ... [2022-12-06 06:25:30,258 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:30" (1/1) ... [2022-12-06 06:25:30,259 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:30" (1/1) ... [2022-12-06 06:25:30,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:25:30,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:25:30,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:25:30,263 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:25:30,264 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:30" (1/1) ... [2022-12-06 06:25:30,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:25:30,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:25:30,308 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 06:25:30,320 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 06:25:30,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:25:30,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:25:30,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:25:30,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:25:30,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:25:30,348 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:25:30,348 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:25:30,348 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:25:30,348 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:25:30,348 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:25:30,348 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:25:30,348 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 06:25:30,349 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 06:25:30,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:25:30,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:25:30,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:25:30,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:25:30,351 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 06:25:30,555 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:25:30,556 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:25:30,899 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:25:31,010 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:25:31,010 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:25:31,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:25:31 BoogieIcfgContainer [2022-12-06 06:25:31,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:25:31,017 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:25:31,017 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:25:31,020 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:25:31,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:25:29" (1/3) ... [2022-12-06 06:25:31,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e632ea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:25:31, skipping insertion in model container [2022-12-06 06:25:31,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:30" (2/3) ... [2022-12-06 06:25:31,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e632ea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:25:31, skipping insertion in model container [2022-12-06 06:25:31,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:25:31" (3/3) ... [2022-12-06 06:25:31,023 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037_tso.oepc.i [2022-12-06 06:25:31,040 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:25:31,040 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:25:31,040 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:25:31,102 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:25:31,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2022-12-06 06:25:31,221 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-12-06 06:25:31,221 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:25:31,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-06 06:25:31,229 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2022-12-06 06:25:31,232 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2022-12-06 06:25:31,234 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:31,250 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2022-12-06 06:25:31,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2022-12-06 06:25:31,319 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-12-06 06:25:31,320 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:25:31,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-06 06:25:31,326 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2022-12-06 06:25:31,327 INFO L188 LiptonReduction]: Number of co-enabled transitions 3256 [2022-12-06 06:25:38,024 INFO L203 LiptonReduction]: Total number of compositions: 99 [2022-12-06 06:25:38,038 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:25:38,044 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;@3fbca694, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:25:38,044 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 06:25:38,047 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-06 06:25:38,047 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:25:38,048 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:38,048 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:25:38,048 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:25:38,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:38,052 INFO L85 PathProgramCache]: Analyzing trace with hash 530031834, now seen corresponding path program 1 times [2022-12-06 06:25:38,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:38,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660077160] [2022-12-06 06:25:38,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:38,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:38,414 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 06:25:38,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:38,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660077160] [2022-12-06 06:25:38,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660077160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:38,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:38,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:25:38,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809054527] [2022-12-06 06:25:38,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:38,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:25:38,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:38,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:25:38,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:25:38,440 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2022-12-06 06:25:38,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:38,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:38,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2022-12-06 06:25:38,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:39,540 INFO L130 PetriNetUnfolder]: 4863/6817 cut-off events. [2022-12-06 06:25:39,541 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-12-06 06:25:39,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13641 conditions, 6817 events. 4863/6817 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 35059 event pairs, 1800 based on Foata normal form. 0/6156 useless extension candidates. Maximal degree in co-relation 13629. Up to 5308 conditions per place. [2022-12-06 06:25:39,585 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 37 selfloop transitions, 2 changer transitions 8/52 dead transitions. [2022-12-06 06:25:39,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 52 transitions, 216 flow [2022-12-06 06:25:39,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:25:39,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:25:39,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-06 06:25:39,596 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2022-12-06 06:25:39,598 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 82 flow. Second operand 3 states and 67 transitions. [2022-12-06 06:25:39,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 52 transitions, 216 flow [2022-12-06 06:25:39,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:25:39,604 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 68 flow [2022-12-06 06:25:39,606 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2022-12-06 06:25:39,611 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2022-12-06 06:25:39,611 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:39,612 INFO L89 Accepts]: Start accepts. Operand has 43 places, 28 transitions, 68 flow [2022-12-06 06:25:39,614 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:39,615 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:39,615 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 28 transitions, 68 flow [2022-12-06 06:25:39,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 28 transitions, 68 flow [2022-12-06 06:25:39,635 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-06 06:25:39,635 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:25:39,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:25:39,636 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 68 flow [2022-12-06 06:25:39,636 INFO L188 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-06 06:25:39,707 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:25:39,710 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 06:25:39,710 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2022-12-06 06:25:39,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:39,710 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:39,711 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:39,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:25:39,714 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:25:39,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:39,715 INFO L85 PathProgramCache]: Analyzing trace with hash 123391022, now seen corresponding path program 1 times [2022-12-06 06:25:39,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:39,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530111989] [2022-12-06 06:25:39,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:39,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:40,179 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 06:25:40,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:40,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530111989] [2022-12-06 06:25:40,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530111989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:40,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:40,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:25:40,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819328582] [2022-12-06 06:25:40,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:40,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:25:40,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:40,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:25:40,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:25:40,183 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 06:25:40,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:40,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:40,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 06:25:40,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:41,472 INFO L130 PetriNetUnfolder]: 8789/11850 cut-off events. [2022-12-06 06:25:41,472 INFO L131 PetriNetUnfolder]: For 607/607 co-relation queries the response was YES. [2022-12-06 06:25:41,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24626 conditions, 11850 events. 8789/11850 cut-off events. For 607/607 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 53252 event pairs, 2989 based on Foata normal form. 250/12100 useless extension candidates. Maximal degree in co-relation 24616. Up to 8176 conditions per place. [2022-12-06 06:25:41,541 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 40 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2022-12-06 06:25:41,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 182 flow [2022-12-06 06:25:41,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:25:41,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:25:41,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 06:25:41,544 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2022-12-06 06:25:41,544 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 3 states and 43 transitions. [2022-12-06 06:25:41,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 182 flow [2022-12-06 06:25:41,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:25:41,546 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 72 flow [2022-12-06 06:25:41,546 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2022-12-06 06:25:41,547 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -7 predicate places. [2022-12-06 06:25:41,547 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:41,547 INFO L89 Accepts]: Start accepts. Operand has 40 places, 28 transitions, 72 flow [2022-12-06 06:25:41,548 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:41,548 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:41,549 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 28 transitions, 72 flow [2022-12-06 06:25:41,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 72 flow [2022-12-06 06:25:41,553 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-06 06:25:41,554 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:25:41,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:25:41,555 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 28 transitions, 72 flow [2022-12-06 06:25:41,555 INFO L188 LiptonReduction]: Number of co-enabled transitions 410 [2022-12-06 06:25:41,604 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:25:41,606 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-06 06:25:41,606 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 70 flow [2022-12-06 06:25:41,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:41,606 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:41,606 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:41,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:25:41,607 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:25:41,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:41,607 INFO L85 PathProgramCache]: Analyzing trace with hash -468806783, now seen corresponding path program 1 times [2022-12-06 06:25:41,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:41,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122980795] [2022-12-06 06:25:41,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:41,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:42,136 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 06:25:42,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:42,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122980795] [2022-12-06 06:25:42,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122980795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:42,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:42,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:25:42,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687675248] [2022-12-06 06:25:42,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:42,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:25:42,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:42,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:25:42,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:25:42,139 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:25:42,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 06:25:42,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:42,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:25:42,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:42,839 INFO L130 PetriNetUnfolder]: 3735/5248 cut-off events. [2022-12-06 06:25:42,839 INFO L131 PetriNetUnfolder]: For 468/468 co-relation queries the response was YES. [2022-12-06 06:25:42,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11319 conditions, 5248 events. 3735/5248 cut-off events. For 468/468 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 24886 event pairs, 1444 based on Foata normal form. 6/5239 useless extension candidates. Maximal degree in co-relation 11308. Up to 5009 conditions per place. [2022-12-06 06:25:42,871 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 35 selfloop transitions, 5 changer transitions 0/43 dead transitions. [2022-12-06 06:25:42,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 191 flow [2022-12-06 06:25:42,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:25:42,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:25:42,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-06 06:25:42,873 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6172839506172839 [2022-12-06 06:25:42,874 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 70 flow. Second operand 3 states and 50 transitions. [2022-12-06 06:25:42,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 191 flow [2022-12-06 06:25:42,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 185 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:25:42,876 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 99 flow [2022-12-06 06:25:42,876 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2022-12-06 06:25:42,877 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -7 predicate places. [2022-12-06 06:25:42,877 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:42,877 INFO L89 Accepts]: Start accepts. Operand has 40 places, 31 transitions, 99 flow [2022-12-06 06:25:42,878 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:42,878 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:42,878 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 99 flow [2022-12-06 06:25:42,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 99 flow [2022-12-06 06:25:42,895 INFO L130 PetriNetUnfolder]: 45/120 cut-off events. [2022-12-06 06:25:42,896 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-06 06:25:42,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 120 events. 45/120 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 446 event pairs, 23 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 219. Up to 76 conditions per place. [2022-12-06 06:25:42,897 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 99 flow [2022-12-06 06:25:42,897 INFO L188 LiptonReduction]: Number of co-enabled transitions 434 [2022-12-06 06:25:42,902 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:25:42,903 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 06:25:42,903 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 99 flow [2022-12-06 06:25:42,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 06:25:42,904 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:42,904 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:42,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:25:42,904 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:25:42,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:42,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1678496207, now seen corresponding path program 1 times [2022-12-06 06:25:42,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:42,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415418725] [2022-12-06 06:25:42,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:42,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:43,401 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 06:25:43,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:43,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415418725] [2022-12-06 06:25:43,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415418725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:43,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:43,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:25:43,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133434260] [2022-12-06 06:25:43,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:43,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:25:43,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:43,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:25:43,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:25:43,404 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:25:43,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:43,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:43,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:25:43,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:44,052 INFO L130 PetriNetUnfolder]: 3711/5212 cut-off events. [2022-12-06 06:25:44,053 INFO L131 PetriNetUnfolder]: For 1113/1165 co-relation queries the response was YES. [2022-12-06 06:25:44,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12616 conditions, 5212 events. 3711/5212 cut-off events. For 1113/1165 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 24633 event pairs, 1255 based on Foata normal form. 34/5237 useless extension candidates. Maximal degree in co-relation 12604. Up to 4805 conditions per place. [2022-12-06 06:25:44,087 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 45 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2022-12-06 06:25:44,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 57 transitions, 277 flow [2022-12-06 06:25:44,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:25:44,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:25:44,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-06 06:25:44,090 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6203703703703703 [2022-12-06 06:25:44,090 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 99 flow. Second operand 4 states and 67 transitions. [2022-12-06 06:25:44,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 57 transitions, 277 flow [2022-12-06 06:25:44,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 272 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:25:44,092 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 141 flow [2022-12-06 06:25:44,092 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2022-12-06 06:25:44,094 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2022-12-06 06:25:44,094 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:44,094 INFO L89 Accepts]: Start accepts. Operand has 43 places, 35 transitions, 141 flow [2022-12-06 06:25:44,096 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:44,096 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:44,096 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 35 transitions, 141 flow [2022-12-06 06:25:44,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 35 transitions, 141 flow [2022-12-06 06:25:44,119 INFO L130 PetriNetUnfolder]: 73/163 cut-off events. [2022-12-06 06:25:44,119 INFO L131 PetriNetUnfolder]: For 86/123 co-relation queries the response was YES. [2022-12-06 06:25:44,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 163 events. 73/163 cut-off events. For 86/123 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 662 event pairs, 36 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 401. Up to 104 conditions per place. [2022-12-06 06:25:44,121 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 35 transitions, 141 flow [2022-12-06 06:25:44,121 INFO L188 LiptonReduction]: Number of co-enabled transitions 504 [2022-12-06 06:25:44,156 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:25:44,163 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-06 06:25:44,163 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 141 flow [2022-12-06 06:25:44,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:44,163 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:44,163 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:44,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:25:44,164 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:25:44,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:44,164 INFO L85 PathProgramCache]: Analyzing trace with hash 448184832, now seen corresponding path program 1 times [2022-12-06 06:25:44,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:44,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869028898] [2022-12-06 06:25:44,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:44,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:44,776 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 06:25:44,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:44,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869028898] [2022-12-06 06:25:44,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869028898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:44,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:44,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:25:44,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832045338] [2022-12-06 06:25:44,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:44,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:25:44,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:44,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:25:44,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:25:44,779 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:25:44,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:44,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:44,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:25:44,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:45,431 INFO L130 PetriNetUnfolder]: 3542/5036 cut-off events. [2022-12-06 06:25:45,431 INFO L131 PetriNetUnfolder]: For 2908/2996 co-relation queries the response was YES. [2022-12-06 06:25:45,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13475 conditions, 5036 events. 3542/5036 cut-off events. For 2908/2996 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 24353 event pairs, 1050 based on Foata normal form. 102/5118 useless extension candidates. Maximal degree in co-relation 13461. Up to 4036 conditions per place. [2022-12-06 06:25:45,465 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 45 selfloop transitions, 3 changer transitions 0/51 dead transitions. [2022-12-06 06:25:45,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 286 flow [2022-12-06 06:25:45,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:25:45,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:25:45,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-06 06:25:45,470 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6172839506172839 [2022-12-06 06:25:45,470 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 141 flow. Second operand 3 states and 50 transitions. [2022-12-06 06:25:45,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 286 flow [2022-12-06 06:25:45,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 267 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 06:25:45,476 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 133 flow [2022-12-06 06:25:45,476 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2022-12-06 06:25:45,478 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2022-12-06 06:25:45,478 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:45,478 INFO L89 Accepts]: Start accepts. Operand has 44 places, 35 transitions, 133 flow [2022-12-06 06:25:45,479 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:45,479 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:45,479 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 133 flow [2022-12-06 06:25:45,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 133 flow [2022-12-06 06:25:45,505 INFO L130 PetriNetUnfolder]: 57/136 cut-off events. [2022-12-06 06:25:45,505 INFO L131 PetriNetUnfolder]: For 123/154 co-relation queries the response was YES. [2022-12-06 06:25:45,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 136 events. 57/136 cut-off events. For 123/154 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 543 event pairs, 27 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 349. Up to 85 conditions per place. [2022-12-06 06:25:45,507 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 133 flow [2022-12-06 06:25:45,507 INFO L188 LiptonReduction]: Number of co-enabled transitions 504 [2022-12-06 06:25:45,511 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:25:45,513 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 06:25:45,514 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 133 flow [2022-12-06 06:25:45,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:45,514 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:45,514 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:45,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:25:45,514 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:25:45,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:45,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1009732660, now seen corresponding path program 1 times [2022-12-06 06:25:45,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:45,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766252117] [2022-12-06 06:25:45,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:45,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:45,779 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 06:25:45,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:45,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766252117] [2022-12-06 06:25:45,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766252117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:45,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:45,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:25:45,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474369979] [2022-12-06 06:25:45,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:45,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:25:45,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:45,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:25:45,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:25:45,782 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 06:25:45,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 06:25:45,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:45,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 06:25:45,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:46,292 INFO L130 PetriNetUnfolder]: 2600/3793 cut-off events. [2022-12-06 06:25:46,293 INFO L131 PetriNetUnfolder]: For 3479/3486 co-relation queries the response was YES. [2022-12-06 06:25:46,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10817 conditions, 3793 events. 2600/3793 cut-off events. For 3479/3486 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 20069 event pairs, 398 based on Foata normal form. 256/4007 useless extension candidates. Maximal degree in co-relation 10802. Up to 1611 conditions per place. [2022-12-06 06:25:46,309 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 55 selfloop transitions, 6 changer transitions 1/66 dead transitions. [2022-12-06 06:25:46,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 66 transitions, 365 flow [2022-12-06 06:25:46,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:25:46,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:25:46,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-06 06:25:46,310 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-06 06:25:46,310 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 133 flow. Second operand 4 states and 72 transitions. [2022-12-06 06:25:46,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 66 transitions, 365 flow [2022-12-06 06:25:46,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 66 transitions, 355 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:25:46,316 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 169 flow [2022-12-06 06:25:46,316 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2022-12-06 06:25:46,319 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 0 predicate places. [2022-12-06 06:25:46,319 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:46,319 INFO L89 Accepts]: Start accepts. Operand has 47 places, 39 transitions, 169 flow [2022-12-06 06:25:46,320 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:46,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:46,320 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 39 transitions, 169 flow [2022-12-06 06:25:46,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 39 transitions, 169 flow [2022-12-06 06:25:46,373 INFO L130 PetriNetUnfolder]: 219/440 cut-off events. [2022-12-06 06:25:46,373 INFO L131 PetriNetUnfolder]: For 451/538 co-relation queries the response was YES. [2022-12-06 06:25:46,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 440 events. 219/440 cut-off events. For 451/538 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2405 event pairs, 112 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 1209. Up to 230 conditions per place. [2022-12-06 06:25:46,378 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 39 transitions, 169 flow [2022-12-06 06:25:46,378 INFO L188 LiptonReduction]: Number of co-enabled transitions 544 [2022-12-06 06:25:46,386 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:25:46,386 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-06 06:25:46,387 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 169 flow [2022-12-06 06:25:46,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 06:25:46,387 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:46,387 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:46,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:25:46,387 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:25:46,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:46,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1059678689, now seen corresponding path program 1 times [2022-12-06 06:25:46,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:46,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473340148] [2022-12-06 06:25:46,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:46,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:46,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:25:46,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:46,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473340148] [2022-12-06 06:25:46,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473340148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:46,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:46,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:25:46,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018191308] [2022-12-06 06:25:46,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:46,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:25:46,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:46,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:25:46,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:25:46,788 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 06:25:46,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 169 flow. Second operand has 5 states, 5 states have (on average 7.0) 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 06:25:46,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:46,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 06:25:46,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:47,138 INFO L130 PetriNetUnfolder]: 1556/2392 cut-off events. [2022-12-06 06:25:47,139 INFO L131 PetriNetUnfolder]: For 2491/2498 co-relation queries the response was YES. [2022-12-06 06:25:47,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7906 conditions, 2392 events. 1556/2392 cut-off events. For 2491/2498 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12063 event pairs, 281 based on Foata normal form. 175/2555 useless extension candidates. Maximal degree in co-relation 7889. Up to 864 conditions per place. [2022-12-06 06:25:47,155 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 67 selfloop transitions, 10 changer transitions 1/82 dead transitions. [2022-12-06 06:25:47,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 82 transitions, 494 flow [2022-12-06 06:25:47,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:25:47,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:25:47,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-12-06 06:25:47,157 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6814814814814815 [2022-12-06 06:25:47,158 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 169 flow. Second operand 5 states and 92 transitions. [2022-12-06 06:25:47,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 82 transitions, 494 flow [2022-12-06 06:25:47,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 82 transitions, 483 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:25:47,162 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 221 flow [2022-12-06 06:25:47,162 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2022-12-06 06:25:47,162 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2022-12-06 06:25:47,163 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:47,163 INFO L89 Accepts]: Start accepts. Operand has 51 places, 43 transitions, 221 flow [2022-12-06 06:25:47,164 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:47,164 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:47,164 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 43 transitions, 221 flow [2022-12-06 06:25:47,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 221 flow [2022-12-06 06:25:47,198 INFO L130 PetriNetUnfolder]: 124/294 cut-off events. [2022-12-06 06:25:47,198 INFO L131 PetriNetUnfolder]: For 400/602 co-relation queries the response was YES. [2022-12-06 06:25:47,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 984 conditions, 294 events. 124/294 cut-off events. For 400/602 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1519 event pairs, 39 based on Foata normal form. 7/274 useless extension candidates. Maximal degree in co-relation 968. Up to 157 conditions per place. [2022-12-06 06:25:47,203 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 43 transitions, 221 flow [2022-12-06 06:25:47,203 INFO L188 LiptonReduction]: Number of co-enabled transitions 628 [2022-12-06 06:25:47,209 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:25:47,210 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 06:25:47,210 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 221 flow [2022-12-06 06:25:47,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) 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 06:25:47,210 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:47,210 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:47,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:25:47,210 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:25:47,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:47,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1755518521, now seen corresponding path program 1 times [2022-12-06 06:25:47,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:47,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048049447] [2022-12-06 06:25:47,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:47,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:47,490 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 06:25:47,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:47,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048049447] [2022-12-06 06:25:47,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048049447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:47,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:47,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:25:47,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999202307] [2022-12-06 06:25:47,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:47,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:25:47,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:47,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:25:47,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:25:47,492 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 06:25:47,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 221 flow. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:47,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:47,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 06:25:47,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:47,795 INFO L130 PetriNetUnfolder]: 996/1579 cut-off events. [2022-12-06 06:25:47,796 INFO L131 PetriNetUnfolder]: For 2623/2630 co-relation queries the response was YES. [2022-12-06 06:25:47,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5681 conditions, 1579 events. 996/1579 cut-off events. For 2623/2630 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7463 event pairs, 214 based on Foata normal form. 67/1634 useless extension candidates. Maximal degree in co-relation 5662. Up to 540 conditions per place. [2022-12-06 06:25:47,806 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 77 selfloop transitions, 14 changer transitions 1/96 dead transitions. [2022-12-06 06:25:47,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 96 transitions, 631 flow [2022-12-06 06:25:47,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:25:47,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:25:47,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2022-12-06 06:25:47,807 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6790123456790124 [2022-12-06 06:25:47,807 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 221 flow. Second operand 6 states and 110 transitions. [2022-12-06 06:25:47,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 96 transitions, 631 flow [2022-12-06 06:25:47,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 96 transitions, 601 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 06:25:47,819 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 271 flow [2022-12-06 06:25:47,819 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2022-12-06 06:25:47,820 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2022-12-06 06:25:47,821 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:47,821 INFO L89 Accepts]: Start accepts. Operand has 54 places, 47 transitions, 271 flow [2022-12-06 06:25:47,824 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:47,824 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:47,824 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 47 transitions, 271 flow [2022-12-06 06:25:47,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 47 transitions, 271 flow [2022-12-06 06:25:47,847 INFO L130 PetriNetUnfolder]: 76/191 cut-off events. [2022-12-06 06:25:47,847 INFO L131 PetriNetUnfolder]: For 363/494 co-relation queries the response was YES. [2022-12-06 06:25:47,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 695 conditions, 191 events. 76/191 cut-off events. For 363/494 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 768 event pairs, 14 based on Foata normal form. 12/186 useless extension candidates. Maximal degree in co-relation 678. Up to 83 conditions per place. [2022-12-06 06:25:47,851 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 47 transitions, 271 flow [2022-12-06 06:25:47,851 INFO L188 LiptonReduction]: Number of co-enabled transitions 628 [2022-12-06 06:25:47,856 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:25:47,858 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-06 06:25:47,858 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 271 flow [2022-12-06 06:25:47,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:47,858 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:47,858 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] [2022-12-06 06:25:47,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:25:47,859 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:25:47,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:47,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1115217776, now seen corresponding path program 1 times [2022-12-06 06:25:47,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:47,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748575119] [2022-12-06 06:25:47,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:47,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:48,086 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 06:25:48,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:48,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748575119] [2022-12-06 06:25:48,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748575119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:48,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:48,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:25:48,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348986259] [2022-12-06 06:25:48,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:48,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:25:48,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:48,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:25:48,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:25:48,088 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:25:48,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 271 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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 06:25:48,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:48,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:25:48,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:48,400 INFO L130 PetriNetUnfolder]: 1319/2136 cut-off events. [2022-12-06 06:25:48,400 INFO L131 PetriNetUnfolder]: For 3819/3819 co-relation queries the response was YES. [2022-12-06 06:25:48,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7832 conditions, 2136 events. 1319/2136 cut-off events. For 3819/3819 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 11166 event pairs, 283 based on Foata normal form. 10/2142 useless extension candidates. Maximal degree in co-relation 7812. Up to 1229 conditions per place. [2022-12-06 06:25:48,413 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 75 selfloop transitions, 2 changer transitions 30/110 dead transitions. [2022-12-06 06:25:48,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 110 transitions, 878 flow [2022-12-06 06:25:48,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:25:48,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:25:48,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-06 06:25:48,416 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2022-12-06 06:25:48,416 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 271 flow. Second operand 4 states and 68 transitions. [2022-12-06 06:25:48,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 110 transitions, 878 flow [2022-12-06 06:25:48,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 110 transitions, 762 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-12-06 06:25:48,436 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 241 flow [2022-12-06 06:25:48,436 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=241, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2022-12-06 06:25:48,437 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2022-12-06 06:25:48,437 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:48,437 INFO L89 Accepts]: Start accepts. Operand has 54 places, 48 transitions, 241 flow [2022-12-06 06:25:48,439 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:48,439 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:48,439 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 48 transitions, 241 flow [2022-12-06 06:25:48,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 48 transitions, 241 flow [2022-12-06 06:25:48,472 INFO L130 PetriNetUnfolder]: 147/352 cut-off events. [2022-12-06 06:25:48,472 INFO L131 PetriNetUnfolder]: For 353/459 co-relation queries the response was YES. [2022-12-06 06:25:48,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 352 events. 147/352 cut-off events. For 353/459 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1773 event pairs, 25 based on Foata normal form. 26/347 useless extension candidates. Maximal degree in co-relation 1029. Up to 119 conditions per place. [2022-12-06 06:25:48,476 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 48 transitions, 241 flow [2022-12-06 06:25:48,476 INFO L188 LiptonReduction]: Number of co-enabled transitions 652 [2022-12-06 06:25:48,481 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:25:48,481 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-06 06:25:48,481 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 241 flow [2022-12-06 06:25:48,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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 06:25:48,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:48,482 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] [2022-12-06 06:25:48,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:25:48,482 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:25:48,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:48,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1853189996, now seen corresponding path program 2 times [2022-12-06 06:25:48,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:48,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821844792] [2022-12-06 06:25:48,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:48,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:48,774 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 06:25:48,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:48,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821844792] [2022-12-06 06:25:48,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821844792] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:48,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:48,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:25:48,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770466934] [2022-12-06 06:25:48,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:48,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:25:48,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:48,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:25:48,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:25:48,777 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 06:25:48,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 241 flow. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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 06:25:48,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:48,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 06:25:48,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:49,102 INFO L130 PetriNetUnfolder]: 1155/1818 cut-off events. [2022-12-06 06:25:49,102 INFO L131 PetriNetUnfolder]: For 2556/2563 co-relation queries the response was YES. [2022-12-06 06:25:49,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6307 conditions, 1818 events. 1155/1818 cut-off events. For 2556/2563 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9285 event pairs, 230 based on Foata normal form. 24/1819 useless extension candidates. Maximal degree in co-relation 6287. Up to 712 conditions per place. [2022-12-06 06:25:49,112 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 54 selfloop transitions, 18 changer transitions 9/85 dead transitions. [2022-12-06 06:25:49,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 85 transitions, 551 flow [2022-12-06 06:25:49,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:25:49,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:25:49,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-12-06 06:25:49,114 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2022-12-06 06:25:49,114 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 241 flow. Second operand 7 states and 102 transitions. [2022-12-06 06:25:49,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 85 transitions, 551 flow [2022-12-06 06:25:49,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 85 transitions, 528 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 06:25:49,133 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 274 flow [2022-12-06 06:25:49,134 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=274, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2022-12-06 06:25:49,135 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 12 predicate places. [2022-12-06 06:25:49,135 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:49,135 INFO L89 Accepts]: Start accepts. Operand has 59 places, 47 transitions, 274 flow [2022-12-06 06:25:49,137 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:49,137 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:49,138 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 47 transitions, 274 flow [2022-12-06 06:25:49,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 47 transitions, 274 flow [2022-12-06 06:25:49,158 INFO L130 PetriNetUnfolder]: 83/196 cut-off events. [2022-12-06 06:25:49,158 INFO L131 PetriNetUnfolder]: For 269/302 co-relation queries the response was YES. [2022-12-06 06:25:49,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 196 events. 83/196 cut-off events. For 269/302 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 788 event pairs, 12 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 651. Up to 58 conditions per place. [2022-12-06 06:25:49,161 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 47 transitions, 274 flow [2022-12-06 06:25:49,161 INFO L188 LiptonReduction]: Number of co-enabled transitions 532 [2022-12-06 06:33:46,483 WARN L233 SmtUtils]: Spent 10.75s on a formula simplification that was a NOOP. DAG size: 3375 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-06 06:38:20,136 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [475] L841-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= |v_P3Thread1of1ForFork2_#res.offset_19| 0) (= |v_P3Thread1of1ForFork2_#res.base_19| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_19|, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] and [534] L865-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse24 (not (= (mod v_~x$r_buff0_thd0~0_309 256) 0)))) (let ((.cse17 (and .cse24 (not (= (mod v_~x$w_buff0_used~0_612 256) 0))))) (let ((.cse14 (ite .cse17 0 v_~x$w_buff0_used~0_612))) (let ((.cse19 (= (mod .cse14 256) 0))) (let ((.cse22 (not .cse19))) (let ((.cse23 (and .cse22 .cse24))) (let ((.cse10 (ite .cse23 0 v_~x$r_buff0_thd0~0_309)) (.cse21 (not (= (mod v_~x$r_buff1_thd0~0_312 256) 0)))) (let ((.cse18 (and .cse21 (not (= (mod v_~x$w_buff1_used~0_561 256) 0)))) (.cse11 (= (mod .cse10 256) 0))) (let ((.cse12 (not .cse11)) (.cse6 (ite (or .cse23 .cse18) 0 v_~x$w_buff1_used~0_561))) (let ((.cse20 (= (mod .cse6 256) 0)) (.cse16 (and .cse22 .cse12))) (let ((.cse1 (ite (or (and .cse21 (not .cse20)) .cse16) 0 v_~x$r_buff1_thd0~0_312))) (let ((.cse3 (= (mod .cse1 256) 0))) (let ((.cse7 (and .cse11 .cse3)) (.cse8 (and .cse20 .cse11))) (let ((.cse15 (or .cse7 .cse8 .cse19)) (.cse13 (ite .cse17 v_~x$w_buff0~0_380 (ite .cse18 v_~x$w_buff1~0_335 v_~x~0_505)))) (let ((.cse4 (= (mod v_~x$w_buff1_used~0_560 256) 0)) (.cse5 (= (mod v_~x$w_buff0_used~0_611 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_126 256) 0))) (.cse9 (ite .cse15 .cse13 (ite .cse16 v_~x$w_buff0~0_380 v_~x$w_buff1~0_335)))) (and (= v_~x$r_buff1_thd0~0_311 (ite .cse0 .cse1 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd0~0_308 256) 0))) (or (and .cse2 .cse3) (and .cse4 .cse2) .cse5)) .cse1 0))) (= (mod v_~main$tmp_guard0~0_100 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|) (= (mod v_~main$tmp_guard1~0_122 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_87|) (= (ite .cse0 .cse6 (ite (or .cse7 .cse8 .cse5) .cse6 0)) v_~x$w_buff1_used~0_560) (= v_~main$tmp_guard1~0_122 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_86) (= 2 .cse9) (= v_~__unbuffered_p1_EAX~0_87 0) (= v_~__unbuffered_p3_EAX~0_90 1) (= v_~__unbuffered_p2_EAX~0_96 0))) 1 0)) 0 1)) (= v_~x$r_buff0_thd0~0_308 (ite .cse0 .cse10 (ite (or .cse7 (and .cse4 .cse11) .cse5) .cse10 (ite (and (not .cse5) .cse12) 0 .cse10)))) (= .cse13 v_~x$mem_tmp~0_124) (= v_~x$w_buff0_used~0_611 (ite .cse0 .cse14 (ite .cse15 .cse14 (ite .cse16 0 .cse14)))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93| 0) (= (ite .cse0 v_~x$mem_tmp~0_124 .cse9) v_~x~0_504) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_87| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|) (= v_~main$tmp_guard0~0_100 (ite (= (ite (= v_~__unbuffered_cnt~0_277 4) 1 0) 0) 0 1)) (= v_~weak$$choice2~0_126 |v_ULTIMATE.start_main_#t~nondet12#1_177|) (= v_~x$w_buff0~0_380 v_~x$w_buff0~0_379) (= v_~x$flush_delayed~0_135 0) (= |v_ULTIMATE.start_main_#t~nondet11#1_177| v_~weak$$choice0~0_105) (= v_~x$w_buff1~0_335 v_~x$w_buff1~0_334) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_380, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_309, ~x$w_buff1~0=v_~x$w_buff1~0_335, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_561, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_86, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_312, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_177|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_612, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_177|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_87, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_90, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_96, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_277, ~x~0=v_~x~0_505} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_379, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|, ~x$flush_delayed~0=v_~x$flush_delayed~0_135, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_61|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_122, ~x$mem_tmp~0=v_~x$mem_tmp~0_124, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_87, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_57|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_90, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_96, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_308, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_51|, ~x$w_buff1~0=v_~x$w_buff1~0_334, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_560, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_86, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_100, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_311, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_611, ~weak$$choice0~0=v_~weak$$choice0~0_105, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_87|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_277, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~x~0=v_~x~0_504, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~weak$$choice2~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:38:20,533 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [493] L815-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_109 (+ v_~__unbuffered_cnt~0_110 1)) (= |v_P2Thread1of1ForFork0_#res.offset_7| 0) (= |v_P2Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] and [534] L865-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse24 (not (= (mod v_~x$r_buff0_thd0~0_309 256) 0)))) (let ((.cse17 (and .cse24 (not (= (mod v_~x$w_buff0_used~0_612 256) 0))))) (let ((.cse14 (ite .cse17 0 v_~x$w_buff0_used~0_612))) (let ((.cse19 (= (mod .cse14 256) 0))) (let ((.cse22 (not .cse19))) (let ((.cse23 (and .cse22 .cse24))) (let ((.cse10 (ite .cse23 0 v_~x$r_buff0_thd0~0_309)) (.cse21 (not (= (mod v_~x$r_buff1_thd0~0_312 256) 0)))) (let ((.cse18 (and .cse21 (not (= (mod v_~x$w_buff1_used~0_561 256) 0)))) (.cse11 (= (mod .cse10 256) 0))) (let ((.cse12 (not .cse11)) (.cse6 (ite (or .cse23 .cse18) 0 v_~x$w_buff1_used~0_561))) (let ((.cse20 (= (mod .cse6 256) 0)) (.cse16 (and .cse22 .cse12))) (let ((.cse1 (ite (or (and .cse21 (not .cse20)) .cse16) 0 v_~x$r_buff1_thd0~0_312))) (let ((.cse3 (= (mod .cse1 256) 0))) (let ((.cse7 (and .cse11 .cse3)) (.cse8 (and .cse20 .cse11))) (let ((.cse15 (or .cse7 .cse8 .cse19)) (.cse13 (ite .cse17 v_~x$w_buff0~0_380 (ite .cse18 v_~x$w_buff1~0_335 v_~x~0_505)))) (let ((.cse4 (= (mod v_~x$w_buff1_used~0_560 256) 0)) (.cse5 (= (mod v_~x$w_buff0_used~0_611 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_126 256) 0))) (.cse9 (ite .cse15 .cse13 (ite .cse16 v_~x$w_buff0~0_380 v_~x$w_buff1~0_335)))) (and (= v_~x$r_buff1_thd0~0_311 (ite .cse0 .cse1 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd0~0_308 256) 0))) (or (and .cse2 .cse3) (and .cse4 .cse2) .cse5)) .cse1 0))) (= (mod v_~main$tmp_guard0~0_100 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|) (= (mod v_~main$tmp_guard1~0_122 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_87|) (= (ite .cse0 .cse6 (ite (or .cse7 .cse8 .cse5) .cse6 0)) v_~x$w_buff1_used~0_560) (= v_~main$tmp_guard1~0_122 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_86) (= 2 .cse9) (= v_~__unbuffered_p1_EAX~0_87 0) (= v_~__unbuffered_p3_EAX~0_90 1) (= v_~__unbuffered_p2_EAX~0_96 0))) 1 0)) 0 1)) (= v_~x$r_buff0_thd0~0_308 (ite .cse0 .cse10 (ite (or .cse7 (and .cse4 .cse11) .cse5) .cse10 (ite (and (not .cse5) .cse12) 0 .cse10)))) (= .cse13 v_~x$mem_tmp~0_124) (= v_~x$w_buff0_used~0_611 (ite .cse0 .cse14 (ite .cse15 .cse14 (ite .cse16 0 .cse14)))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93| 0) (= (ite .cse0 v_~x$mem_tmp~0_124 .cse9) v_~x~0_504) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_87| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|) (= v_~main$tmp_guard0~0_100 (ite (= (ite (= v_~__unbuffered_cnt~0_277 4) 1 0) 0) 0 1)) (= v_~weak$$choice2~0_126 |v_ULTIMATE.start_main_#t~nondet12#1_177|) (= v_~x$w_buff0~0_380 v_~x$w_buff0~0_379) (= v_~x$flush_delayed~0_135 0) (= |v_ULTIMATE.start_main_#t~nondet11#1_177| v_~weak$$choice0~0_105) (= v_~x$w_buff1~0_335 v_~x$w_buff1~0_334) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_380, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_309, ~x$w_buff1~0=v_~x$w_buff1~0_335, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_561, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_86, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_312, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_177|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_612, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_177|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_87, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_90, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_96, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_277, ~x~0=v_~x~0_505} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_379, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|, ~x$flush_delayed~0=v_~x$flush_delayed~0_135, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_61|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_122, ~x$mem_tmp~0=v_~x$mem_tmp~0_124, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_87, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_57|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_90, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_96, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_308, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_51|, ~x$w_buff1~0=v_~x$w_buff1~0_334, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_560, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_86, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_100, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_311, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_611, ~weak$$choice0~0=v_~weak$$choice0~0_105, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_87|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_277, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~x~0=v_~x~0_504, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~weak$$choice2~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:38:21,022 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [525] L795-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_151 (+ v_~__unbuffered_cnt~0_152 1)) (= |v_P1Thread1of1ForFork3_#res#1.base_7| 0) (= |v_P1Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_152} OutVars{P1Thread1of1ForFork3_#res#1.base=|v_P1Thread1of1ForFork3_#res#1.base_7|, P1Thread1of1ForFork3_#res#1.offset=|v_P1Thread1of1ForFork3_#res#1.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res#1.base, P1Thread1of1ForFork3_#res#1.offset, ~__unbuffered_cnt~0] and [534] L865-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse24 (not (= (mod v_~x$r_buff0_thd0~0_309 256) 0)))) (let ((.cse17 (and .cse24 (not (= (mod v_~x$w_buff0_used~0_612 256) 0))))) (let ((.cse14 (ite .cse17 0 v_~x$w_buff0_used~0_612))) (let ((.cse19 (= (mod .cse14 256) 0))) (let ((.cse22 (not .cse19))) (let ((.cse23 (and .cse22 .cse24))) (let ((.cse10 (ite .cse23 0 v_~x$r_buff0_thd0~0_309)) (.cse21 (not (= (mod v_~x$r_buff1_thd0~0_312 256) 0)))) (let ((.cse18 (and .cse21 (not (= (mod v_~x$w_buff1_used~0_561 256) 0)))) (.cse11 (= (mod .cse10 256) 0))) (let ((.cse12 (not .cse11)) (.cse6 (ite (or .cse23 .cse18) 0 v_~x$w_buff1_used~0_561))) (let ((.cse20 (= (mod .cse6 256) 0)) (.cse16 (and .cse22 .cse12))) (let ((.cse1 (ite (or (and .cse21 (not .cse20)) .cse16) 0 v_~x$r_buff1_thd0~0_312))) (let ((.cse3 (= (mod .cse1 256) 0))) (let ((.cse7 (and .cse11 .cse3)) (.cse8 (and .cse20 .cse11))) (let ((.cse15 (or .cse7 .cse8 .cse19)) (.cse13 (ite .cse17 v_~x$w_buff0~0_380 (ite .cse18 v_~x$w_buff1~0_335 v_~x~0_505)))) (let ((.cse4 (= (mod v_~x$w_buff1_used~0_560 256) 0)) (.cse5 (= (mod v_~x$w_buff0_used~0_611 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_126 256) 0))) (.cse9 (ite .cse15 .cse13 (ite .cse16 v_~x$w_buff0~0_380 v_~x$w_buff1~0_335)))) (and (= v_~x$r_buff1_thd0~0_311 (ite .cse0 .cse1 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd0~0_308 256) 0))) (or (and .cse2 .cse3) (and .cse4 .cse2) .cse5)) .cse1 0))) (= (mod v_~main$tmp_guard0~0_100 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|) (= (mod v_~main$tmp_guard1~0_122 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_87|) (= (ite .cse0 .cse6 (ite (or .cse7 .cse8 .cse5) .cse6 0)) v_~x$w_buff1_used~0_560) (= v_~main$tmp_guard1~0_122 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_86) (= 2 .cse9) (= v_~__unbuffered_p1_EAX~0_87 0) (= v_~__unbuffered_p3_EAX~0_90 1) (= v_~__unbuffered_p2_EAX~0_96 0))) 1 0)) 0 1)) (= v_~x$r_buff0_thd0~0_308 (ite .cse0 .cse10 (ite (or .cse7 (and .cse4 .cse11) .cse5) .cse10 (ite (and (not .cse5) .cse12) 0 .cse10)))) (= .cse13 v_~x$mem_tmp~0_124) (= v_~x$w_buff0_used~0_611 (ite .cse0 .cse14 (ite .cse15 .cse14 (ite .cse16 0 .cse14)))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93| 0) (= (ite .cse0 v_~x$mem_tmp~0_124 .cse9) v_~x~0_504) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_87| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|) (= v_~main$tmp_guard0~0_100 (ite (= (ite (= v_~__unbuffered_cnt~0_277 4) 1 0) 0) 0 1)) (= v_~weak$$choice2~0_126 |v_ULTIMATE.start_main_#t~nondet12#1_177|) (= v_~x$w_buff0~0_380 v_~x$w_buff0~0_379) (= v_~x$flush_delayed~0_135 0) (= |v_ULTIMATE.start_main_#t~nondet11#1_177| v_~weak$$choice0~0_105) (= v_~x$w_buff1~0_335 v_~x$w_buff1~0_334) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_380, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_309, ~x$w_buff1~0=v_~x$w_buff1~0_335, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_561, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_86, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_312, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_177|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_612, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_177|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_87, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_90, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_96, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_277, ~x~0=v_~x~0_505} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_379, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|, ~x$flush_delayed~0=v_~x$flush_delayed~0_135, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_61|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_122, ~x$mem_tmp~0=v_~x$mem_tmp~0_124, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_87, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_57|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_90, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_96, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_308, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_51|, ~x$w_buff1~0=v_~x$w_buff1~0_334, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_560, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_86, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_100, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_311, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_611, ~weak$$choice0~0=v_~weak$$choice0~0_105, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_87|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_277, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~x~0=v_~x~0_504, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~weak$$choice2~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:38:21,491 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [427] L765-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= |v_P0Thread1of1ForFork1_#res.offset_11| 0) (= |v_P0Thread1of1ForFork1_#res.base_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] and [534] L865-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse24 (not (= (mod v_~x$r_buff0_thd0~0_309 256) 0)))) (let ((.cse17 (and .cse24 (not (= (mod v_~x$w_buff0_used~0_612 256) 0))))) (let ((.cse14 (ite .cse17 0 v_~x$w_buff0_used~0_612))) (let ((.cse19 (= (mod .cse14 256) 0))) (let ((.cse22 (not .cse19))) (let ((.cse23 (and .cse22 .cse24))) (let ((.cse10 (ite .cse23 0 v_~x$r_buff0_thd0~0_309)) (.cse21 (not (= (mod v_~x$r_buff1_thd0~0_312 256) 0)))) (let ((.cse18 (and .cse21 (not (= (mod v_~x$w_buff1_used~0_561 256) 0)))) (.cse11 (= (mod .cse10 256) 0))) (let ((.cse12 (not .cse11)) (.cse6 (ite (or .cse23 .cse18) 0 v_~x$w_buff1_used~0_561))) (let ((.cse20 (= (mod .cse6 256) 0)) (.cse16 (and .cse22 .cse12))) (let ((.cse1 (ite (or (and .cse21 (not .cse20)) .cse16) 0 v_~x$r_buff1_thd0~0_312))) (let ((.cse3 (= (mod .cse1 256) 0))) (let ((.cse7 (and .cse11 .cse3)) (.cse8 (and .cse20 .cse11))) (let ((.cse15 (or .cse7 .cse8 .cse19)) (.cse13 (ite .cse17 v_~x$w_buff0~0_380 (ite .cse18 v_~x$w_buff1~0_335 v_~x~0_505)))) (let ((.cse4 (= (mod v_~x$w_buff1_used~0_560 256) 0)) (.cse5 (= (mod v_~x$w_buff0_used~0_611 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_126 256) 0))) (.cse9 (ite .cse15 .cse13 (ite .cse16 v_~x$w_buff0~0_380 v_~x$w_buff1~0_335)))) (and (= v_~x$r_buff1_thd0~0_311 (ite .cse0 .cse1 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd0~0_308 256) 0))) (or (and .cse2 .cse3) (and .cse4 .cse2) .cse5)) .cse1 0))) (= (mod v_~main$tmp_guard0~0_100 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|) (= (mod v_~main$tmp_guard1~0_122 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_87|) (= (ite .cse0 .cse6 (ite (or .cse7 .cse8 .cse5) .cse6 0)) v_~x$w_buff1_used~0_560) (= v_~main$tmp_guard1~0_122 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_86) (= 2 .cse9) (= v_~__unbuffered_p1_EAX~0_87 0) (= v_~__unbuffered_p3_EAX~0_90 1) (= v_~__unbuffered_p2_EAX~0_96 0))) 1 0)) 0 1)) (= v_~x$r_buff0_thd0~0_308 (ite .cse0 .cse10 (ite (or .cse7 (and .cse4 .cse11) .cse5) .cse10 (ite (and (not .cse5) .cse12) 0 .cse10)))) (= .cse13 v_~x$mem_tmp~0_124) (= v_~x$w_buff0_used~0_611 (ite .cse0 .cse14 (ite .cse15 .cse14 (ite .cse16 0 .cse14)))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93| 0) (= (ite .cse0 v_~x$mem_tmp~0_124 .cse9) v_~x~0_504) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_87| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|) (= v_~main$tmp_guard0~0_100 (ite (= (ite (= v_~__unbuffered_cnt~0_277 4) 1 0) 0) 0 1)) (= v_~weak$$choice2~0_126 |v_ULTIMATE.start_main_#t~nondet12#1_177|) (= v_~x$w_buff0~0_380 v_~x$w_buff0~0_379) (= v_~x$flush_delayed~0_135 0) (= |v_ULTIMATE.start_main_#t~nondet11#1_177| v_~weak$$choice0~0_105) (= v_~x$w_buff1~0_335 v_~x$w_buff1~0_334) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_57| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_380, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_309, ~x$w_buff1~0=v_~x$w_buff1~0_335, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_561, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_86, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_312, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_177|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_612, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_177|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_87, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_90, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_96, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_277, ~x~0=v_~x~0_505} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_379, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|, ~x$flush_delayed~0=v_~x$flush_delayed~0_135, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_61|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_122, ~x$mem_tmp~0=v_~x$mem_tmp~0_124, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_87, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_57|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_90, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_96, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_308, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_51|, ~x$w_buff1~0=v_~x$w_buff1~0_334, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_560, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_86, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_100, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_311, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_611, ~weak$$choice0~0=v_~weak$$choice0~0_105, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_87|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_277, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~x~0=v_~x~0_504, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~weak$$choice2~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:38:21,995 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:38:21,996 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 752861 [2022-12-06 06:38:21,996 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 274 flow [2022-12-06 06:38:21,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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 06:38:21,996 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:21,997 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] [2022-12-06 06:38:21,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:38:21,997 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:38:21,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:21,997 INFO L85 PathProgramCache]: Analyzing trace with hash -684295195, now seen corresponding path program 1 times [2022-12-06 06:38:21,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:21,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358747579] [2022-12-06 06:38:21,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:21,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:39:03,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 06:39:03,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:39:03,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358747579] [2022-12-06 06:39:03,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358747579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:39:03,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:39:03,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:39:03,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185256419] [2022-12-06 06:39:03,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:39:03,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:39:03,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:39:03,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:39:03,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:39:03,052 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 06:39:03,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 274 flow. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 06:39:03,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:39:03,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 06:39:03,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:39:03,488 INFO L130 PetriNetUnfolder]: 1963/2951 cut-off events. [2022-12-06 06:39:03,488 INFO L131 PetriNetUnfolder]: For 4779/4779 co-relation queries the response was YES. [2022-12-06 06:39:03,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10490 conditions, 2951 events. 1963/2951 cut-off events. For 4779/4779 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 13547 event pairs, 270 based on Foata normal form. 4/2955 useless extension candidates. Maximal degree in co-relation 10469. Up to 1185 conditions per place. [2022-12-06 06:39:03,502 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 58 selfloop transitions, 4 changer transitions 44/106 dead transitions. [2022-12-06 06:39:03,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 106 transitions, 818 flow [2022-12-06 06:39:03,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:39:03,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:39:03,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-06 06:39:03,504 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2022-12-06 06:39:03,504 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 274 flow. Second operand 5 states and 66 transitions. [2022-12-06 06:39:03,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 106 transitions, 818 flow [2022-12-06 06:39:03,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 106 transitions, 631 flow, removed 20 selfloop flow, removed 11 redundant places. [2022-12-06 06:39:03,534 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 207 flow [2022-12-06 06:39:03,534 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=207, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2022-12-06 06:39:03,534 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 3 predicate places. [2022-12-06 06:39:03,535 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:39:03,535 INFO L89 Accepts]: Start accepts. Operand has 50 places, 45 transitions, 207 flow [2022-12-06 06:39:03,535 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:39:03,536 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:39:03,536 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 45 transitions, 207 flow [2022-12-06 06:39:03,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 207 flow [2022-12-06 06:39:03,559 INFO L130 PetriNetUnfolder]: 99/238 cut-off events. [2022-12-06 06:39:03,560 INFO L131 PetriNetUnfolder]: For 56/62 co-relation queries the response was YES. [2022-12-06 06:39:03,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541 conditions, 238 events. 99/238 cut-off events. For 56/62 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1048 event pairs, 13 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 526. Up to 66 conditions per place. [2022-12-06 06:39:03,563 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 45 transitions, 207 flow [2022-12-06 06:39:03,563 INFO L188 LiptonReduction]: Number of co-enabled transitions 438 [2022-12-06 06:39:03,600 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:39:03,601 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-06 06:39:03,601 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 205 flow [2022-12-06 06:39:03,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 06:39:03,601 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:39:03,601 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] [2022-12-06 06:39:03,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:39:03,602 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:39:03,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:39:03,602 INFO L85 PathProgramCache]: Analyzing trace with hash 515574495, now seen corresponding path program 1 times [2022-12-06 06:39:03,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:39:03,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733637760] [2022-12-06 06:39:03,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:39:03,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:39:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:39:03,857 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 06:39:03,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:39:03,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733637760] [2022-12-06 06:39:03,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733637760] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:39:03,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:39:03,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:39:03,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931115560] [2022-12-06 06:39:03,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:39:03,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:39:03,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:39:03,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:39:03,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:39:03,862 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 06:39:03,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 06:39:03,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:39:03,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 06:39:03,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:39:04,203 INFO L130 PetriNetUnfolder]: 1467/2323 cut-off events. [2022-12-06 06:39:04,204 INFO L131 PetriNetUnfolder]: For 2034/2034 co-relation queries the response was YES. [2022-12-06 06:39:04,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7318 conditions, 2323 events. 1467/2323 cut-off events. For 2034/2034 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 11644 event pairs, 277 based on Foata normal form. 4/2324 useless extension candidates. Maximal degree in co-relation 7300. Up to 1185 conditions per place. [2022-12-06 06:39:04,213 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 40 selfloop transitions, 1 changer transitions 47/89 dead transitions. [2022-12-06 06:39:04,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 89 transitions, 574 flow [2022-12-06 06:39:04,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:39:04,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:39:04,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-06 06:39:04,215 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5480769230769231 [2022-12-06 06:39:04,215 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 205 flow. Second operand 4 states and 57 transitions. [2022-12-06 06:39:04,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 89 transitions, 574 flow [2022-12-06 06:39:04,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 89 transitions, 566 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 06:39:04,221 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 179 flow [2022-12-06 06:39:04,221 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2022-12-06 06:39:04,221 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 5 predicate places. [2022-12-06 06:39:04,222 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:39:04,222 INFO L89 Accepts]: Start accepts. Operand has 52 places, 38 transitions, 179 flow [2022-12-06 06:39:04,222 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:39:04,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:39:04,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 38 transitions, 179 flow [2022-12-06 06:39:04,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 38 transitions, 179 flow [2022-12-06 06:39:04,243 INFO L130 PetriNetUnfolder]: 87/217 cut-off events. [2022-12-06 06:39:04,244 INFO L131 PetriNetUnfolder]: For 58/64 co-relation queries the response was YES. [2022-12-06 06:39:04,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 217 events. 87/217 cut-off events. For 58/64 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1002 event pairs, 9 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 485. Up to 66 conditions per place. [2022-12-06 06:39:04,246 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 38 transitions, 179 flow [2022-12-06 06:39:04,246 INFO L188 LiptonReduction]: Number of co-enabled transitions 322 [2022-12-06 06:39:04,376 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:39:04,377 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 155 [2022-12-06 06:39:04,377 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 175 flow [2022-12-06 06:39:04,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 06:39:04,378 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:39:04,378 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:39:04,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:39:04,378 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:39:04,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:39:04,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1965880278, now seen corresponding path program 1 times [2022-12-06 06:39:04,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:39:04,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135501642] [2022-12-06 06:39:04,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:39:04,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:39:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:39:09,315 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 06:39:09,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:39:09,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135501642] [2022-12-06 06:39:09,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135501642] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:39:09,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:39:09,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:39:09,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915749767] [2022-12-06 06:39:09,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:39:09,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:39:09,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:39:09,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:39:09,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:39:09,317 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 06:39:09,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 175 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:39:09,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:39:09,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 06:39:09,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:39:09,805 INFO L130 PetriNetUnfolder]: 955/1557 cut-off events. [2022-12-06 06:39:09,805 INFO L131 PetriNetUnfolder]: For 1700/1700 co-relation queries the response was YES. [2022-12-06 06:39:09,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5213 conditions, 1557 events. 955/1557 cut-off events. For 1700/1700 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7481 event pairs, 149 based on Foata normal form. 4/1561 useless extension candidates. Maximal degree in co-relation 5193. Up to 536 conditions per place. [2022-12-06 06:39:09,812 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 64 selfloop transitions, 6 changer transitions 52/122 dead transitions. [2022-12-06 06:39:09,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 122 transitions, 801 flow [2022-12-06 06:39:09,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:39:09,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:39:09,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-12-06 06:39:09,814 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-12-06 06:39:09,814 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 175 flow. Second operand 8 states and 90 transitions. [2022-12-06 06:39:09,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 122 transitions, 801 flow [2022-12-06 06:39:09,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 122 transitions, 771 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-06 06:39:09,820 INFO L231 Difference]: Finished difference. Result has 57 places, 38 transitions, 211 flow [2022-12-06 06:39:09,820 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=211, PETRI_PLACES=57, PETRI_TRANSITIONS=38} [2022-12-06 06:39:09,820 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 10 predicate places. [2022-12-06 06:39:09,820 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:39:09,821 INFO L89 Accepts]: Start accepts. Operand has 57 places, 38 transitions, 211 flow [2022-12-06 06:39:09,821 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:39:09,821 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:39:09,822 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 38 transitions, 211 flow [2022-12-06 06:39:09,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 38 transitions, 211 flow [2022-12-06 06:39:09,846 INFO L130 PetriNetUnfolder]: 109/260 cut-off events. [2022-12-06 06:39:09,847 INFO L131 PetriNetUnfolder]: For 177/200 co-relation queries the response was YES. [2022-12-06 06:39:09,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 260 events. 109/260 cut-off events. For 177/200 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1284 event pairs, 11 based on Foata normal form. 1/242 useless extension candidates. Maximal degree in co-relation 655. Up to 84 conditions per place. [2022-12-06 06:39:09,849 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 38 transitions, 211 flow [2022-12-06 06:39:09,849 INFO L188 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-06 06:39:09,854 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:39:09,854 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 06:39:09,854 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 211 flow [2022-12-06 06:39:09,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:39:09,855 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:39:09,855 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:39:09,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:39:09,855 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:39:09,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:39:09,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1938566942, now seen corresponding path program 2 times [2022-12-06 06:39:09,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:39:09,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270577345] [2022-12-06 06:39:09,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:39:09,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:39:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:39:09,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:39:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:39:10,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:39:10,031 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:39:10,032 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 06:39:10,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 06:39:10,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 06:39:10,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 06:39:10,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 06:39:10,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 06:39:10,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 06:39:10,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:39:10,035 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:39:10,039 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:39:10,039 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:39:10,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:39:10 BasicIcfg [2022-12-06 06:39:10,125 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:39:10,126 INFO L158 Benchmark]: Toolchain (without parser) took 820610.12ms. Allocated memory was 185.6MB in the beginning and 1.1GB in the end (delta: 870.3MB). Free memory was 159.6MB in the beginning and 499.9MB in the end (delta: -340.4MB). Peak memory consumption was 530.5MB. Max. memory is 8.0GB. [2022-12-06 06:39:10,126 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 185.6MB. Free memory is still 162.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:39:10,126 INFO L158 Benchmark]: CACSL2BoogieTranslator took 626.94ms. Allocated memory is still 185.6MB. Free memory was 159.6MB in the beginning and 131.2MB in the end (delta: 28.4MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 06:39:10,126 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.78ms. Allocated memory is still 185.6MB. Free memory was 131.2MB in the beginning and 128.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:39:10,127 INFO L158 Benchmark]: Boogie Preprocessor took 39.27ms. Allocated memory is still 185.6MB. Free memory was 128.6MB in the beginning and 126.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:39:10,127 INFO L158 Benchmark]: RCFGBuilder took 751.93ms. Allocated memory is still 185.6MB. Free memory was 126.5MB in the beginning and 87.7MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-12-06 06:39:10,127 INFO L158 Benchmark]: TraceAbstraction took 819108.58ms. Allocated memory was 185.6MB in the beginning and 1.1GB in the end (delta: 870.3MB). Free memory was 87.2MB in the beginning and 499.9MB in the end (delta: -412.7MB). Peak memory consumption was 458.1MB. Max. memory is 8.0GB. [2022-12-06 06:39:10,128 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 185.6MB. Free memory is still 162.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 626.94ms. Allocated memory is still 185.6MB. Free memory was 159.6MB in the beginning and 131.2MB in the end (delta: 28.4MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 76.78ms. Allocated memory is still 185.6MB. Free memory was 131.2MB in the beginning and 128.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.27ms. Allocated memory is still 185.6MB. Free memory was 128.6MB in the beginning and 126.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 751.93ms. Allocated memory is still 185.6MB. Free memory was 126.5MB in the beginning and 87.7MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 819108.58ms. Allocated memory was 185.6MB in the beginning and 1.1GB in the end (delta: 870.3MB). Free memory was 87.2MB in the beginning and 499.9MB in the end (delta: -412.7MB). Peak memory consumption was 458.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 140 PlacesBefore, 47 PlacesAfterwards, 129 TransitionsBefore, 35 TransitionsAfterwards, 3256 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 53 ConcurrentYvCompositions, 1 ChoiceCompositions, 99 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2246, independent: 2172, independent conditional: 2172, independent unconditional: 0, dependent: 74, dependent conditional: 74, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2246, independent: 2172, independent conditional: 0, independent unconditional: 2172, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2246, independent: 2172, independent conditional: 0, independent unconditional: 2172, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2246, independent: 2172, independent conditional: 0, independent unconditional: 2172, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1903, independent: 1856, independent conditional: 0, independent unconditional: 1856, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1903, independent: 1819, independent conditional: 0, independent unconditional: 1819, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 84, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 354, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 313, dependent conditional: 0, dependent unconditional: 313, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2246, independent: 316, independent conditional: 0, independent unconditional: 316, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 1903, unknown conditional: 0, unknown unconditional: 1903] , Statistics on independence cache: Total cache size (in pairs): 2690, Positive cache size: 2643, Positive conditional cache size: 0, Positive unconditional cache size: 2643, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 39 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 205, independent: 175, independent conditional: 175, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 205, independent: 175, independent conditional: 15, independent unconditional: 160, dependent: 30, dependent conditional: 3, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 205, independent: 175, independent conditional: 15, independent unconditional: 160, dependent: 30, dependent conditional: 3, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 205, independent: 175, independent conditional: 15, independent unconditional: 160, dependent: 30, dependent conditional: 3, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 181, independent: 158, independent conditional: 14, independent unconditional: 144, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 181, independent: 152, independent conditional: 0, independent unconditional: 152, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 29, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 67, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 59, dependent conditional: 11, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 205, independent: 17, independent conditional: 1, independent unconditional: 16, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 181, unknown conditional: 16, unknown unconditional: 165] , Statistics on independence cache: Total cache size (in pairs): 181, Positive cache size: 158, Positive conditional cache size: 14, Positive unconditional cache size: 144, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 410 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 354, independent: 301, independent conditional: 301, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 354, independent: 301, independent conditional: 14, independent unconditional: 287, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 354, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 354, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 354, independent: 280, independent conditional: 0, independent unconditional: 280, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 25, unknown conditional: 0, unknown unconditional: 25] , Statistics on independence cache: Total cache size (in pairs): 217, Positive cache size: 190, Positive conditional cache size: 15, Positive unconditional cache size: 175, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 434 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, independent: 152, independent conditional: 152, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 173, independent: 152, independent conditional: 15, independent unconditional: 137, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 173, independent: 152, independent conditional: 15, independent unconditional: 137, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 173, independent: 152, independent conditional: 15, independent unconditional: 137, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 173, independent: 152, independent conditional: 15, independent unconditional: 137, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 219, Positive cache size: 190, Positive conditional cache size: 15, Positive unconditional cache size: 175, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 504 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 160, independent: 137, independent conditional: 137, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 160, independent: 137, independent conditional: 10, independent unconditional: 127, dependent: 23, dependent conditional: 4, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 160, independent: 137, independent conditional: 10, independent unconditional: 127, dependent: 23, dependent conditional: 4, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 160, independent: 137, independent conditional: 10, independent unconditional: 127, dependent: 23, dependent conditional: 4, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 30, dependent conditional: 6, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 160, independent: 128, independent conditional: 10, independent unconditional: 118, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 14, unknown conditional: 2, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 199, Positive conditional cache size: 15, Positive unconditional cache size: 184, Negative cache size: 34, Negative conditional cache size: 4, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 504 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 145, independent: 123, independent conditional: 123, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 145, independent: 123, independent conditional: 14, independent unconditional: 109, dependent: 22, dependent conditional: 4, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 145, independent: 123, independent conditional: 14, independent unconditional: 109, dependent: 22, dependent conditional: 4, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 145, independent: 123, independent conditional: 14, independent unconditional: 109, dependent: 22, dependent conditional: 4, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 145, independent: 121, independent conditional: 14, independent unconditional: 107, dependent: 22, dependent conditional: 4, dependent unconditional: 18, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 235, Positive cache size: 201, Positive conditional cache size: 15, Positive unconditional cache size: 186, Negative cache size: 34, Negative conditional cache size: 4, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 544 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 141, independent conditional: 141, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 159, independent: 141, independent conditional: 45, independent unconditional: 96, dependent: 18, dependent conditional: 6, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 159, independent: 141, independent conditional: 40, independent unconditional: 101, dependent: 18, dependent conditional: 4, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 159, independent: 141, independent conditional: 40, independent unconditional: 101, dependent: 18, dependent conditional: 4, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 159, independent: 137, independent conditional: 40, independent unconditional: 97, dependent: 17, dependent conditional: 4, dependent unconditional: 13, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 205, Positive conditional cache size: 15, Positive unconditional cache size: 190, Negative cache size: 35, Negative conditional cache size: 4, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 628 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 138, independent: 120, independent conditional: 120, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 138, independent: 120, independent conditional: 40, independent unconditional: 80, dependent: 18, dependent conditional: 6, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 140, independent: 120, independent conditional: 40, independent unconditional: 80, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 140, independent: 120, independent conditional: 40, independent unconditional: 80, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 140, independent: 120, independent conditional: 40, independent unconditional: 80, dependent: 19, dependent conditional: 4, dependent unconditional: 15, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 241, Positive cache size: 205, Positive conditional cache size: 15, Positive unconditional cache size: 190, Negative cache size: 36, Negative conditional cache size: 4, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 628 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 144, independent: 126, independent conditional: 126, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 144, independent: 126, independent conditional: 46, independent unconditional: 80, dependent: 18, dependent conditional: 6, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 146, independent: 126, independent conditional: 40, independent unconditional: 86, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 146, independent: 126, independent conditional: 40, independent unconditional: 86, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 146, independent: 124, independent conditional: 40, independent unconditional: 84, dependent: 19, dependent conditional: 4, dependent unconditional: 15, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 244, Positive cache size: 207, Positive conditional cache size: 15, Positive unconditional cache size: 192, Negative cache size: 37, Negative conditional cache size: 4, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 652 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 129, independent: 115, independent conditional: 115, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 129, independent: 115, independent conditional: 46, independent unconditional: 69, dependent: 14, dependent conditional: 6, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 129, independent: 115, independent conditional: 38, independent unconditional: 77, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 129, independent: 115, independent conditional: 38, independent unconditional: 77, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 129, independent: 111, independent conditional: 37, independent unconditional: 74, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 248, Positive cache size: 211, Positive conditional cache size: 16, Positive unconditional cache size: 195, Negative cache size: 37, Negative conditional cache size: 4, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 752.8s, 58 PlacesBefore, 54 PlacesAfterwards, 47 TransitionsBefore, 43 TransitionsAfterwards, 532 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 229, independent: 207, independent conditional: 207, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 229, independent: 207, independent conditional: 93, independent unconditional: 114, dependent: 22, dependent conditional: 6, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 229, independent: 207, independent conditional: 93, independent unconditional: 114, dependent: 22, dependent conditional: 6, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 229, independent: 207, independent conditional: 93, independent unconditional: 114, dependent: 22, dependent conditional: 6, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 229, independent: 207, independent conditional: 93, independent unconditional: 114, dependent: 21, dependent conditional: 5, dependent unconditional: 16, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 279, Positive cache size: 241, Positive conditional cache size: 18, Positive unconditional cache size: 223, Negative cache size: 38, Negative conditional cache size: 5, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 48 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 438 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 188, independent: 170, independent conditional: 170, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 188, independent: 170, independent conditional: 75, independent unconditional: 95, dependent: 18, dependent conditional: 6, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 188, independent: 170, independent conditional: 75, independent unconditional: 95, dependent: 18, dependent conditional: 6, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 188, independent: 170, independent conditional: 75, independent unconditional: 95, dependent: 18, dependent conditional: 6, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 188, independent: 167, independent conditional: 73, independent unconditional: 94, dependent: 18, dependent conditional: 6, dependent unconditional: 12, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 283, Positive cache size: 245, Positive conditional cache size: 20, Positive unconditional cache size: 225, Negative cache size: 38, Negative conditional cache size: 5, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 51 PlacesBefore, 49 PlacesAfterwards, 38 TransitionsBefore, 36 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66, independent: 60, independent conditional: 21, independent unconditional: 39, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 60, independent conditional: 21, independent unconditional: 39, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 60, independent conditional: 21, independent unconditional: 39, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 4, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, independent: 49, independent conditional: 17, independent unconditional: 32, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 11, unknown conditional: 4, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 327, Positive cache size: 289, Positive conditional cache size: 25, Positive unconditional cache size: 264, Negative cache size: 38, Negative conditional cache size: 5, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 328, Positive cache size: 289, Positive conditional cache size: 25, Positive unconditional cache size: 264, Negative cache size: 39, Negative conditional cache size: 5, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t993; [L859] FCALL, FORK 0 pthread_create(&t993, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t993, ((void *)0), P0, ((void *)0))=-2, t993={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t994; [L861] FCALL, FORK 0 pthread_create(&t994, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t994, ((void *)0), P1, ((void *)0))=-1, t993={5:0}, t994={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t995; [L863] FCALL, FORK 0 pthread_create(&t995, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t995, ((void *)0), P2, ((void *)0))=0, t993={5:0}, t994={6:0}, t995={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L864] 0 pthread_t t996; [L865] FCALL, FORK 0 pthread_create(&t996, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t996, ((void *)0), P3, ((void *)0))=1, t993={5:0}, t994={6:0}, t995={7:0}, t996={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 3 y = 1 [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] 4 z = 1 [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a [L833] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L754] 1 b = 1 [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L810] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L811] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L812] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L813] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L814] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L867] 3 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 3 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 3 !(!cond) [L869] RET 3 assume_abort_if_not(main$tmp_guard0) [L871] 3 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] 3 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] 3 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L878] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 3 x$flush_delayed = weak$$choice2 [L881] 3 x$mem_tmp = x [L882] 3 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 3 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] 3 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 3 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 3 x = x$flush_delayed ? x$mem_tmp : x [L891] 3 x$flush_delayed = (_Bool)0 [L893] CALL 3 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 3 !expression [L18] 3 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 171 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 818.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 664 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 664 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1198 IncrementalHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 16 mSDtfsCounter, 1198 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=274occurred in iteration=10, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 49.5s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 2729 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:39:10,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...