/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe002_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:47:49,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:47:49,847 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:47:49,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:47:49,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:47:49,881 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:47:49,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:47:49,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:47:49,889 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:47:49,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:47:49,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:47:49,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:47:49,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:47:49,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:47:49,899 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:47:49,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:47:49,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:47:49,902 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:47:49,905 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:47:49,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:47:49,907 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:47:49,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:47:49,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:47:49,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:47:49,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:47:49,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:47:49,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:47:49,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:47:49,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:47:49,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:47:49,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:47:49,915 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:47:49,915 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:47:49,915 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:47:49,916 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:47:49,916 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:47:49,916 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:47:49,917 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:47:49,917 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:47:49,917 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:47:49,918 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:47:49,922 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:47:49,974 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:47:49,974 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:47:49,976 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:47:49,976 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:47:49,976 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:47:49,977 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:47:49,977 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:47:49,977 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:47:49,977 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:47:49,977 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:47:49,978 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:47:49,978 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:47:49,978 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:47:49,978 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:47:49,978 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:47:49,978 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:47:49,978 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:47:49,978 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:47:49,979 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:47:49,979 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:47:49,979 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:47:49,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:47:49,979 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:47:49,979 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:47:49,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:47:49,979 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:47:49,979 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:47:49,980 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:47:49,980 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 00:47:50,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:47:50,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:47:50,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:47:50,260 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:47:50,260 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:47:50,261 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_power.oepc.i [2022-12-13 00:47:51,267 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:47:51,496 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:47:51,496 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.oepc.i [2022-12-13 00:47:51,510 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fbf02cf6/c5e460e5619c4158b7d39d184134a92d/FLAG2f945b65c [2022-12-13 00:47:51,524 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fbf02cf6/c5e460e5619c4158b7d39d184134a92d [2022-12-13 00:47:51,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:47:51,527 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:47:51,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:47:51,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:47:51,531 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:47:51,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:47:51" (1/1) ... [2022-12-13 00:47:51,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50267aba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:51, skipping insertion in model container [2022-12-13 00:47:51,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:47:51" (1/1) ... [2022-12-13 00:47:51,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:47:51,579 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:47:51,688 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/safe002_power.oepc.i[995,1008] [2022-12-13 00:47:51,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:47:51,909 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:47:51,917 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/safe002_power.oepc.i[995,1008] [2022-12-13 00:47:51,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:51,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:51,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:47:52,017 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:47:52,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:52 WrapperNode [2022-12-13 00:47:52,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:47:52,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:47:52,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:47:52,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:47:52,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:52" (1/1) ... [2022-12-13 00:47:52,055 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:52" (1/1) ... [2022-12-13 00:47:52,084 INFO L138 Inliner]: procedures = 176, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 167 [2022-12-13 00:47:52,085 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:47:52,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:47:52,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:47:52,086 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:47:52,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:52" (1/1) ... [2022-12-13 00:47:52,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:52" (1/1) ... [2022-12-13 00:47:52,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:52" (1/1) ... [2022-12-13 00:47:52,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:52" (1/1) ... [2022-12-13 00:47:52,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:52" (1/1) ... [2022-12-13 00:47:52,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:52" (1/1) ... [2022-12-13 00:47:52,123 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:52" (1/1) ... [2022-12-13 00:47:52,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:52" (1/1) ... [2022-12-13 00:47:52,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:47:52,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:47:52,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:47:52,130 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:47:52,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:52" (1/1) ... [2022-12-13 00:47:52,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:47:52,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:47:52,184 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 00:47:52,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 00:47:52,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 00:47:52,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:47:52,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:47:52,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:47:52,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:47:52,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:47:52,245 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:47:52,245 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:47:52,245 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:47:52,245 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:47:52,245 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:47:52,245 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:47:52,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:47:52,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:47:52,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:47:52,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:47:52,247 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:47:52,362 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:47:52,364 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:47:52,721 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:47:53,014 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:47:53,014 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:47:53,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:47:53 BoogieIcfgContainer [2022-12-13 00:47:53,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:47:53,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:47:53,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:47:53,021 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:47:53,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:47:51" (1/3) ... [2022-12-13 00:47:53,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a55ef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:47:53, skipping insertion in model container [2022-12-13 00:47:53,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:52" (2/3) ... [2022-12-13 00:47:53,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a55ef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:47:53, skipping insertion in model container [2022-12-13 00:47:53,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:47:53" (3/3) ... [2022-12-13 00:47:53,022 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_power.oepc.i [2022-12-13 00:47:53,037 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:47:53,037 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 00:47:53,037 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:47:53,093 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:47:53,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-12-13 00:47:53,193 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-13 00:47:53,193 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:47:53,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-13 00:47:53,197 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2022-12-13 00:47:53,200 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 110 transitions, 229 flow [2022-12-13 00:47:53,201 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:53,212 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-13 00:47:53,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 110 transitions, 229 flow [2022-12-13 00:47:53,232 INFO L130 PetriNetUnfolder]: 1/110 cut-off events. [2022-12-13 00:47:53,232 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:47:53,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 1/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-12-13 00:47:53,234 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-13 00:47:53,234 INFO L226 LiptonReduction]: Number of co-enabled transitions 1212 [2022-12-13 00:48:01,198 INFO L241 LiptonReduction]: Total number of compositions: 91 [2022-12-13 00:48:01,218 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:48:01,235 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;@15e01122, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:48:01,235 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 00:48:01,242 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-13 00:48:01,242 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:48:01,242 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:01,243 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:01,243 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:48:01,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:01,246 INFO L85 PathProgramCache]: Analyzing trace with hash -327056317, now seen corresponding path program 1 times [2022-12-13 00:48:01,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:01,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168142080] [2022-12-13 00:48:01,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:01,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:01,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:48:01,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:01,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168142080] [2022-12-13 00:48:01,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168142080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:01,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:01,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:48:01,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648807198] [2022-12-13 00:48:01,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:01,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 00:48:01,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:01,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 00:48:01,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 00:48:01,457 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2022-12-13 00:48:01,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 69 flow. Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:01,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:01,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2022-12-13 00:48:01,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:01,745 INFO L130 PetriNetUnfolder]: 909/1441 cut-off events. [2022-12-13 00:48:01,746 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-13 00:48:01,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2854 conditions, 1441 events. 909/1441 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7295 event pairs, 909 based on Foata normal form. 0/1144 useless extension candidates. Maximal degree in co-relation 2843. Up to 1359 conditions per place. [2022-12-13 00:48:01,761 INFO L137 encePairwiseOnDemand]: 29/30 looper letters, 20 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2022-12-13 00:48:01,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 107 flow [2022-12-13 00:48:01,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 00:48:01,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 00:48:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2022-12-13 00:48:01,769 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-13 00:48:01,771 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 69 flow. Second operand 2 states and 39 transitions. [2022-12-13 00:48:01,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 107 flow [2022-12-13 00:48:01,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:48:01,774 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 64 flow [2022-12-13 00:48:01,775 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2022-12-13 00:48:01,778 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2022-12-13 00:48:01,778 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:01,778 INFO L89 Accepts]: Start accepts. Operand has 37 places, 29 transitions, 64 flow [2022-12-13 00:48:01,780 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:01,780 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:01,780 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 29 transitions, 64 flow [2022-12-13 00:48:01,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 64 flow [2022-12-13 00:48:01,786 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-13 00:48:01,786 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:48:01,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 57 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-13 00:48:01,788 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 64 flow [2022-12-13 00:48:01,788 INFO L226 LiptonReduction]: Number of co-enabled transitions 462 [2022-12-13 00:48:02,058 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:48:02,059 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 281 [2022-12-13 00:48:02,059 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 64 flow [2022-12-13 00:48:02,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:02,059 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:02,060 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:02,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:48:02,060 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:48:02,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:02,060 INFO L85 PathProgramCache]: Analyzing trace with hash -768516302, now seen corresponding path program 1 times [2022-12-13 00:48:02,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:02,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042058142] [2022-12-13 00:48:02,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:02,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:02,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:48:02,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:02,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042058142] [2022-12-13 00:48:02,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042058142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:02,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:02,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:48:02,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360418378] [2022-12-13 00:48:02,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:02,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:48:02,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:02,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:48:02,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:48:02,413 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2022-12-13 00:48:02,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:02,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:02,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2022-12-13 00:48:02,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:02,703 INFO L130 PetriNetUnfolder]: 858/1442 cut-off events. [2022-12-13 00:48:02,704 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:48:02,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 1442 events. 858/1442 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7776 event pairs, 202 based on Foata normal form. 20/1186 useless extension candidates. Maximal degree in co-relation 2773. Up to 1037 conditions per place. [2022-12-13 00:48:02,718 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 27 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2022-12-13 00:48:02,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 38 transitions, 140 flow [2022-12-13 00:48:02,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:48:02,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:48:02,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-12-13 00:48:02,720 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6551724137931034 [2022-12-13 00:48:02,720 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 64 flow. Second operand 3 states and 57 transitions. [2022-12-13 00:48:02,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 38 transitions, 140 flow [2022-12-13 00:48:02,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:48:02,722 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 72 flow [2022-12-13 00:48:02,722 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2022-12-13 00:48:02,723 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2022-12-13 00:48:02,723 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:02,723 INFO L89 Accepts]: Start accepts. Operand has 39 places, 29 transitions, 72 flow [2022-12-13 00:48:02,724 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:02,724 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:02,724 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 72 flow [2022-12-13 00:48:02,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 72 flow [2022-12-13 00:48:02,733 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-13 00:48:02,733 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:48:02,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 61 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:48:02,735 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 72 flow [2022-12-13 00:48:02,735 INFO L226 LiptonReduction]: Number of co-enabled transitions 458 [2022-12-13 00:48:02,737 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:48:02,739 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 00:48:02,740 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 72 flow [2022-12-13 00:48:02,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:02,740 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:02,740 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:02,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:48:02,740 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:48:02,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:02,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1945798015, now seen corresponding path program 1 times [2022-12-13 00:48:02,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:02,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078641101] [2022-12-13 00:48:02,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:02,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:03,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:48:03,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:03,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078641101] [2022-12-13 00:48:03,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078641101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:03,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:03,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:48:03,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635093141] [2022-12-13 00:48:03,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:03,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:48:03,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:03,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:48:03,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:48:03,193 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2022-12-13 00:48:03,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:03,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:03,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2022-12-13 00:48:03,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:03,467 INFO L130 PetriNetUnfolder]: 807/1336 cut-off events. [2022-12-13 00:48:03,467 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2022-12-13 00:48:03,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2787 conditions, 1336 events. 807/1336 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6856 event pairs, 444 based on Foata normal form. 20/1090 useless extension candidates. Maximal degree in co-relation 2776. Up to 1025 conditions per place. [2022-12-13 00:48:03,477 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 32 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2022-12-13 00:48:03,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 175 flow [2022-12-13 00:48:03,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:48:03,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:48:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-12-13 00:48:03,479 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7126436781609196 [2022-12-13 00:48:03,479 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 72 flow. Second operand 3 states and 62 transitions. [2022-12-13 00:48:03,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 175 flow [2022-12-13 00:48:03,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 169 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:48:03,481 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 76 flow [2022-12-13 00:48:03,482 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2022-12-13 00:48:03,482 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2022-12-13 00:48:03,483 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:03,483 INFO L89 Accepts]: Start accepts. Operand has 40 places, 29 transitions, 76 flow [2022-12-13 00:48:03,483 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:03,486 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:03,487 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 29 transitions, 76 flow [2022-12-13 00:48:03,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 76 flow [2022-12-13 00:48:03,492 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-13 00:48:03,492 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 00:48:03,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 29 events. 0/29 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 63 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:48:03,493 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 76 flow [2022-12-13 00:48:03,493 INFO L226 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-13 00:48:03,497 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:48:03,498 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 00:48:03,498 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 76 flow [2022-12-13 00:48:03,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:03,498 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:03,498 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:03,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:48:03,499 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:48:03,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:03,499 INFO L85 PathProgramCache]: Analyzing trace with hash 186909271, now seen corresponding path program 1 times [2022-12-13 00:48:03,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:03,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377463637] [2022-12-13 00:48:03,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:03,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:05,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:48:05,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:05,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377463637] [2022-12-13 00:48:05,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377463637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:05,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:05,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:48:05,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936566103] [2022-12-13 00:48:05,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:05,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:48:05,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:05,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:48:05,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:48:05,006 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2022-12-13 00:48:05,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:05,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:05,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2022-12-13 00:48:05,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:05,553 INFO L130 PetriNetUnfolder]: 1984/3240 cut-off events. [2022-12-13 00:48:05,553 INFO L131 PetriNetUnfolder]: For 626/626 co-relation queries the response was YES. [2022-12-13 00:48:05,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7020 conditions, 3240 events. 1984/3240 cut-off events. For 626/626 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 20069 event pairs, 490 based on Foata normal form. 96/2727 useless extension candidates. Maximal degree in co-relation 7008. Up to 1432 conditions per place. [2022-12-13 00:48:05,568 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 41 selfloop transitions, 15 changer transitions 0/63 dead transitions. [2022-12-13 00:48:05,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 63 transitions, 268 flow [2022-12-13 00:48:05,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:48:05,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:48:05,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2022-12-13 00:48:05,571 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6413793103448275 [2022-12-13 00:48:05,571 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 76 flow. Second operand 5 states and 93 transitions. [2022-12-13 00:48:05,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 63 transitions, 268 flow [2022-12-13 00:48:05,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 63 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:48:05,573 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 168 flow [2022-12-13 00:48:05,573 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2022-12-13 00:48:05,575 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 5 predicate places. [2022-12-13 00:48:05,575 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:05,575 INFO L89 Accepts]: Start accepts. Operand has 44 places, 41 transitions, 168 flow [2022-12-13 00:48:05,576 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:05,576 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:05,576 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 41 transitions, 168 flow [2022-12-13 00:48:05,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 41 transitions, 168 flow [2022-12-13 00:48:05,636 INFO L130 PetriNetUnfolder]: 131/426 cut-off events. [2022-12-13 00:48:05,637 INFO L131 PetriNetUnfolder]: For 104/104 co-relation queries the response was YES. [2022-12-13 00:48:05,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 426 events. 131/426 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2838 event pairs, 35 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 853. Up to 183 conditions per place. [2022-12-13 00:48:05,640 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 41 transitions, 168 flow [2022-12-13 00:48:05,640 INFO L226 LiptonReduction]: Number of co-enabled transitions 596 [2022-12-13 00:48:05,643 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:48:05,649 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-13 00:48:05,649 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 168 flow [2022-12-13 00:48:05,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:05,649 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:05,650 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:05,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:48:05,650 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:48:05,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:05,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1638877682, now seen corresponding path program 1 times [2022-12-13 00:48:05,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:05,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516035682] [2022-12-13 00:48:05,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:05,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:06,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:48:06,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:06,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516035682] [2022-12-13 00:48:06,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516035682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:06,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:06,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:48:06,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612995386] [2022-12-13 00:48:06,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:06,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:48:06,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:06,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:48:06,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:48:06,108 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2022-12-13 00:48:06,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 168 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:06,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:06,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2022-12-13 00:48:06,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:06,695 INFO L130 PetriNetUnfolder]: 2639/4298 cut-off events. [2022-12-13 00:48:06,695 INFO L131 PetriNetUnfolder]: For 2302/2302 co-relation queries the response was YES. [2022-12-13 00:48:06,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11351 conditions, 4298 events. 2639/4298 cut-off events. For 2302/2302 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 27986 event pairs, 512 based on Foata normal form. 72/3516 useless extension candidates. Maximal degree in co-relation 11337. Up to 2236 conditions per place. [2022-12-13 00:48:06,709 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 50 selfloop transitions, 6 changer transitions 13/76 dead transitions. [2022-12-13 00:48:06,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 76 transitions, 450 flow [2022-12-13 00:48:06,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:48:06,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:48:06,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-13 00:48:06,713 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6551724137931034 [2022-12-13 00:48:06,714 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 168 flow. Second operand 4 states and 76 transitions. [2022-12-13 00:48:06,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 76 transitions, 450 flow [2022-12-13 00:48:06,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 76 transitions, 449 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:48:06,720 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 212 flow [2022-12-13 00:48:06,720 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2022-12-13 00:48:06,721 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2022-12-13 00:48:06,721 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:06,721 INFO L89 Accepts]: Start accepts. Operand has 48 places, 43 transitions, 212 flow [2022-12-13 00:48:06,722 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:06,722 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:06,722 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 43 transitions, 212 flow [2022-12-13 00:48:06,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 43 transitions, 212 flow [2022-12-13 00:48:06,766 INFO L130 PetriNetUnfolder]: 100/322 cut-off events. [2022-12-13 00:48:06,766 INFO L131 PetriNetUnfolder]: For 195/197 co-relation queries the response was YES. [2022-12-13 00:48:06,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 322 events. 100/322 cut-off events. For 195/197 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1857 event pairs, 19 based on Foata normal form. 2/250 useless extension candidates. Maximal degree in co-relation 780. Up to 142 conditions per place. [2022-12-13 00:48:06,769 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 43 transitions, 212 flow [2022-12-13 00:48:06,769 INFO L226 LiptonReduction]: Number of co-enabled transitions 600 [2022-12-13 00:48:06,770 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:48:06,772 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-13 00:48:06,772 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 212 flow [2022-12-13 00:48:06,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:06,772 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:06,772 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:06,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:48:06,772 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:48:06,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:06,773 INFO L85 PathProgramCache]: Analyzing trace with hash -114677928, now seen corresponding path program 2 times [2022-12-13 00:48:06,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:06,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547334284] [2022-12-13 00:48:06,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:06,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:07,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:48:07,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:07,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547334284] [2022-12-13 00:48:07,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547334284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:07,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:07,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 00:48:07,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787753597] [2022-12-13 00:48:07,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:07,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 00:48:07,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:07,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 00:48:07,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-13 00:48:07,833 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2022-12-13 00:48:07,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 212 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:07,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:07,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2022-12-13 00:48:07,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:08,256 INFO L130 PetriNetUnfolder]: 1347/2265 cut-off events. [2022-12-13 00:48:08,257 INFO L131 PetriNetUnfolder]: For 2630/2630 co-relation queries the response was YES. [2022-12-13 00:48:08,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6764 conditions, 2265 events. 1347/2265 cut-off events. For 2630/2630 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13550 event pairs, 169 based on Foata normal form. 72/1883 useless extension candidates. Maximal degree in co-relation 6747. Up to 1115 conditions per place. [2022-12-13 00:48:08,268 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 44 selfloop transitions, 6 changer transitions 19/76 dead transitions. [2022-12-13 00:48:08,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 76 transitions, 489 flow [2022-12-13 00:48:08,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:48:08,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:48:08,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-13 00:48:08,269 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6068965517241379 [2022-12-13 00:48:08,269 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 212 flow. Second operand 5 states and 88 transitions. [2022-12-13 00:48:08,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 76 transitions, 489 flow [2022-12-13 00:48:08,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 76 transitions, 476 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 00:48:08,272 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 209 flow [2022-12-13 00:48:08,272 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=209, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2022-12-13 00:48:08,273 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 14 predicate places. [2022-12-13 00:48:08,273 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:08,273 INFO L89 Accepts]: Start accepts. Operand has 53 places, 40 transitions, 209 flow [2022-12-13 00:48:08,274 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:08,274 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:08,274 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 40 transitions, 209 flow [2022-12-13 00:48:08,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 40 transitions, 209 flow [2022-12-13 00:48:08,306 INFO L130 PetriNetUnfolder]: 75/225 cut-off events. [2022-12-13 00:48:08,307 INFO L131 PetriNetUnfolder]: For 252/254 co-relation queries the response was YES. [2022-12-13 00:48:08,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 225 events. 75/225 cut-off events. For 252/254 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1112 event pairs, 13 based on Foata normal form. 2/183 useless extension candidates. Maximal degree in co-relation 611. Up to 104 conditions per place. [2022-12-13 00:48:08,309 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 40 transitions, 209 flow [2022-12-13 00:48:08,309 INFO L226 LiptonReduction]: Number of co-enabled transitions 518 [2022-12-13 00:48:08,310 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:48:08,311 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-13 00:48:08,311 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 209 flow [2022-12-13 00:48:08,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:08,311 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:08,311 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:08,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:48:08,311 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:48:08,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:08,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1263075610, now seen corresponding path program 1 times [2022-12-13 00:48:08,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:08,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566622608] [2022-12-13 00:48:08,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:08,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:08,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:48:08,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:08,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566622608] [2022-12-13 00:48:08,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566622608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:08,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:08,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:48:08,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520113219] [2022-12-13 00:48:08,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:08,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:48:08,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:08,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:48:08,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:48:08,491 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2022-12-13 00:48:08,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 209 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:08,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:08,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2022-12-13 00:48:08,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:08,932 INFO L130 PetriNetUnfolder]: 1799/2861 cut-off events. [2022-12-13 00:48:08,932 INFO L131 PetriNetUnfolder]: For 5436/5484 co-relation queries the response was YES. [2022-12-13 00:48:08,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8740 conditions, 2861 events. 1799/2861 cut-off events. For 5436/5484 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 16673 event pairs, 455 based on Foata normal form. 283/2158 useless extension candidates. Maximal degree in co-relation 8720. Up to 2125 conditions per place. [2022-12-13 00:48:08,946 INFO L137 encePairwiseOnDemand]: 17/29 looper letters, 67 selfloop transitions, 17 changer transitions 9/101 dead transitions. [2022-12-13 00:48:08,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 101 transitions, 652 flow [2022-12-13 00:48:08,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:48:08,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:48:08,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-12-13 00:48:08,948 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7034482758620689 [2022-12-13 00:48:08,948 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 209 flow. Second operand 5 states and 102 transitions. [2022-12-13 00:48:08,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 101 transitions, 652 flow [2022-12-13 00:48:08,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 101 transitions, 597 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-12-13 00:48:08,954 INFO L231 Difference]: Finished difference. Result has 53 places, 56 transitions, 321 flow [2022-12-13 00:48:08,954 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=321, PETRI_PLACES=53, PETRI_TRANSITIONS=56} [2022-12-13 00:48:08,955 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 14 predicate places. [2022-12-13 00:48:08,955 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:08,955 INFO L89 Accepts]: Start accepts. Operand has 53 places, 56 transitions, 321 flow [2022-12-13 00:48:08,955 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:08,956 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:08,956 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 56 transitions, 321 flow [2022-12-13 00:48:08,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 56 transitions, 321 flow [2022-12-13 00:48:09,071 INFO L130 PetriNetUnfolder]: 820/1505 cut-off events. [2022-12-13 00:48:09,071 INFO L131 PetriNetUnfolder]: For 1872/2113 co-relation queries the response was YES. [2022-12-13 00:48:09,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4870 conditions, 1505 events. 820/1505 cut-off events. For 1872/2113 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 10291 event pairs, 379 based on Foata normal form. 24/829 useless extension candidates. Maximal degree in co-relation 4853. Up to 1057 conditions per place. [2022-12-13 00:48:09,081 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 56 transitions, 321 flow [2022-12-13 00:48:09,081 INFO L226 LiptonReduction]: Number of co-enabled transitions 704 [2022-12-13 00:48:09,097 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [806] L858-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15| (mod v_~main$tmp_guard0~0_22 256)) (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_63) 1 0) 0) 0 1) v_~main$tmp_guard0~0_22)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [812] L781-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_13| 0) (= |v_P0Thread1of1ForFork1_#res.offset_13| 0) (= (+ v_~__unbuffered_cnt~0_82 1) v_~__unbuffered_cnt~0_81)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_13|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-13 00:48:09,122 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [806] L858-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15| (mod v_~main$tmp_guard0~0_22 256)) (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_63) 1 0) 0) 0 1) v_~main$tmp_guard0~0_22)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [732] L803-->L806: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:48:09,140 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [806] L858-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15| (mod v_~main$tmp_guard0~0_22 256)) (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_63) 1 0) 0) 0 1) v_~main$tmp_guard0~0_22)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [758] L803-->P1FINAL: Formula: (and (= v_~__unbuffered_cnt~0_29 (+ v_~__unbuffered_cnt~0_30 1)) (= |v_P1Thread1of1ForFork2_#res.base_5| 0) (= |v_P1Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-13 00:48:09,165 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [806] L858-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15| (mod v_~main$tmp_guard0~0_22 256)) (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_63) 1 0) 0) 0 1) v_~main$tmp_guard0~0_22)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [817] L803-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_114 1) v_~__unbuffered_cnt~0_113) (= |v_P1Thread1of1ForFork2_#res.base_15| 0) (= 0 |v_P1Thread1of1ForFork2_#res.offset_15|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_114} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-13 00:48:09,189 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [806] L858-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15| (mod v_~main$tmp_guard0~0_22 256)) (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_63) 1 0) 0) 0 1) v_~main$tmp_guard0~0_22)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [725] L781-->L786: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:48:09,205 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [806] L858-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15| (mod v_~main$tmp_guard0~0_22 256)) (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_63) 1 0) 0) 0 1) v_~main$tmp_guard0~0_22)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [778] L781-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork1_#res.offset_5| 0) (= |v_P0Thread1of1ForFork1_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-13 00:48:09,234 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:48:09,235 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 280 [2022-12-13 00:48:09,235 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 55 transitions, 339 flow [2022-12-13 00:48:09,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:09,235 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:09,236 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:09,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:48:09,236 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:48:09,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:09,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1463731135, now seen corresponding path program 1 times [2022-12-13 00:48:09,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:09,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525717504] [2022-12-13 00:48:09,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:09,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:09,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:48:09,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:09,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525717504] [2022-12-13 00:48:09,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525717504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:09,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:09,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:48:09,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614506294] [2022-12-13 00:48:09,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:09,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:48:09,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:09,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:48:09,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:48:09,404 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 00:48:09,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 55 transitions, 339 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:09,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:09,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 00:48:09,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:10,039 INFO L130 PetriNetUnfolder]: 3112/5122 cut-off events. [2022-12-13 00:48:10,039 INFO L131 PetriNetUnfolder]: For 8845/9201 co-relation queries the response was YES. [2022-12-13 00:48:10,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20035 conditions, 5122 events. 3112/5122 cut-off events. For 8845/9201 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 33014 event pairs, 844 based on Foata normal form. 160/4187 useless extension candidates. Maximal degree in co-relation 20015. Up to 3016 conditions per place. [2022-12-13 00:48:10,079 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 79 selfloop transitions, 2 changer transitions 5/99 dead transitions. [2022-12-13 00:48:10,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 99 transitions, 802 flow [2022-12-13 00:48:10,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:48:10,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:48:10,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-12-13 00:48:10,080 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2022-12-13 00:48:10,080 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 339 flow. Second operand 4 states and 90 transitions. [2022-12-13 00:48:10,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 99 transitions, 802 flow [2022-12-13 00:48:10,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 99 transitions, 754 flow, removed 15 selfloop flow, removed 1 redundant places. [2022-12-13 00:48:10,087 INFO L231 Difference]: Finished difference. Result has 56 places, 56 transitions, 330 flow [2022-12-13 00:48:10,087 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=330, PETRI_PLACES=56, PETRI_TRANSITIONS=56} [2022-12-13 00:48:10,088 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 17 predicate places. [2022-12-13 00:48:10,088 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:10,088 INFO L89 Accepts]: Start accepts. Operand has 56 places, 56 transitions, 330 flow [2022-12-13 00:48:10,088 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:10,089 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:10,089 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 56 transitions, 330 flow [2022-12-13 00:48:10,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 56 transitions, 330 flow [2022-12-13 00:48:10,330 INFO L130 PetriNetUnfolder]: 1603/2884 cut-off events. [2022-12-13 00:48:10,330 INFO L131 PetriNetUnfolder]: For 3738/4854 co-relation queries the response was YES. [2022-12-13 00:48:10,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9383 conditions, 2884 events. 1603/2884 cut-off events. For 3738/4854 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 21273 event pairs, 730 based on Foata normal form. 11/1465 useless extension candidates. Maximal degree in co-relation 9364. Up to 2059 conditions per place. [2022-12-13 00:48:10,348 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 56 transitions, 330 flow [2022-12-13 00:48:10,348 INFO L226 LiptonReduction]: Number of co-enabled transitions 674 [2022-12-13 00:48:10,351 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:48:10,352 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 264 [2022-12-13 00:48:10,352 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 56 transitions, 330 flow [2022-12-13 00:48:10,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:10,352 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:10,352 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:10,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:48:10,352 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:48:10,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:10,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1405989513, now seen corresponding path program 2 times [2022-12-13 00:48:10,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:10,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262159383] [2022-12-13 00:48:10,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:10,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:10,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:48:10,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:10,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262159383] [2022-12-13 00:48:10,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262159383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:10,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:10,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:48:10,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32789634] [2022-12-13 00:48:10,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:10,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:48:10,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:10,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:48:10,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:48:10,506 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2022-12-13 00:48:10,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 56 transitions, 330 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:10,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:10,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2022-12-13 00:48:10,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:11,031 INFO L130 PetriNetUnfolder]: 2303/4107 cut-off events. [2022-12-13 00:48:11,031 INFO L131 PetriNetUnfolder]: For 8114/8316 co-relation queries the response was YES. [2022-12-13 00:48:11,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16366 conditions, 4107 events. 2303/4107 cut-off events. For 8114/8316 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 29088 event pairs, 166 based on Foata normal form. 420/2989 useless extension candidates. Maximal degree in co-relation 16344. Up to 2569 conditions per place. [2022-12-13 00:48:11,047 INFO L137 encePairwiseOnDemand]: 17/35 looper letters, 61 selfloop transitions, 32 changer transitions 17/118 dead transitions. [2022-12-13 00:48:11,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 118 transitions, 894 flow [2022-12-13 00:48:11,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:48:11,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:48:11,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2022-12-13 00:48:11,049 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6095238095238096 [2022-12-13 00:48:11,049 INFO L175 Difference]: Start difference. First operand has 56 places, 56 transitions, 330 flow. Second operand 6 states and 128 transitions. [2022-12-13 00:48:11,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 118 transitions, 894 flow [2022-12-13 00:48:11,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 118 transitions, 889 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:48:11,056 INFO L231 Difference]: Finished difference. Result has 62 places, 70 transitions, 539 flow [2022-12-13 00:48:11,056 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=539, PETRI_PLACES=62, PETRI_TRANSITIONS=70} [2022-12-13 00:48:11,056 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 23 predicate places. [2022-12-13 00:48:11,056 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:11,056 INFO L89 Accepts]: Start accepts. Operand has 62 places, 70 transitions, 539 flow [2022-12-13 00:48:11,057 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:11,057 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:11,057 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 70 transitions, 539 flow [2022-12-13 00:48:11,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 70 transitions, 539 flow [2022-12-13 00:48:11,227 INFO L130 PetriNetUnfolder]: 823/2008 cut-off events. [2022-12-13 00:48:11,227 INFO L131 PetriNetUnfolder]: For 5570/7952 co-relation queries the response was YES. [2022-12-13 00:48:11,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9182 conditions, 2008 events. 823/2008 cut-off events. For 5570/7952 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 17719 event pairs, 154 based on Foata normal form. 23/1086 useless extension candidates. Maximal degree in co-relation 9160. Up to 1480 conditions per place. [2022-12-13 00:48:11,240 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 70 transitions, 539 flow [2022-12-13 00:48:11,241 INFO L226 LiptonReduction]: Number of co-enabled transitions 776 [2022-12-13 00:48:11,781 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [730] L793-->L795: Formula: (= |v_#memory_int_11| (store |v_#memory_int_12| |v_~#y~0.base_10| (store (select |v_#memory_int_12| |v_~#y~0.base_10|) |v_~#y~0.offset_10| 1))) InVars {#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} OutVars{#memory_int=|v_#memory_int_11|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} AuxVars[] AssignedVars[#memory_int] and [801] $Ultimate##0-->L826: Formula: (let ((.cse11 (= (mod v_~y$w_buff1_used~0_325 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_87 256) 0)) (.cse9 (= (mod v_~y$r_buff0_thd3~0_98 256) 0)) (.cse16 (= (mod v_~y$w_buff0_used~0_331 256) 0))) (let ((.cse12 (not .cse16)) (.cse10 (not .cse9)) (.cse6 (and .cse9 .cse5)) (.cse7 (and .cse9 .cse11)) (.cse1 (= (mod v_~weak$$choice2~0_150 256) 0)) (.cse15 (select |v_#memory_int_393| |v_~#y~0.base_256|))) (let ((.cse3 (= (mod v_~y$w_buff1_used~0_324 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_330 256) 0)) (.cse8 (select .cse15 |v_~#y~0.offset_256|)) (.cse0 (not .cse1)) (.cse14 (or .cse6 .cse16 .cse7)) (.cse13 (and .cse12 .cse10))) (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P2Thread1of1ForFork0_#t~nondet22_10| v_~weak$$choice0~0_109) (= v_~weak$$choice2~0_150 |v_P2Thread1of1ForFork0_#t~nondet23_10|) (or (and (= |v_P2_#t~ite29_33| v_~y$mem_tmp~0_70) .cse0 (= |v_P2Thread1of1ForFork0_#t~mem28_10| |v_P2_#t~mem28_32|)) (and .cse1 (= |v_P2_#t~mem28_32| v_~__unbuffered_p2_EAX~0_38) (= |v_P2_#t~ite29_33| |v_P2_#t~mem28_32|))) (= v_~y$w_buff0~0_194 v_~y$w_buff0~0_193) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= (ite .cse0 v_~y$r_buff1_thd3~0_87 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_97 256) 0))) (or (and .cse2 .cse3) .cse4 (and .cse5 .cse2))) v_~y$r_buff1_thd3~0_87 0)) v_~y$r_buff1_thd3~0_86) (= v_~y$flush_delayed~0_120 0) (= v_~y$w_buff1_used~0_324 (ite .cse0 v_~y$w_buff1_used~0_325 (ite (or .cse6 .cse4 .cse7) v_~y$w_buff1_used~0_325 0))) (= .cse8 v_~y$mem_tmp~0_70) (= v_~y$r_buff0_thd3~0_97 (ite .cse0 v_~y$r_buff0_thd3~0_98 (ite (or .cse6 .cse4 (and .cse9 .cse3)) v_~y$r_buff0_thd3~0_98 (ite (and (not .cse4) .cse10) 0 v_~y$r_buff0_thd3~0_98)))) (= v_~y$w_buff1~0_206 v_~y$w_buff1~0_205) (or (and (or .cse10 (not .cse11)) (= |v_P2Thread1of1ForFork0_#t~mem25_10| |v_P2_#t~mem25_42|) (or .cse10 (not .cse5)) .cse12 (= (ite .cse13 v_~y$w_buff0~0_194 v_~y$w_buff1~0_206) v_~__unbuffered_p2_EAX~0_38)) (and (= |v_P2_#t~mem25_42| v_~__unbuffered_p2_EAX~0_38) (= .cse8 |v_P2_#t~mem25_42|) .cse14)) (= (ite .cse0 v_~y$w_buff0_used~0_331 (ite .cse14 v_~y$w_buff0_used~0_331 (ite .cse13 0 v_~y$w_buff0_used~0_331))) v_~y$w_buff0_used~0_330) (= (store |v_#memory_int_393| |v_~#y~0.base_256| (store .cse15 |v_~#y~0.offset_256| |v_P2_#t~ite29_33|)) |v_#memory_int_392|))))) InVars {~#y~0.offset=|v_~#y~0.offset_256|, P2Thread1of1ForFork0_#t~nondet22=|v_P2Thread1of1ForFork0_#t~nondet22_10|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_331, P2Thread1of1ForFork0_#t~mem28=|v_P2Thread1of1ForFork0_#t~mem28_10|, ~#y~0.base=|v_~#y~0.base_256|, P2Thread1of1ForFork0_#t~nondet23=|v_P2Thread1of1ForFork0_#t~nondet23_10|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_206, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_98, ~y$w_buff0~0=v_~y$w_buff0~0_194, #memory_int=|v_#memory_int_393|, P2Thread1of1ForFork0_#t~mem25=|v_P2Thread1of1ForFork0_#t~mem25_10|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_325} OutVars{~#y~0.offset=|v_~#y~0.offset_256|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_330, ~#y~0.base=|v_~#y~0.base_256|, P2Thread1of1ForFork0_#t~ite26=|v_P2Thread1of1ForFork0_#t~ite26_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_70, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_86, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_97, ~y$w_buff0~0=v_~y$w_buff0~0_193, ~y$flush_delayed~0=v_~y$flush_delayed~0_120, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#t~mem27=|v_P2Thread1of1ForFork0_#t~mem27_7|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~weak$$choice0~0=v_~weak$$choice0~0_109, ~y$w_buff1~0=v_~y$w_buff1~0_205, #memory_int=|v_#memory_int_392|, P2Thread1of1ForFork0_#t~mem24=|v_P2Thread1of1ForFork0_#t~mem24_7|, ~weak$$choice2~0=v_~weak$$choice2~0_150, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_324} AuxVars[|v_P2_#t~ite29_33|, |v_P2_#t~mem28_32|, |v_P2_#t~mem25_42|] AssignedVars[P2Thread1of1ForFork0_#t~nondet22, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~mem27, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~mem28, P2Thread1of1ForFork0_#t~nondet23, P2Thread1of1ForFork0_#t~ite26, ~weak$$choice0~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, #memory_int, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~mem25, P2Thread1of1ForFork0_#t~mem24, P2Thread1of1ForFork0_#t~ite29, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-13 00:48:12,248 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:48:12,249 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1193 [2022-12-13 00:48:12,249 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 65 transitions, 485 flow [2022-12-13 00:48:12,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:12,249 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:12,249 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:12,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:48:12,250 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:48:12,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:12,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1684447802, now seen corresponding path program 1 times [2022-12-13 00:48:12,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:12,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163791097] [2022-12-13 00:48:12,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:12,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:12,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:48:12,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:12,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163791097] [2022-12-13 00:48:12,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163791097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:12,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:12,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:48:12,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994365939] [2022-12-13 00:48:12,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:12,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:48:12,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:12,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:48:12,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:48:12,470 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2022-12-13 00:48:12,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 65 transitions, 485 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:12,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:12,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2022-12-13 00:48:12,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:12,880 INFO L130 PetriNetUnfolder]: 1145/2290 cut-off events. [2022-12-13 00:48:12,880 INFO L131 PetriNetUnfolder]: For 6706/6800 co-relation queries the response was YES. [2022-12-13 00:48:12,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10938 conditions, 2290 events. 1145/2290 cut-off events. For 6706/6800 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 16488 event pairs, 13 based on Foata normal form. 243/1717 useless extension candidates. Maximal degree in co-relation 10913. Up to 1387 conditions per place. [2022-12-13 00:48:12,891 INFO L137 encePairwiseOnDemand]: 18/33 looper letters, 46 selfloop transitions, 35 changer transitions 19/106 dead transitions. [2022-12-13 00:48:12,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 106 transitions, 923 flow [2022-12-13 00:48:12,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 00:48:12,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 00:48:12,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2022-12-13 00:48:12,892 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5037878787878788 [2022-12-13 00:48:12,892 INFO L175 Difference]: Start difference. First operand has 62 places, 65 transitions, 485 flow. Second operand 8 states and 133 transitions. [2022-12-13 00:48:12,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 106 transitions, 923 flow [2022-12-13 00:48:12,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 106 transitions, 808 flow, removed 31 selfloop flow, removed 5 redundant places. [2022-12-13 00:48:12,925 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 461 flow [2022-12-13 00:48:12,925 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=461, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2022-12-13 00:48:12,925 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 28 predicate places. [2022-12-13 00:48:12,925 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:12,926 INFO L89 Accepts]: Start accepts. Operand has 67 places, 61 transitions, 461 flow [2022-12-13 00:48:12,926 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:12,926 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:12,926 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 61 transitions, 461 flow [2022-12-13 00:48:12,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 61 transitions, 461 flow [2022-12-13 00:48:12,971 INFO L130 PetriNetUnfolder]: 157/563 cut-off events. [2022-12-13 00:48:12,971 INFO L131 PetriNetUnfolder]: For 1384/2041 co-relation queries the response was YES. [2022-12-13 00:48:12,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2443 conditions, 563 events. 157/563 cut-off events. For 1384/2041 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 4101 event pairs, 1 based on Foata normal form. 9/324 useless extension candidates. Maximal degree in co-relation 2421. Up to 271 conditions per place. [2022-12-13 00:48:12,976 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 61 transitions, 461 flow [2022-12-13 00:48:12,976 INFO L226 LiptonReduction]: Number of co-enabled transitions 484 [2022-12-13 00:48:18,669 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 00:48:18,669 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5744 [2022-12-13 00:48:18,670 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 417 flow [2022-12-13 00:48:18,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:18,670 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:18,670 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:18,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:48:18,670 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:48:18,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:18,670 INFO L85 PathProgramCache]: Analyzing trace with hash -2115995727, now seen corresponding path program 1 times [2022-12-13 00:48:18,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:18,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851430642] [2022-12-13 00:48:18,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:18,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:48:18,720 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:48:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:48:18,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:48:18,807 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:48:18,808 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 00:48:18,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 00:48:18,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 00:48:18,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 00:48:18,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:48:18,816 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:18,821 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:48:18,821 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:48:18,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:48:18 BasicIcfg [2022-12-13 00:48:18,901 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:48:18,902 INFO L158 Benchmark]: Toolchain (without parser) took 27374.75ms. Allocated memory was 188.7MB in the beginning and 980.4MB in the end (delta: 791.7MB). Free memory was 163.1MB in the beginning and 425.5MB in the end (delta: -262.4MB). Peak memory consumption was 530.3MB. Max. memory is 8.0GB. [2022-12-13 00:48:18,902 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 188.7MB. Free memory was 166.5MB in the beginning and 166.4MB in the end (delta: 70.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:48:18,902 INFO L158 Benchmark]: CACSL2BoogieTranslator took 488.53ms. Allocated memory is still 188.7MB. Free memory was 163.1MB in the beginning and 133.6MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-13 00:48:18,902 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.43ms. Allocated memory is still 188.7MB. Free memory was 133.6MB in the beginning and 131.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:48:18,902 INFO L158 Benchmark]: Boogie Preprocessor took 44.25ms. Allocated memory is still 188.7MB. Free memory was 131.1MB in the beginning and 128.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 00:48:18,902 INFO L158 Benchmark]: RCFGBuilder took 886.25ms. Allocated memory was 188.7MB in the beginning and 254.8MB in the end (delta: 66.1MB). Free memory was 128.5MB in the beginning and 186.0MB in the end (delta: -57.6MB). Peak memory consumption was 56.7MB. Max. memory is 8.0GB. [2022-12-13 00:48:18,903 INFO L158 Benchmark]: TraceAbstraction took 25882.87ms. Allocated memory was 254.8MB in the beginning and 980.4MB in the end (delta: 725.6MB). Free memory was 184.5MB in the beginning and 425.5MB in the end (delta: -241.0MB). Peak memory consumption was 486.2MB. Max. memory is 8.0GB. [2022-12-13 00:48:18,904 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.10ms. Allocated memory is still 188.7MB. Free memory was 166.5MB in the beginning and 166.4MB in the end (delta: 70.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 488.53ms. Allocated memory is still 188.7MB. Free memory was 163.1MB in the beginning and 133.6MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.43ms. Allocated memory is still 188.7MB. Free memory was 133.6MB in the beginning and 131.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.25ms. Allocated memory is still 188.7MB. Free memory was 131.1MB in the beginning and 128.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 886.25ms. Allocated memory was 188.7MB in the beginning and 254.8MB in the end (delta: 66.1MB). Free memory was 128.5MB in the beginning and 186.0MB in the end (delta: -57.6MB). Peak memory consumption was 56.7MB. Max. memory is 8.0GB. * TraceAbstraction took 25882.87ms. Allocated memory was 254.8MB in the beginning and 980.4MB in the end (delta: 725.6MB). Free memory was 184.5MB in the beginning and 425.5MB in the end (delta: -241.0MB). Peak memory consumption was 486.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.0s, 119 PlacesBefore, 39 PlacesAfterwards, 110 TransitionsBefore, 30 TransitionsAfterwards, 1212 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 57 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 91 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1225, independent: 1158, independent conditional: 1158, independent unconditional: 0, dependent: 67, dependent conditional: 67, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1225, independent: 1158, independent conditional: 0, independent unconditional: 1158, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1225, independent: 1158, independent conditional: 0, independent unconditional: 1158, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1225, independent: 1158, independent conditional: 0, independent unconditional: 1158, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 915, independent: 872, independent conditional: 0, independent unconditional: 872, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 915, independent: 832, independent conditional: 0, independent unconditional: 832, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 83, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 345, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 311, dependent conditional: 0, dependent unconditional: 311, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1225, independent: 286, independent conditional: 0, independent unconditional: 286, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 915, unknown conditional: 0, unknown unconditional: 915] , Statistics on independence cache: Total cache size (in pairs): 1293, Positive cache size: 1250, Positive conditional cache size: 0, Positive unconditional cache size: 1250, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, 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.3s, 36 PlacesBefore, 36 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 462 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 141, independent: 109, independent conditional: 109, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 141, independent: 109, independent conditional: 0, independent unconditional: 109, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 141, independent: 109, independent conditional: 0, independent unconditional: 109, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 141, independent: 109, independent conditional: 0, independent unconditional: 109, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 121, independent: 97, independent conditional: 0, independent unconditional: 97, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 121, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 266, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 252, dependent conditional: 0, dependent unconditional: 252, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 141, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 121, unknown conditional: 0, unknown unconditional: 121] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 97, Positive conditional cache size: 0, Positive unconditional cache size: 97, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, 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, 39 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 137, independent: 107, independent conditional: 107, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 137, independent: 107, independent conditional: 0, independent unconditional: 107, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 137, independent: 107, independent conditional: 0, independent unconditional: 107, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 137, independent: 107, independent conditional: 0, independent unconditional: 107, dependent: 30, dependent conditional: 0, dependent unconditional: 30, 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: 137, independent: 107, independent conditional: 0, independent unconditional: 107, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 97, Positive conditional cache size: 0, Positive unconditional cache size: 97, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, 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, 40 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 142, independent: 113, independent conditional: 113, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 142, independent: 113, independent conditional: 8, independent unconditional: 105, dependent: 29, dependent conditional: 14, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 142, independent: 113, independent conditional: 0, independent unconditional: 113, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 142, independent: 113, independent conditional: 0, independent unconditional: 113, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 142, independent: 107, independent conditional: 0, independent unconditional: 107, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 103, Positive conditional cache size: 0, Positive unconditional cache size: 103, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 596 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 95, independent: 83, independent conditional: 83, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 95, independent: 83, independent conditional: 42, independent unconditional: 41, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 95, independent: 83, independent conditional: 32, independent unconditional: 51, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 95, independent: 83, independent conditional: 32, independent unconditional: 51, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 95, independent: 82, independent conditional: 32, independent unconditional: 50, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 104, Positive conditional cache size: 0, Positive unconditional cache size: 104, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 600 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 83, independent: 68, independent conditional: 29, independent unconditional: 39, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 83, independent: 68, independent conditional: 15, independent unconditional: 53, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 83, independent: 68, independent conditional: 15, independent unconditional: 53, dependent: 15, dependent conditional: 0, dependent unconditional: 15, 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: 83, independent: 68, independent conditional: 15, independent unconditional: 53, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 104, Positive conditional cache size: 0, Positive unconditional cache size: 104, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 518 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 59, independent conditional: 59, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 59, independent conditional: 22, independent unconditional: 37, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, independent: 59, independent conditional: 11, independent unconditional: 48, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 59, independent conditional: 11, independent unconditional: 48, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 72, independent: 57, independent conditional: 11, independent unconditional: 46, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 106, Positive conditional cache size: 0, Positive unconditional cache size: 106, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 53 PlacesBefore, 52 PlacesAfterwards, 56 TransitionsBefore, 55 TransitionsAfterwards, 704 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 214, independent: 188, independent conditional: 188, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 214, independent: 188, independent conditional: 140, independent unconditional: 48, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 214, independent: 188, independent conditional: 118, independent unconditional: 70, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 214, independent: 188, independent conditional: 118, independent unconditional: 70, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 214, independent: 180, independent conditional: 110, independent unconditional: 70, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 117, Positive conditional cache size: 8, Positive unconditional cache size: 109, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 674 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): 141, Positive cache size: 117, Positive conditional cache size: 8, Positive unconditional cache size: 109, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, 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: 1.0s, 62 PlacesBefore, 62 PlacesAfterwards, 70 TransitionsBefore, 65 TransitionsAfterwards, 776 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, independent: 65, independent conditional: 65, 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: 65, independent: 65, independent conditional: 56, independent unconditional: 9, 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: 65, independent: 65, independent conditional: 51, independent unconditional: 14, 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: 65, independent: 65, independent conditional: 51, independent unconditional: 14, 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: 48, independent: 48, independent conditional: 35, independent unconditional: 13, 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: 48, independent: 48, independent conditional: 0, independent unconditional: 48, 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: 65, independent: 17, independent conditional: 16, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 48, unknown conditional: 35, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 170, Positive conditional cache size: 44, Positive unconditional cache size: 126, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 64 PlacesBefore, 60 PlacesAfterwards, 61 TransitionsBefore, 54 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 120, independent: 118, independent conditional: 118, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 120, independent: 118, independent conditional: 112, independent unconditional: 6, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 120, independent: 118, independent conditional: 101, independent unconditional: 17, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 120, independent: 118, independent conditional: 101, independent unconditional: 17, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 65, independent: 64, independent conditional: 59, independent unconditional: 5, 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: 65, independent: 64, independent conditional: 0, independent unconditional: 64, 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: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 120, independent: 54, independent conditional: 42, independent unconditional: 12, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 65, unknown conditional: 60, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 283, Positive conditional cache size: 105, Positive unconditional cache size: 178, Negative cache size: 25, Negative conditional cache size: 1, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1825; [L854] FCALL, FORK 0 pthread_create(&t1825, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1825, ((void *)0), P0, ((void *)0))=-1, t1825={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L855] 0 pthread_t t1826; [L856] FCALL, FORK 0 pthread_create(&t1826, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1826, ((void *)0), P1, ((void *)0))=0, t1825={7:0}, t1826={5:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L857] 0 pthread_t t1827; [L780] 1 __unbuffered_p0_EBX = x [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L858] FCALL, FORK 0 pthread_create(&t1827, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1827, ((void *)0), P2, ((void *)0))=1, t1825={7:0}, t1826={5:0}, t1827={6:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 2 x = 1 [L795] 2 y = 1 [L812] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 2 y$flush_delayed = weak$$choice2 [L815] EXPR 2 \read(y) [L815] 2 y$mem_tmp = y [L816] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] EXPR 2 \read(y) [L816] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 2 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L817] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L818] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L819] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L820] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 2 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L822] 2 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] EXPR 2 \read(y) [L823] 2 __unbuffered_p2_EAX = y [L824] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L824] 2 y = y$flush_delayed ? y$mem_tmp : y [L825] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=2, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L798] EXPR 2 \read(y) [L798] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L798] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L799] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=2, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L828] 3 y = 2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=2, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L831] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L831] EXPR 3 \read(y) [L831] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L831] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L834] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=2, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=2, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=2, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 \read(y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] EXPR 0 \read(y) [L874] 0 y$mem_tmp = y [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] EXPR 0 \read(y) [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 \read(y) [L884] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] 0 y = y$flush_delayed ? y$mem_tmp : y [L886] 0 y$flush_delayed = (_Bool)0 [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=1, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 858]: 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: 854]: 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: 856]: 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, 150 locations, 4 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: 25.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 342 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 342 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 784 IncrementalHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 3 mSDtfsCounter, 784 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=539occurred in iteration=9, InterpolantAutomatonStates: 45, 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.4s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 825 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-13 00:48:18,951 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...