/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/safe004_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:35:39,866 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:35:39,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:35:39,900 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:35:39,900 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:35:39,902 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:35:39,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:35:39,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:35:39,916 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:35:39,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:35:39,917 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:35:39,918 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:35:39,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:35:39,919 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:35:39,920 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:35:39,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:35:39,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:35:39,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:35:39,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:35:39,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:35:39,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:35:39,936 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:35:39,937 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:35:39,938 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:35:39,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:35:39,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:35:39,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:35:39,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:35:39,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:35:39,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:35:39,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:35:39,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:35:39,945 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:35:39,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:35:39,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:35:39,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:35:39,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:35:39,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:35:39,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:35:39,956 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:35:39,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:35:39,957 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:35:39,995 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:35:39,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:35:39,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:35:39,997 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:35:39,997 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:35:39,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:35:39,998 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:35:39,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:35:39,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:35:39,999 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:35:40,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:35:40,004 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:35:40,004 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:35:40,004 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:35:40,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:35:40,004 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:35:40,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:35:40,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:35:40,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:35:40,005 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:35:40,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:35:40,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:35:40,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:35:40,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:35:40,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:35:40,006 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:35:40,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:35:40,006 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:35:40,006 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:35:40,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:35:40,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:35:40,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:35:40,363 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:35:40,367 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:35:40,368 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2022-12-06 06:35:41,529 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:35:41,776 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:35:41,777 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2022-12-06 06:35:41,802 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1a8d41f6/0959b244113c41179f16a40c470c990b/FLAGdc280af7c [2022-12-06 06:35:41,823 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1a8d41f6/0959b244113c41179f16a40c470c990b [2022-12-06 06:35:41,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:35:41,826 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:35:41,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:35:41,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:35:41,830 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:35:41,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:35:41" (1/1) ... [2022-12-06 06:35:41,831 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1db5e7ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:35:41, skipping insertion in model container [2022-12-06 06:35:41,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:35:41" (1/1) ... [2022-12-06 06:35:41,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:35:41,895 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:35:42,066 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/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-06 06:35:42,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:35:42,301 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:35:42,315 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/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-06 06:35:42,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:35:42,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:35:42,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:35:42,419 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:35:42,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:35:42 WrapperNode [2022-12-06 06:35:42,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:35:42,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:35:42,421 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:35:42,421 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:35:42,427 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:35:42" (1/1) ... [2022-12-06 06:35:42,464 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:35:42" (1/1) ... [2022-12-06 06:35:42,499 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-06 06:35:42,500 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:35:42,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:35:42,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:35:42,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:35:42,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:35:42" (1/1) ... [2022-12-06 06:35:42,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:35:42" (1/1) ... [2022-12-06 06:35:42,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:35:42" (1/1) ... [2022-12-06 06:35:42,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:35:42" (1/1) ... [2022-12-06 06:35:42,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:35:42" (1/1) ... [2022-12-06 06:35:42,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:35:42" (1/1) ... [2022-12-06 06:35:42,521 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:35:42" (1/1) ... [2022-12-06 06:35:42,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:35:42" (1/1) ... [2022-12-06 06:35:42,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:35:42,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:35:42,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:35:42,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:35:42,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:35:42" (1/1) ... [2022-12-06 06:35:42,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:35:42,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:35:42,561 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:35:42,593 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:35:42,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:35:42,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:35:42,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:35:42,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:35:42,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:35:42,612 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:35:42,613 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:35:42,613 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:35:42,613 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:35:42,613 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:35:42,613 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:35:42,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:35:42,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:35:42,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:35:42,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:35:42,615 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:35:42,772 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:35:42,773 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:35:43,096 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:35:43,238 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:35:43,238 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:35:43,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:35:43 BoogieIcfgContainer [2022-12-06 06:35:43,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:35:43,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:35:43,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:35:43,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:35:43,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:35:41" (1/3) ... [2022-12-06 06:35:43,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55cd501d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:35:43, skipping insertion in model container [2022-12-06 06:35:43,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:35:42" (2/3) ... [2022-12-06 06:35:43,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55cd501d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:35:43, skipping insertion in model container [2022-12-06 06:35:43,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:35:43" (3/3) ... [2022-12-06 06:35:43,251 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.opt_pso.opt_rmo.opt.i [2022-12-06 06:35:43,267 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:35:43,268 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:35:43,268 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:35:43,328 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:35:43,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-06 06:35:43,401 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-06 06:35:43,402 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:35:43,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 06:35:43,407 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-06 06:35:43,410 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-06 06:35:43,412 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:43,435 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-06 06:35:43,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2022-12-06 06:35:43,539 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-06 06:35:43,540 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:35:43,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 06:35:43,555 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-06 06:35:43,555 INFO L188 LiptonReduction]: Number of co-enabled transitions 1906 [2022-12-06 06:35:48,870 INFO L203 LiptonReduction]: Total number of compositions: 81 [2022-12-06 06:35:48,884 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:35:48,889 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;@18762f2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:35:48,890 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:35:48,893 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-06 06:35:48,893 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:35:48,893 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:48,894 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:35:48,894 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:35:48,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:48,898 INFO L85 PathProgramCache]: Analyzing trace with hash 443002296, now seen corresponding path program 1 times [2022-12-06 06:35:48,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:48,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72533775] [2022-12-06 06:35:48,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:48,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:35:49,368 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:35:49,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:35:49,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72533775] [2022-12-06 06:35:49,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72533775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:35:49,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:35:49,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:35:49,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138832548] [2022-12-06 06:35:49,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:35:49,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:35:49,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:35:49,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:35:49,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:35:49,406 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:35:49,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:35:49,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:35:49,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:35:49,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:35:49,735 INFO L130 PetriNetUnfolder]: 879/1434 cut-off events. [2022-12-06 06:35:49,735 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 06:35:49,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2801 conditions, 1434 events. 879/1434 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7495 event pairs, 144 based on Foata normal form. 0/1281 useless extension candidates. Maximal degree in co-relation 2790. Up to 1060 conditions per place. [2022-12-06 06:35:49,751 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 27 selfloop transitions, 2 changer transitions 6/38 dead transitions. [2022-12-06 06:35:49,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 158 flow [2022-12-06 06:35:49,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:35:49,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:35:49,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-06 06:35:49,762 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383 [2022-12-06 06:35:49,763 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 49 transitions. [2022-12-06 06:35:49,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 158 flow [2022-12-06 06:35:49,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:35:49,768 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 52 flow [2022-12-06 06:35:49,769 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2022-12-06 06:35:49,773 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-06 06:35:49,773 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:35:49,774 INFO L89 Accepts]: Start accepts. Operand has 33 places, 21 transitions, 52 flow [2022-12-06 06:35:49,776 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:35:49,776 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:49,776 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 21 transitions, 52 flow [2022-12-06 06:35:49,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 52 flow [2022-12-06 06:35:49,783 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 06:35:49,783 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:35:49,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:35:49,783 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 52 flow [2022-12-06 06:35:49,783 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 06:35:49,868 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:35:49,870 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 06:35:49,870 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 52 flow [2022-12-06 06:35:49,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:35:49,870 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:49,870 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:49,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:35:49,871 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:35:49,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:49,872 INFO L85 PathProgramCache]: Analyzing trace with hash 539521193, now seen corresponding path program 1 times [2022-12-06 06:35:49,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:49,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449209542] [2022-12-06 06:35:49,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:49,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:35:50,430 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:35:50,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:35:50,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449209542] [2022-12-06 06:35:50,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449209542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:35:50,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:35:50,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:35:50,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588609161] [2022-12-06 06:35:50,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:35:50,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:35:50,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:35:50,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:35:50,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:35:50,433 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 06:35:50,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 52 flow. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:35:50,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:35:50,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 06:35:50,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:35:50,704 INFO L130 PetriNetUnfolder]: 1273/1900 cut-off events. [2022-12-06 06:35:50,704 INFO L131 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2022-12-06 06:35:50,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3979 conditions, 1900 events. 1273/1900 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7864 event pairs, 379 based on Foata normal form. 85/1985 useless extension candidates. Maximal degree in co-relation 3969. Up to 1068 conditions per place. [2022-12-06 06:35:50,715 INFO L137 encePairwiseOnDemand]: 11/21 looper letters, 34 selfloop transitions, 9 changer transitions 0/43 dead transitions. [2022-12-06 06:35:50,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 43 transitions, 186 flow [2022-12-06 06:35:50,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:35:50,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:35:50,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-06 06:35:50,717 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2022-12-06 06:35:50,717 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 52 flow. Second operand 4 states and 45 transitions. [2022-12-06 06:35:50,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 43 transitions, 186 flow [2022-12-06 06:35:50,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 43 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:35:50,720 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 116 flow [2022-12-06 06:35:50,720 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2022-12-06 06:35:50,721 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2022-12-06 06:35:50,721 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:35:50,721 INFO L89 Accepts]: Start accepts. Operand has 34 places, 28 transitions, 116 flow [2022-12-06 06:35:50,723 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:35:50,723 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:50,723 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 28 transitions, 116 flow [2022-12-06 06:35:50,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 28 transitions, 116 flow [2022-12-06 06:35:50,782 INFO L130 PetriNetUnfolder]: 215/393 cut-off events. [2022-12-06 06:35:50,782 INFO L131 PetriNetUnfolder]: For 85/91 co-relation queries the response was YES. [2022-12-06 06:35:50,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 393 events. 215/393 cut-off events. For 85/91 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1802 event pairs, 95 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 906. Up to 303 conditions per place. [2022-12-06 06:35:50,785 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 28 transitions, 116 flow [2022-12-06 06:35:50,785 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 06:35:50,829 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:35:50,830 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-06 06:35:50,831 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 116 flow [2022-12-06 06:35:50,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:35:50,831 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:50,831 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:50,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:35:50,831 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:35:50,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:50,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1177191057, now seen corresponding path program 1 times [2022-12-06 06:35:50,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:50,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578086536] [2022-12-06 06:35:50,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:50,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:35:50,988 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:35:50,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:35:50,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578086536] [2022-12-06 06:35:50,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578086536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:35:50,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:35:50,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:35:50,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896941094] [2022-12-06 06:35:50,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:35:50,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:35:50,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:35:50,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:35:50,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:35:50,994 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 06:35:50,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:35:50,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:35:50,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 06:35:50,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:35:51,278 INFO L130 PetriNetUnfolder]: 1317/2037 cut-off events. [2022-12-06 06:35:51,279 INFO L131 PetriNetUnfolder]: For 821/821 co-relation queries the response was YES. [2022-12-06 06:35:51,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5769 conditions, 2037 events. 1317/2037 cut-off events. For 821/821 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9892 event pairs, 162 based on Foata normal form. 60/2097 useless extension candidates. Maximal degree in co-relation 5756. Up to 1060 conditions per place. [2022-12-06 06:35:51,292 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 42 selfloop transitions, 4 changer transitions 16/63 dead transitions. [2022-12-06 06:35:51,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 63 transitions, 386 flow [2022-12-06 06:35:51,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:35:51,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:35:51,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-06 06:35:51,294 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2022-12-06 06:35:51,294 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 116 flow. Second operand 4 states and 50 transitions. [2022-12-06 06:35:51,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 63 transitions, 386 flow [2022-12-06 06:35:51,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 63 transitions, 383 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:35:51,297 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 148 flow [2022-12-06 06:35:51,297 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2022-12-06 06:35:51,297 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-12-06 06:35:51,298 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:35:51,298 INFO L89 Accepts]: Start accepts. Operand has 38 places, 30 transitions, 148 flow [2022-12-06 06:35:51,298 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:35:51,299 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:51,299 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 30 transitions, 148 flow [2022-12-06 06:35:51,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 30 transitions, 148 flow [2022-12-06 06:35:51,368 INFO L130 PetriNetUnfolder]: 168/325 cut-off events. [2022-12-06 06:35:51,368 INFO L131 PetriNetUnfolder]: For 194/209 co-relation queries the response was YES. [2022-12-06 06:35:51,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 325 events. 168/325 cut-off events. For 194/209 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1476 event pairs, 71 based on Foata normal form. 0/309 useless extension candidates. Maximal degree in co-relation 849. Up to 244 conditions per place. [2022-12-06 06:35:51,370 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 30 transitions, 148 flow [2022-12-06 06:35:51,371 INFO L188 LiptonReduction]: Number of co-enabled transitions 224 [2022-12-06 06:35:51,375 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:35:51,376 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 06:35:51,377 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 148 flow [2022-12-06 06:35:51,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:35:51,377 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:51,377 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:51,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:35:51,377 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:35:51,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:51,378 INFO L85 PathProgramCache]: Analyzing trace with hash -2132384892, now seen corresponding path program 1 times [2022-12-06 06:35:51,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:51,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105487209] [2022-12-06 06:35:51,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:51,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:35:51,503 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:35:51,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:35:51,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105487209] [2022-12-06 06:35:51,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105487209] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:35:51,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:35:51,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:35:51,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278320936] [2022-12-06 06:35:51,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:35:51,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:35:51,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:35:51,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:35:51,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:35:51,506 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 06:35:51,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:35:51,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:35:51,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 06:35:51,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:35:51,893 INFO L130 PetriNetUnfolder]: 1460/2309 cut-off events. [2022-12-06 06:35:51,894 INFO L131 PetriNetUnfolder]: For 1848/1848 co-relation queries the response was YES. [2022-12-06 06:35:51,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6755 conditions, 2309 events. 1460/2309 cut-off events. For 1848/1848 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 11992 event pairs, 275 based on Foata normal form. 72/2381 useless extension candidates. Maximal degree in co-relation 6739. Up to 1117 conditions per place. [2022-12-06 06:35:51,907 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 38 selfloop transitions, 5 changer transitions 29/73 dead transitions. [2022-12-06 06:35:51,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 73 transitions, 464 flow [2022-12-06 06:35:51,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:35:51,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:35:51,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-12-06 06:35:51,909 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 06:35:51,909 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 148 flow. Second operand 5 states and 63 transitions. [2022-12-06 06:35:51,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 73 transitions, 464 flow [2022-12-06 06:35:51,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 73 transitions, 451 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 06:35:51,916 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 169 flow [2022-12-06 06:35:51,917 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2022-12-06 06:35:51,918 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2022-12-06 06:35:51,918 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:35:51,918 INFO L89 Accepts]: Start accepts. Operand has 44 places, 30 transitions, 169 flow [2022-12-06 06:35:51,921 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:35:51,921 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:51,921 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 30 transitions, 169 flow [2022-12-06 06:35:51,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 30 transitions, 169 flow [2022-12-06 06:35:51,956 INFO L130 PetriNetUnfolder]: 120/273 cut-off events. [2022-12-06 06:35:51,956 INFO L131 PetriNetUnfolder]: For 372/384 co-relation queries the response was YES. [2022-12-06 06:35:51,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 273 events. 120/273 cut-off events. For 372/384 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1396 event pairs, 66 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 711. Up to 196 conditions per place. [2022-12-06 06:35:51,959 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 30 transitions, 169 flow [2022-12-06 06:35:51,959 INFO L188 LiptonReduction]: Number of co-enabled transitions 212 [2022-12-06 06:35:52,056 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [338] L791-->L794: Formula: (= v_~__unbuffered_p2_EBX~0_1 v_~y~0_4) InVars {~y~0=v_~y~0_4} OutVars{~y~0=v_~y~0_4, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0] and [324] L745-->L752: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_69 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd1~0_14 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_20 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_70 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_57 256) 0)))) (.cse2 (and .cse0 .cse5))) (and (= v_~x$r_buff1_thd1~0_13 (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd1~0_19 256) 0))) (and (not (= 0 (mod v_~x$w_buff1_used~0_56 256))) .cse1)) 0 v_~x$r_buff1_thd1~0_14)) (= v_~x$r_buff0_thd1~0_19 (ite .cse2 0 v_~x$r_buff0_thd1~0_20)) (= v_~x~0_39 (ite .cse3 v_~x$w_buff0~0_21 (ite .cse4 v_~x$w_buff1~0_28 v_~x~0_40))) (= (ite .cse3 0 v_~x$w_buff0_used~0_70) v_~x$w_buff0_used~0_69) (= v_~x$w_buff1_used~0_56 (ite (or .cse4 .cse2) 0 v_~x$w_buff1_used~0_57))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_57, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_14, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_70} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_21, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_56, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_13, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_69} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:35:52,137 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [338] L791-->L794: Formula: (= v_~__unbuffered_p2_EBX~0_1 v_~y~0_4) InVars {~y~0=v_~y~0_4} OutVars{~y~0=v_~y~0_4, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0] and [406] L3-->L834: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_130 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_126 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_231 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_232 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_208 256) 0))))) (and (= v_~x$r_buff0_thd0~0_125 (ite .cse0 0 v_~x$r_buff0_thd0~0_126)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_208) v_~x$w_buff1_used~0_207) (= v_~x$r_buff1_thd0~0_129 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_125 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_207 256) 0)))) 0 v_~x$r_buff1_thd0~0_130)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| 0)) (= v_~x$w_buff0_used~0_231 (ite .cse4 0 v_~x$w_buff0_used~0_232)) (= (ite .cse4 v_~x$w_buff0~0_133 (ite .cse1 v_~x$w_buff1~0_125 v_~x~0_155)) v_~x~0_154)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_133, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_126, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ~x$w_buff1~0=v_~x$w_buff1~0_125, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_208, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_130, ~x~0=v_~x~0_155, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_232} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_133, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_125, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ~x$w_buff1~0=v_~x$w_buff1~0_125, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_207, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_129, ~x~0=v_~x~0_154, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_231} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:35:52,227 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [338] L791-->L794: Formula: (= v_~__unbuffered_p2_EBX~0_1 v_~y~0_4) InVars {~y~0=v_~y~0_4} OutVars{~y~0=v_~y~0_4, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0] and [367] $Ultimate##0-->L742: Formula: (and (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|) (= v_~y~0_34 2)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~y~0=v_~y~0_34, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~y~0, P0Thread1of1ForFork2_~arg.base] [2022-12-06 06:35:52,246 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [338] L791-->L794: Formula: (= v_~__unbuffered_p2_EBX~0_1 v_~y~0_4) InVars {~y~0=v_~y~0_4} OutVars{~y~0=v_~y~0_4, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0] and [332] L774-->L781: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~x$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_93)) (= v_~x$r_buff0_thd2~0_24 (ite .cse1 0 v_~x$r_buff0_thd2~0_25)) (= (ite .cse2 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= v_~x$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_20)) (= v_~x~0_61 (ite .cse2 v_~x$w_buff0~0_33 (ite .cse0 v_~x$w_buff1~0_44 v_~x~0_62)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_44, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_44, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_61, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:35:52,328 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:35:52,329 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 411 [2022-12-06 06:35:52,330 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 187 flow [2022-12-06 06:35:52,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:35:52,330 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:52,330 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:52,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:35:52,330 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:35:52,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:52,331 INFO L85 PathProgramCache]: Analyzing trace with hash -866721729, now seen corresponding path program 1 times [2022-12-06 06:35:52,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:52,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056938667] [2022-12-06 06:35:52,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:52,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:35:53,222 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:35:53,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:35:53,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056938667] [2022-12-06 06:35:53,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056938667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:35:53,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:35:53,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:35:53,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829184510] [2022-12-06 06:35:53,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:35:53,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:35:53,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:35:53,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:35:53,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:35:53,224 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 06:35:53,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 187 flow. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:53,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:35:53,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 06:35:53,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:35:53,636 INFO L130 PetriNetUnfolder]: 1477/2265 cut-off events. [2022-12-06 06:35:53,637 INFO L131 PetriNetUnfolder]: For 4163/4163 co-relation queries the response was YES. [2022-12-06 06:35:53,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7154 conditions, 2265 events. 1477/2265 cut-off events. For 4163/4163 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10809 event pairs, 177 based on Foata normal form. 47/2312 useless extension candidates. Maximal degree in co-relation 7136. Up to 1506 conditions per place. [2022-12-06 06:35:53,651 INFO L137 encePairwiseOnDemand]: 9/25 looper letters, 54 selfloop transitions, 21 changer transitions 0/75 dead transitions. [2022-12-06 06:35:53,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 75 transitions, 594 flow [2022-12-06 06:35:53,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:35:53,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:35:53,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-06 06:35:53,653 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.584 [2022-12-06 06:35:53,653 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 187 flow. Second operand 5 states and 73 transitions. [2022-12-06 06:35:53,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 75 transitions, 594 flow [2022-12-06 06:35:53,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 75 transitions, 535 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-06 06:35:53,669 INFO L231 Difference]: Finished difference. Result has 44 places, 49 transitions, 406 flow [2022-12-06 06:35:53,669 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=406, PETRI_PLACES=44, PETRI_TRANSITIONS=49} [2022-12-06 06:35:53,670 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2022-12-06 06:35:53,670 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:35:53,670 INFO L89 Accepts]: Start accepts. Operand has 44 places, 49 transitions, 406 flow [2022-12-06 06:35:53,671 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:35:53,671 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:53,671 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 49 transitions, 406 flow [2022-12-06 06:35:53,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 49 transitions, 406 flow [2022-12-06 06:35:53,745 INFO L130 PetriNetUnfolder]: 297/584 cut-off events. [2022-12-06 06:35:53,745 INFO L131 PetriNetUnfolder]: For 1347/1460 co-relation queries the response was YES. [2022-12-06 06:35:53,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2099 conditions, 584 events. 297/584 cut-off events. For 1347/1460 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3343 event pairs, 52 based on Foata normal form. 9/570 useless extension candidates. Maximal degree in co-relation 2082. Up to 413 conditions per place. [2022-12-06 06:35:53,752 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 49 transitions, 406 flow [2022-12-06 06:35:53,752 INFO L188 LiptonReduction]: Number of co-enabled transitions 314 [2022-12-06 06:35:53,756 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:35:53,759 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 06:35:53,759 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 49 transitions, 406 flow [2022-12-06 06:35:53,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:35:53,760 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:53,760 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:53,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:35:53,760 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:35:53,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:53,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1103977955, now seen corresponding path program 1 times [2022-12-06 06:35:53,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:53,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071337416] [2022-12-06 06:35:53,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:53,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:35:53,950 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:35:53,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:35:53,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071337416] [2022-12-06 06:35:53,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071337416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:35:53,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:35:53,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:35:53,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505021820] [2022-12-06 06:35:53,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:35:53,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:35:53,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:35:53,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:35:53,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:35:53,953 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 06:35:53,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 49 transitions, 406 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:35:53,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:35:53,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 06:35:53,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:35:54,451 INFO L130 PetriNetUnfolder]: 2169/3406 cut-off events. [2022-12-06 06:35:54,451 INFO L131 PetriNetUnfolder]: For 9772/9836 co-relation queries the response was YES. [2022-12-06 06:35:54,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13016 conditions, 3406 events. 2169/3406 cut-off events. For 9772/9836 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 18729 event pairs, 408 based on Foata normal form. 93/3489 useless extension candidates. Maximal degree in co-relation 12996. Up to 1781 conditions per place. [2022-12-06 06:35:54,476 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 63 selfloop transitions, 5 changer transitions 18/89 dead transitions. [2022-12-06 06:35:54,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 89 transitions, 899 flow [2022-12-06 06:35:54,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:35:54,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:35:54,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-06 06:35:54,478 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 06:35:54,478 INFO L175 Difference]: Start difference. First operand has 44 places, 49 transitions, 406 flow. Second operand 4 states and 55 transitions. [2022-12-06 06:35:54,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 89 transitions, 899 flow [2022-12-06 06:35:54,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 89 transitions, 869 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 06:35:54,502 INFO L231 Difference]: Finished difference. Result has 47 places, 49 transitions, 407 flow [2022-12-06 06:35:54,502 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=407, PETRI_PLACES=47, PETRI_TRANSITIONS=49} [2022-12-06 06:35:54,504 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2022-12-06 06:35:54,504 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:35:54,504 INFO L89 Accepts]: Start accepts. Operand has 47 places, 49 transitions, 407 flow [2022-12-06 06:35:54,506 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:35:54,506 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:54,506 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 49 transitions, 407 flow [2022-12-06 06:35:54,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 49 transitions, 407 flow [2022-12-06 06:35:54,587 INFO L130 PetriNetUnfolder]: 298/594 cut-off events. [2022-12-06 06:35:54,587 INFO L131 PetriNetUnfolder]: For 1263/1338 co-relation queries the response was YES. [2022-12-06 06:35:54,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2213 conditions, 594 events. 298/594 cut-off events. For 1263/1338 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3446 event pairs, 53 based on Foata normal form. 10/585 useless extension candidates. Maximal degree in co-relation 2194. Up to 413 conditions per place. [2022-12-06 06:35:54,592 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 49 transitions, 407 flow [2022-12-06 06:35:54,592 INFO L188 LiptonReduction]: Number of co-enabled transitions 310 [2022-12-06 06:35:54,597 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:35:54,598 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 06:35:54,598 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 49 transitions, 407 flow [2022-12-06 06:35:54,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:35:54,598 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:54,598 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:54,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:35:54,598 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:35:54,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:54,599 INFO L85 PathProgramCache]: Analyzing trace with hash 983619289, now seen corresponding path program 1 times [2022-12-06 06:35:54,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:54,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024750161] [2022-12-06 06:35:54,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:54,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:35:54,817 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:35:54,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:35:54,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024750161] [2022-12-06 06:35:54,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024750161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:35:54,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:35:54,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:35:54,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053614064] [2022-12-06 06:35:54,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:35:54,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:35:54,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:35:54,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:35:54,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:35:54,819 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 06:35:54,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 49 transitions, 407 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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:35:54,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:35:54,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 06:35:54,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:35:54,964 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L745-->L752: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_69 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd1~0_14 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_20 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_70 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_57 256) 0)))) (.cse2 (and .cse0 .cse5))) (and (= v_~x$r_buff1_thd1~0_13 (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd1~0_19 256) 0))) (and (not (= 0 (mod v_~x$w_buff1_used~0_56 256))) .cse1)) 0 v_~x$r_buff1_thd1~0_14)) (= v_~x$r_buff0_thd1~0_19 (ite .cse2 0 v_~x$r_buff0_thd1~0_20)) (= v_~x~0_39 (ite .cse3 v_~x$w_buff0~0_21 (ite .cse4 v_~x$w_buff1~0_28 v_~x~0_40))) (= (ite .cse3 0 v_~x$w_buff0_used~0_70) v_~x$w_buff0_used~0_69) (= v_~x$w_buff1_used~0_56 (ite (or .cse4 .cse2) 0 v_~x$w_buff1_used~0_57))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_57, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_14, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_70} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_21, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_56, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_13, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_69} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][31], [Black: 127#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p2_EBX~0 1))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 1)) (not (= 2 ~x$w_buff1~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p2_EBX~0 1)))), 161#true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 63#L791true, Black: 136#(and (= ~y~0 0) (= ~__unbuffered_p2_EBX~0 0)), 134#(= ~__unbuffered_p2_EBX~0 0), 43#L3true, 173#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 150#true, P1Thread1of1ForFork0InUse, 34#L774true, P0Thread1of1ForFork2InUse, Black: 141#(= 2 ~y~0), P2Thread1of1ForFork1InUse, 93#L752true, Black: 154#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p2_EBX~0 1))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 1)) (not (= 2 ~x$w_buff1~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p2_EBX~0 1)))), Black: 156#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0))]) [2022-12-06 06:35:54,964 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 06:35:54,964 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 06:35:54,964 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 06:35:54,964 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 06:35:54,965 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([444] L791-->L781: Formula: (let ((.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_518 256)))) (.cse3 (not (= (mod v_~x$r_buff1_thd2~0_124 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_155 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_519 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_475 256) 0)) .cse3)) (.cse2 (and .cse5 .cse4))) (and (= v_~x$w_buff0_used~0_518 (ite .cse0 0 v_~x$w_buff0_used~0_519)) (= v_~x$w_buff1_used~0_474 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_475)) (= v_~y~0_152 v_~__unbuffered_p2_EBX~0_111) (= v_~x~0_413 (ite .cse0 v_~x$w_buff0~0_341 (ite .cse1 v_~x$w_buff1~0_313 v_~x~0_414))) (= v_~x$r_buff0_thd2~0_154 (ite .cse2 0 v_~x$r_buff0_thd2~0_155)) (= v_~x$r_buff1_thd2~0_123 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_474 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd2~0_154 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_124))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_341, ~x$w_buff1~0=v_~x$w_buff1~0_313, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_124, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_475, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_155, ~y~0=v_~y~0_152, ~x~0=v_~x~0_414, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_519} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_341, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_111, ~x$w_buff1~0=v_~x$w_buff1~0_313, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_123, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_474, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_154, ~y~0=v_~y~0_152, ~x~0=v_~x~0_413, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_518} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][57], [Black: 150#true, Black: 127#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p2_EBX~0 1))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 1)) (not (= 2 ~x$w_buff1~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p2_EBX~0 1)))), Black: 126#(= ~__unbuffered_p2_EBX~0 0), 154#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p2_EBX~0 1))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 1)) (not (= 2 ~x$w_buff1~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p2_EBX~0 1)))), 161#true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 88#L794true, Black: 136#(and (= ~y~0 0) (= ~__unbuffered_p2_EBX~0 0)), 43#L3true, 173#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 87#L745true, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 141#(= 2 ~y~0), P2Thread1of1ForFork1InUse, 74#L781true, Black: 156#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0))]) [2022-12-06 06:35:54,965 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 06:35:54,965 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 06:35:54,965 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 06:35:54,965 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 06:35:54,965 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L791-->L752: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_510 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd1~0_104 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_104 256) 0)))) (let ((.cse3 (and (not (= (mod v_~x$w_buff0_used~0_511 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_467 256) 0)))) (.cse0 (and .cse2 .cse5))) (and (= v_~x$r_buff0_thd1~0_103 (ite .cse0 0 v_~x$r_buff0_thd1~0_104)) (= v_~x$r_buff1_thd1~0_103 (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_466 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_103 256) 0)) .cse2)) 0 v_~x$r_buff1_thd1~0_104)) (= (ite .cse3 0 v_~x$w_buff0_used~0_511) v_~x$w_buff0_used~0_510) (= (ite .cse3 v_~x$w_buff0~0_337 (ite .cse4 v_~x$w_buff1~0_309 v_~x~0_406)) v_~x~0_405) (= v_~x$w_buff1_used~0_466 (ite (or .cse4 .cse0) 0 v_~x$w_buff1_used~0_467)) (= v_~y~0_144 v_~__unbuffered_p2_EBX~0_105)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_337, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_104, ~x$w_buff1~0=v_~x$w_buff1~0_309, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_467, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_104, ~y~0=v_~y~0_144, ~x~0=v_~x~0_406, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_511} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_337, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_103, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_105, ~x$w_buff1~0=v_~x$w_buff1~0_309, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_466, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_103, ~y~0=v_~y~0_144, ~x~0=v_~x~0_405, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_510} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][58], [Black: 150#true, Black: 127#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p2_EBX~0 1))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 1)) (not (= 2 ~x$w_buff1~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p2_EBX~0 1)))), Black: 126#(= ~__unbuffered_p2_EBX~0 0), 154#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p2_EBX~0 1))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 1)) (not (= 2 ~x$w_buff1~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p2_EBX~0 1)))), 161#true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 88#L794true, Black: 136#(and (= ~y~0 0) (= ~__unbuffered_p2_EBX~0 0)), 43#L3true, 173#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P1Thread1of1ForFork0InUse, 34#L774true, P0Thread1of1ForFork2InUse, Black: 141#(= 2 ~y~0), P2Thread1of1ForFork1InUse, 93#L752true, Black: 156#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0))]) [2022-12-06 06:35:54,965 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 06:35:54,966 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 06:35:54,966 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 06:35:54,966 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 06:35:54,966 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L774-->L781: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~x$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_93)) (= v_~x$r_buff0_thd2~0_24 (ite .cse1 0 v_~x$r_buff0_thd2~0_25)) (= (ite .cse2 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= v_~x$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_20)) (= v_~x~0_61 (ite .cse2 v_~x$w_buff0~0_33 (ite .cse0 v_~x$w_buff1~0_44 v_~x~0_62)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_44, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_44, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_61, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][41], [Black: 127#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p2_EBX~0 1))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 1)) (not (= 2 ~x$w_buff1~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p2_EBX~0 1)))), 161#true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 63#L791true, Black: 136#(and (= ~y~0 0) (= ~__unbuffered_p2_EBX~0 0)), 134#(= ~__unbuffered_p2_EBX~0 0), 43#L3true, 173#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 87#L745true, 150#true, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 141#(= 2 ~y~0), P2Thread1of1ForFork1InUse, 74#L781true, Black: 154#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p2_EBX~0 1))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 1)) (not (= 2 ~x$w_buff1~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p2_EBX~0 1)))), Black: 156#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0))]) [2022-12-06 06:35:54,966 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 06:35:54,966 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 06:35:54,966 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 06:35:54,966 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 06:35:54,967 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([440] L791-->L801: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_506 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_108 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd3~0_112 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_463 256) 0)))) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_507 256) 0)))) (.cse4 (and .cse2 .cse5))) (and (= (ite .cse0 v_~x$w_buff0~0_335 (ite .cse1 v_~x$w_buff1~0_307 v_~x~0_402)) v_~x~0_401) (= v_~x$r_buff1_thd3~0_111 (ite (or (and .cse2 (not (= 0 (mod v_~x$r_buff0_thd3~0_107 256)))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_462 256) 0)))) 0 v_~x$r_buff1_thd3~0_112)) (= (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_463) v_~x$w_buff1_used~0_462) (= v_~y~0_142 v_~__unbuffered_p2_EBX~0_103) (= v_~x$w_buff0_used~0_506 (ite .cse0 0 v_~x$w_buff0_used~0_507)) (= v_~x$r_buff0_thd3~0_107 (ite .cse4 0 v_~x$r_buff0_thd3~0_108))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_335, ~x$w_buff1~0=v_~x$w_buff1~0_307, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_112, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_463, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_108, ~y~0=v_~y~0_142, ~x~0=v_~x~0_402, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_507} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_335, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_103, ~x$w_buff1~0=v_~x$w_buff1~0_307, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_111, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_462, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_107, ~y~0=v_~y~0_142, ~x~0=v_~x~0_401, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_506} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][60], [Black: 150#true, Black: 127#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p2_EBX~0 1))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 1)) (not (= 2 ~x$w_buff1~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p2_EBX~0 1)))), Black: 126#(= ~__unbuffered_p2_EBX~0 0), 154#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p2_EBX~0 1))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 1)) (not (= 2 ~x$w_buff1~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p2_EBX~0 1)))), 161#true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 86#L801true, Black: 136#(and (= ~y~0 0) (= ~__unbuffered_p2_EBX~0 0)), 43#L3true, 173#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 87#L745true, P1Thread1of1ForFork0InUse, 34#L774true, P0Thread1of1ForFork2InUse, Black: 141#(= 2 ~y~0), P2Thread1of1ForFork1InUse, Black: 156#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0))]) [2022-12-06 06:35:54,967 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 06:35:54,967 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 06:35:54,967 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 06:35:54,967 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 06:35:55,151 INFO L130 PetriNetUnfolder]: 1062/1809 cut-off events. [2022-12-06 06:35:55,151 INFO L131 PetriNetUnfolder]: For 6907/6954 co-relation queries the response was YES. [2022-12-06 06:35:55,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7145 conditions, 1809 events. 1062/1809 cut-off events. For 6907/6954 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10212 event pairs, 132 based on Foata normal form. 274/2065 useless extension candidates. Maximal degree in co-relation 7123. Up to 1052 conditions per place. [2022-12-06 06:35:55,173 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 102 selfloop transitions, 8 changer transitions 13/129 dead transitions. [2022-12-06 06:35:55,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 129 transitions, 1329 flow [2022-12-06 06:35:55,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:35:55,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:35:55,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-12-06 06:35:55,177 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.648 [2022-12-06 06:35:55,177 INFO L175 Difference]: Start difference. First operand has 47 places, 49 transitions, 407 flow. Second operand 5 states and 81 transitions. [2022-12-06 06:35:55,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 129 transitions, 1329 flow [2022-12-06 06:35:55,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 129 transitions, 1260 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-06 06:35:55,184 INFO L231 Difference]: Finished difference. Result has 50 places, 56 transitions, 449 flow [2022-12-06 06:35:55,184 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=449, PETRI_PLACES=50, PETRI_TRANSITIONS=56} [2022-12-06 06:35:55,185 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2022-12-06 06:35:55,185 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:35:55,185 INFO L89 Accepts]: Start accepts. Operand has 50 places, 56 transitions, 449 flow [2022-12-06 06:35:55,187 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:35:55,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:55,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 56 transitions, 449 flow [2022-12-06 06:35:55,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 56 transitions, 449 flow [2022-12-06 06:35:55,319 INFO L130 PetriNetUnfolder]: 360/810 cut-off events. [2022-12-06 06:35:55,319 INFO L131 PetriNetUnfolder]: For 2544/2851 co-relation queries the response was YES. [2022-12-06 06:35:55,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3117 conditions, 810 events. 360/810 cut-off events. For 2544/2851 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 5738 event pairs, 89 based on Foata normal form. 113/885 useless extension candidates. Maximal degree in co-relation 3096. Up to 404 conditions per place. [2022-12-06 06:35:55,330 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 56 transitions, 449 flow [2022-12-06 06:35:55,330 INFO L188 LiptonReduction]: Number of co-enabled transitions 456 [2022-12-06 06:35:55,337 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [401] L823-3-->L3: Formula: (and (= v_~main$tmp_guard0~0_20 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_47) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_20 256)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [426] L752-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] [2022-12-06 06:35:55,375 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [401] L823-3-->L3: Formula: (and (= v_~main$tmp_guard0~0_20 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_47) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_20 256)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [416] L781-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res#1.offset_7| 0) (= v_~__unbuffered_cnt~0_65 (+ v_~__unbuffered_cnt~0_66 1)) (= |v_P1Thread1of1ForFork0_#res#1.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_7|, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, P1Thread1of1ForFork0_#res#1.offset] [2022-12-06 06:35:55,414 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [401] L823-3-->L3: Formula: (and (= v_~main$tmp_guard0~0_20 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_47) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_20 256)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [429] L801-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= |v_P2Thread1of1ForFork1_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] [2022-12-06 06:35:55,448 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:35:55,449 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 264 [2022-12-06 06:35:55,449 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 55 transitions, 455 flow [2022-12-06 06:35:55,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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:35:55,449 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:55,450 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:55,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:35:55,450 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:35:55,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:55,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1450546875, now seen corresponding path program 1 times [2022-12-06 06:35:55,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:55,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960106426] [2022-12-06 06:35:55,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:55,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:35:55,597 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:35:55,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:35:55,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960106426] [2022-12-06 06:35:55,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960106426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:35:55,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:35:55,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:35:55,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61049674] [2022-12-06 06:35:55,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:35:55,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:35:55,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:35:55,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:35:55,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:35:55,599 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 06:35:55,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 55 transitions, 455 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:35:55,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:35:55,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 06:35:55,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:35:55,873 INFO L130 PetriNetUnfolder]: 661/1249 cut-off events. [2022-12-06 06:35:55,873 INFO L131 PetriNetUnfolder]: For 5215/5237 co-relation queries the response was YES. [2022-12-06 06:35:55,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5620 conditions, 1249 events. 661/1249 cut-off events. For 5215/5237 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7267 event pairs, 59 based on Foata normal form. 154/1389 useless extension candidates. Maximal degree in co-relation 5596. Up to 548 conditions per place. [2022-12-06 06:35:55,882 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 93 selfloop transitions, 13 changer transitions 21/133 dead transitions. [2022-12-06 06:35:55,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 133 transitions, 1321 flow [2022-12-06 06:35:55,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:35:55,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:35:55,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-12-06 06:35:55,884 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5535714285714286 [2022-12-06 06:35:55,884 INFO L175 Difference]: Start difference. First operand has 49 places, 55 transitions, 455 flow. Second operand 6 states and 93 transitions. [2022-12-06 06:35:55,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 133 transitions, 1321 flow [2022-12-06 06:35:55,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 133 transitions, 1315 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-06 06:35:55,890 INFO L231 Difference]: Finished difference. Result has 57 places, 61 transitions, 548 flow [2022-12-06 06:35:55,890 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=548, PETRI_PLACES=57, PETRI_TRANSITIONS=61} [2022-12-06 06:35:55,891 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2022-12-06 06:35:55,891 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:35:55,891 INFO L89 Accepts]: Start accepts. Operand has 57 places, 61 transitions, 548 flow [2022-12-06 06:35:55,892 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:35:55,892 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:55,892 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 61 transitions, 548 flow [2022-12-06 06:35:55,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 61 transitions, 548 flow [2022-12-06 06:35:55,947 INFO L130 PetriNetUnfolder]: 169/529 cut-off events. [2022-12-06 06:35:55,947 INFO L131 PetriNetUnfolder]: For 2114/2255 co-relation queries the response was YES. [2022-12-06 06:35:55,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2391 conditions, 529 events. 169/529 cut-off events. For 2114/2255 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 3912 event pairs, 18 based on Foata normal form. 31/544 useless extension candidates. Maximal degree in co-relation 2365. Up to 278 conditions per place. [2022-12-06 06:35:55,954 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 61 transitions, 548 flow [2022-12-06 06:35:55,954 INFO L188 LiptonReduction]: Number of co-enabled transitions 428 [2022-12-06 06:35:55,955 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:35:55,956 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-06 06:35:55,956 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 61 transitions, 548 flow [2022-12-06 06:35:55,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:35:55,957 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:55,957 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:55,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:35:55,957 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:35:55,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:55,957 INFO L85 PathProgramCache]: Analyzing trace with hash -2042078924, now seen corresponding path program 1 times [2022-12-06 06:35:55,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:55,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422867609] [2022-12-06 06:35:55,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:55,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:35:56,150 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:35:56,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:35:56,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422867609] [2022-12-06 06:35:56,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422867609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:35:56,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:35:56,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:35:56,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474535131] [2022-12-06 06:35:56,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:35:56,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:35:56,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:35:56,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:35:56,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:35:56,152 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 06:35:56,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 61 transitions, 548 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:35:56,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:35:56,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 06:35:56,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:35:56,430 INFO L130 PetriNetUnfolder]: 590/1146 cut-off events. [2022-12-06 06:35:56,430 INFO L131 PetriNetUnfolder]: For 5448/5469 co-relation queries the response was YES. [2022-12-06 06:35:56,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5746 conditions, 1146 events. 590/1146 cut-off events. For 5448/5469 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 6849 event pairs, 53 based on Foata normal form. 50/1182 useless extension candidates. Maximal degree in co-relation 5717. Up to 488 conditions per place. [2022-12-06 06:35:56,441 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 87 selfloop transitions, 17 changer transitions 20/130 dead transitions. [2022-12-06 06:35:56,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 130 transitions, 1340 flow [2022-12-06 06:35:56,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:35:56,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:35:56,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2022-12-06 06:35:56,443 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42410714285714285 [2022-12-06 06:35:56,443 INFO L175 Difference]: Start difference. First operand has 57 places, 61 transitions, 548 flow. Second operand 8 states and 95 transitions. [2022-12-06 06:35:56,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 130 transitions, 1340 flow [2022-12-06 06:35:56,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 130 transitions, 1264 flow, removed 19 selfloop flow, removed 2 redundant places. [2022-12-06 06:35:56,465 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 506 flow [2022-12-06 06:35:56,465 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=506, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2022-12-06 06:35:56,466 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 29 predicate places. [2022-12-06 06:35:56,466 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:35:56,466 INFO L89 Accepts]: Start accepts. Operand has 65 places, 59 transitions, 506 flow [2022-12-06 06:35:56,468 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:35:56,468 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:35:56,468 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 59 transitions, 506 flow [2022-12-06 06:35:56,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 59 transitions, 506 flow [2022-12-06 06:35:56,512 INFO L130 PetriNetUnfolder]: 122/447 cut-off events. [2022-12-06 06:35:56,513 INFO L131 PetriNetUnfolder]: For 1493/1569 co-relation queries the response was YES. [2022-12-06 06:35:56,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1958 conditions, 447 events. 122/447 cut-off events. For 1493/1569 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 3455 event pairs, 11 based on Foata normal form. 28/461 useless extension candidates. Maximal degree in co-relation 1929. Up to 123 conditions per place. [2022-12-06 06:35:56,518 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 59 transitions, 506 flow [2022-12-06 06:35:56,519 INFO L188 LiptonReduction]: Number of co-enabled transitions 412 [2022-12-06 06:35:56,519 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:35:56,520 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-06 06:35:56,520 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 506 flow [2022-12-06 06:35:56,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:35:56,521 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:35:56,521 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:35:56,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:35:56,521 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:35:56,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:35:56,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1515842224, now seen corresponding path program 1 times [2022-12-06 06:35:56,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:35:56,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691274661] [2022-12-06 06:35:56,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:35:56,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:35:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:35:56,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:35:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:35:56,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:35:56,625 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:35:56,626 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:35:56,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:35:56,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:35:56,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:35:56,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:35:56,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:35:56,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:35:56,628 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:35:56,633 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:35:56,633 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:35:56,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:35:56 BasicIcfg [2022-12-06 06:35:56,717 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:35:56,718 INFO L158 Benchmark]: Toolchain (without parser) took 14891.70ms. Allocated memory was 194.0MB in the beginning and 521.1MB in the end (delta: 327.2MB). Free memory was 153.5MB in the beginning and 298.2MB in the end (delta: -144.7MB). Peak memory consumption was 183.9MB. Max. memory is 8.0GB. [2022-12-06 06:35:56,718 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 194.0MB. Free memory was 170.4MB in the beginning and 170.3MB in the end (delta: 80.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:35:56,718 INFO L158 Benchmark]: CACSL2BoogieTranslator took 592.60ms. Allocated memory is still 194.0MB. Free memory was 153.3MB in the beginning and 127.1MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 06:35:56,718 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.15ms. Allocated memory is still 194.0MB. Free memory was 127.1MB in the beginning and 124.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:35:56,719 INFO L158 Benchmark]: Boogie Preprocessor took 24.79ms. Allocated memory is still 194.0MB. Free memory was 124.5MB in the beginning and 122.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:35:56,719 INFO L158 Benchmark]: RCFGBuilder took 716.43ms. Allocated memory is still 194.0MB. Free memory was 122.4MB in the beginning and 86.7MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-06 06:35:56,719 INFO L158 Benchmark]: TraceAbstraction took 13472.05ms. Allocated memory was 194.0MB in the beginning and 521.1MB in the end (delta: 327.2MB). Free memory was 86.2MB in the beginning and 298.2MB in the end (delta: -211.9MB). Peak memory consumption was 116.8MB. Max. memory is 8.0GB. [2022-12-06 06:35:56,720 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 194.0MB. Free memory was 170.4MB in the beginning and 170.3MB in the end (delta: 80.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 592.60ms. Allocated memory is still 194.0MB. Free memory was 153.3MB in the beginning and 127.1MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 79.15ms. Allocated memory is still 194.0MB. Free memory was 127.1MB in the beginning and 124.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.79ms. Allocated memory is still 194.0MB. Free memory was 124.5MB in the beginning and 122.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 716.43ms. Allocated memory is still 194.0MB. Free memory was 122.4MB in the beginning and 86.7MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 13472.05ms. Allocated memory was 194.0MB in the beginning and 521.1MB in the end (delta: 327.2MB). Free memory was 86.2MB in the beginning and 298.2MB in the end (delta: -211.9MB). Peak memory consumption was 116.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 112 PlacesBefore, 36 PlacesAfterwards, 104 TransitionsBefore, 27 TransitionsAfterwards, 1906 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1295, independent: 1241, independent conditional: 1241, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1295, independent: 1241, independent conditional: 0, independent unconditional: 1241, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1295, independent: 1241, independent conditional: 0, independent unconditional: 1241, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1295, independent: 1241, independent conditional: 0, independent unconditional: 1241, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1125, independent: 1085, independent conditional: 0, independent unconditional: 1085, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1125, independent: 1061, independent conditional: 0, independent unconditional: 1061, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 64, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 308, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 272, dependent conditional: 0, dependent unconditional: 272, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1295, independent: 156, independent conditional: 0, independent unconditional: 156, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 1125, unknown conditional: 0, unknown unconditional: 1125] , Statistics on independence cache: Total cache size (in pairs): 1654, Positive cache size: 1614, Positive conditional cache size: 0, Positive unconditional cache size: 1614, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, 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, 30 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, independent: 64, independent conditional: 64, 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: 86, independent: 64, independent conditional: 8, independent unconditional: 56, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 86, independent: 64, independent conditional: 8, independent unconditional: 56, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 86, independent: 64, independent conditional: 8, independent unconditional: 56, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 77, independent: 62, independent conditional: 7, independent unconditional: 55, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 77, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 74, dependent conditional: 14, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 86, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 77, unknown conditional: 9, unknown unconditional: 68] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 62, Positive conditional cache size: 7, Positive unconditional cache size: 55, Negative cache size: 15, Negative conditional cache size: 2, Negative unconditional cache size: 13, 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, 34 PlacesBefore, 34 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, independent: 55, independent conditional: 55, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 62, independent: 55, independent conditional: 11, independent unconditional: 44, dependent: 7, dependent conditional: 3, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 62, independent: 55, independent conditional: 9, independent unconditional: 46, dependent: 7, dependent conditional: 3, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 62, independent: 55, independent conditional: 9, independent unconditional: 46, dependent: 7, dependent conditional: 3, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 6, independent unconditional: 10, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 62, independent: 39, independent conditional: 3, independent unconditional: 36, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 18, unknown conditional: 8, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 78, Positive conditional cache size: 13, Positive unconditional cache size: 65, Negative cache size: 17, Negative conditional cache size: 4, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 224 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, independent: 53, independent conditional: 53, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 61, independent: 53, independent conditional: 4, independent unconditional: 49, dependent: 8, dependent conditional: 1, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 61, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 8, dependent conditional: 1, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 61, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 8, dependent conditional: 1, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 2, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 61, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 79, Positive conditional cache size: 13, Positive unconditional cache size: 66, Negative cache size: 18, Negative conditional cache size: 5, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 42 PlacesBefore, 41 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 212 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 118, independent: 99, independent conditional: 99, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 118, independent: 99, independent conditional: 32, independent unconditional: 67, dependent: 19, dependent conditional: 9, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 118, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 19, dependent conditional: 7, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 118, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 19, dependent conditional: 7, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 9, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 118, independent: 92, independent conditional: 0, independent unconditional: 92, dependent: 17, dependent conditional: 7, dependent unconditional: 10, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 91, Positive conditional cache size: 13, Positive unconditional cache size: 78, Negative cache size: 20, Negative conditional cache size: 5, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 71, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 71, independent: 64, independent conditional: 31, independent unconditional: 33, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 71, independent: 64, independent conditional: 15, independent unconditional: 49, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 71, independent: 64, independent conditional: 15, independent unconditional: 49, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 71, independent: 64, independent conditional: 15, independent unconditional: 49, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 91, Positive conditional cache size: 13, Positive unconditional cache size: 78, Negative cache size: 20, Negative conditional cache size: 5, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 310 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 41, independent conditional: 26, independent unconditional: 15, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 41, independent conditional: 11, independent unconditional: 30, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 41, independent conditional: 11, independent unconditional: 30, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 48, independent: 41, independent conditional: 11, independent unconditional: 30, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 91, Positive conditional cache size: 13, Positive unconditional cache size: 78, Negative cache size: 20, Negative conditional cache size: 5, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 56 TransitionsBefore, 55 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, independent: 96, independent conditional: 96, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 96, independent: 96, independent conditional: 96, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 96, independent: 96, independent conditional: 96, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 96, independent: 96, independent conditional: 96, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 96, independent: 91, independent conditional: 91, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 102, Positive conditional cache size: 18, Positive unconditional cache size: 84, Negative cache size: 20, Negative conditional cache size: 5, Negative unconditional cache size: 15, 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, 57 PlacesBefore, 57 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 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] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 102, Positive conditional cache size: 18, Positive unconditional cache size: 84, Negative cache size: 20, Negative conditional cache size: 5, Negative unconditional cache size: 15, 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.0s, 64 PlacesBefore, 64 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 412 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 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] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 102, Positive conditional cache size: 18, Positive unconditional cache size: 84, Negative cache size: 20, Negative conditional cache size: 5, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1876; [L819] FCALL, FORK 0 pthread_create(&t1876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1876, ((void *)0), P0, ((void *)0))=-2, t1876={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L820] 0 pthread_t t1877; [L821] FCALL, FORK 0 pthread_create(&t1877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1877, ((void *)0), P1, ((void *)0))=-1, t1876={5:0}, t1877={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L822] 0 pthread_t t1878; [L823] FCALL, FORK 0 pthread_create(&t1878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1878, ((void *)0), P2, ((void *)0))=0, t1876={5:0}, t1877={6:0}, t1878={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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L793] 3 __unbuffered_p2_EBX = y [L741] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L747] 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) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 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 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 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=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L776] 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) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 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 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 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_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L796] 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) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 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 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 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 [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 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 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 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 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876={5:0}, t1877={6:0}, t1878={3: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 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) [L841] 0 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)) [L842] 0 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)) [L843] 0 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)) [L844] 0 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)) [L845] 0 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)) [L846] 0 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)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] - 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: 821]: 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: 819]: 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: 823]: 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 7 procedures, 134 locations, 6 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: 13.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 306 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 306 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 710 IncrementalHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 10 mSDtfsCounter, 710 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=548occurred in iteration=8, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 606 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:35:56,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...