/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe014_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:28:38,916 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:28:38,918 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:28:38,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:28:38,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:28:38,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:28:38,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:28:38,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:28:38,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:28:38,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:28:38,968 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:28:38,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:28:38,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:28:38,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:28:38,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:28:38,970 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:28:38,971 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:28:38,971 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:28:38,972 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:28:38,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:28:38,974 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:28:38,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:28:38,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:28:38,989 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:28:38,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:28:39,000 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:28:39,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:28:39,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:28:39,002 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:28:39,002 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:28:39,002 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:28:39,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:28:39,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:28:39,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:28:39,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:28:39,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:28:39,034 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:28:39,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:28:39,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:28:39,034 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:28:39,035 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:28:39,036 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:28:39,072 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:28:39,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:28:39,074 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:28:39,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:28:39,074 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:28:39,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:28:39,075 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:28:39,075 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:28:39,075 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:28:39,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:28:39,076 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:28:39,076 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:28:39,076 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:28:39,076 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:28:39,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:28:39,077 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:28:39,077 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:28:39,077 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:28:39,077 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:28:39,077 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:28:39,077 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:28:39,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:28:39,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:28:39,078 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:28:39,078 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:28:39,078 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:28:39,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:28:39,078 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:28:39,078 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:28:39,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:28:39,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:28:39,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:28:39,402 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:28:39,403 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:28:39,404 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe014_power.opt.i [2022-12-06 04:28:40,382 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:28:40,666 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:28:40,666 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_power.opt.i [2022-12-06 04:28:40,684 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fd769e8a/bde50a7983994a5d9d54e4c4bd65f399/FLAG969f18bc2 [2022-12-06 04:28:40,700 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fd769e8a/bde50a7983994a5d9d54e4c4bd65f399 [2022-12-06 04:28:40,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:28:40,703 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:28:40,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:28:40,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:28:40,706 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:28:40,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:28:40" (1/1) ... [2022-12-06 04:28:40,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@338689a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:40, skipping insertion in model container [2022-12-06 04:28:40,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:28:40" (1/1) ... [2022-12-06 04:28:40,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:28:40,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:28:40,913 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/safe014_power.opt.i[994,1007] [2022-12-06 04:28:41,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:28:41,107 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:28:41,117 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/safe014_power.opt.i[994,1007] [2022-12-06 04:28:41,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:28:41,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:28:41,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:28:41,207 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:28:41,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:41 WrapperNode [2022-12-06 04:28:41,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:28:41,208 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:28:41,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:28:41,209 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:28:41,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:41" (1/1) ... [2022-12-06 04:28:41,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:41" (1/1) ... [2022-12-06 04:28:41,266 INFO L138 Inliner]: procedures = 176, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 180 [2022-12-06 04:28:41,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:28:41,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:28:41,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:28:41,268 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:28:41,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:41" (1/1) ... [2022-12-06 04:28:41,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:41" (1/1) ... [2022-12-06 04:28:41,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:41" (1/1) ... [2022-12-06 04:28:41,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:41" (1/1) ... [2022-12-06 04:28:41,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:41" (1/1) ... [2022-12-06 04:28:41,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:41" (1/1) ... [2022-12-06 04:28:41,297 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:41" (1/1) ... [2022-12-06 04:28:41,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:41" (1/1) ... [2022-12-06 04:28:41,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:28:41,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:28:41,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:28:41,322 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:28:41,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:41" (1/1) ... [2022-12-06 04:28:41,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:28:41,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:28:41,373 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:28:41,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:28:41,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:28:41,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:28:41,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:28:41,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:28:41,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:28:41,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:28:41,432 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:28:41,432 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:28:41,432 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:28:41,432 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:28:41,432 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:28:41,432 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:28:41,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:28:41,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:28:41,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:28:41,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:28:41,435 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:28:41,593 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:28:41,595 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:28:42,052 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:28:42,267 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:28:42,267 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:28:42,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:28:42 BoogieIcfgContainer [2022-12-06 04:28:42,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:28:42,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:28:42,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:28:42,274 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:28:42,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:28:40" (1/3) ... [2022-12-06 04:28:42,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c196bfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:28:42, skipping insertion in model container [2022-12-06 04:28:42,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:28:41" (2/3) ... [2022-12-06 04:28:42,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c196bfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:28:42, skipping insertion in model container [2022-12-06 04:28:42,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:28:42" (3/3) ... [2022-12-06 04:28:42,276 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_power.opt.i [2022-12-06 04:28:42,290 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:28:42,290 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:28:42,290 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:28:42,348 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:28:42,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-12-06 04:28:42,415 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-06 04:28:42,415 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:28:42,421 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 54 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-06 04:28:42,421 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2022-12-06 04:28:42,426 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 122 transitions, 253 flow [2022-12-06 04:28:42,428 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:42,443 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 122 transitions, 253 flow [2022-12-06 04:28:42,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 253 flow [2022-12-06 04:28:42,494 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-06 04:28:42,494 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:28:42,495 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 54 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-06 04:28:42,498 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 122 transitions, 253 flow [2022-12-06 04:28:42,499 INFO L188 LiptonReduction]: Number of co-enabled transitions 1676 [2022-12-06 04:30:38,759 WARN L233 SmtUtils]: Spent 37.76s on a formula simplification that was a NOOP. DAG size: 837 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-06 04:37:03,856 INFO L203 LiptonReduction]: Total number of compositions: 101 [2022-12-06 04:37:03,880 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:37:03,886 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;@1cfea6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:37:03,886 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:37:03,896 INFO L130 PetriNetUnfolder]: 1/17 cut-off events. [2022-12-06 04:37:03,897 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:37:03,897 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:37:03,898 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:37:03,898 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:37:03,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:37:03,901 INFO L85 PathProgramCache]: Analyzing trace with hash -898616503, now seen corresponding path program 1 times [2022-12-06 04:37:03,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:37:03,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023490843] [2022-12-06 04:37:03,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:37:03,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:37:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:37:04,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:37:04,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:37:04,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023490843] [2022-12-06 04:37:04,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023490843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:37:04,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:37:04,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:37:04,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888999882] [2022-12-06 04:37:04,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:37:04,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:37:04,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:37:04,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:37:04,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:37:04,275 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 04:37:04,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:37:04,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:37:04,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 04:37:04,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:37:04,580 INFO L130 PetriNetUnfolder]: 560/860 cut-off events. [2022-12-06 04:37:04,580 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 04:37:04,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1746 conditions, 860 events. 560/860 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3865 event pairs, 209 based on Foata normal form. 0/766 useless extension candidates. Maximal degree in co-relation 1735. Up to 514 conditions per place. [2022-12-06 04:37:04,593 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 22 selfloop transitions, 2 changer transitions 4/30 dead transitions. [2022-12-06 04:37:04,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 125 flow [2022-12-06 04:37:04,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:37:04,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:37:04,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-06 04:37:04,606 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-06 04:37:04,607 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 39 transitions. [2022-12-06 04:37:04,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 125 flow [2022-12-06 04:37:04,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 122 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:37:04,613 INFO L231 Difference]: Finished difference. Result has 30 places, 19 transitions, 48 flow [2022-12-06 04:37:04,615 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2022-12-06 04:37:04,620 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, -3 predicate places. [2022-12-06 04:37:04,621 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:37:04,621 INFO L89 Accepts]: Start accepts. Operand has 30 places, 19 transitions, 48 flow [2022-12-06 04:37:04,624 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:37:04,624 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:37:04,625 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 19 transitions, 48 flow [2022-12-06 04:37:04,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 19 transitions, 48 flow [2022-12-06 04:37:04,639 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 04:37:04,639 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:37:04,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:37:04,640 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 19 transitions, 48 flow [2022-12-06 04:37:04,640 INFO L188 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-06 04:37:04,813 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:37:04,815 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 04:37:04,815 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 48 flow [2022-12-06 04:37:04,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:37:04,815 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:37:04,816 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:37:04,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:37:04,816 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:37:04,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:37:04,817 INFO L85 PathProgramCache]: Analyzing trace with hash -2087225895, now seen corresponding path program 1 times [2022-12-06 04:37:04,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:37:04,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141926198] [2022-12-06 04:37:04,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:37:04,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:37:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:37:05,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:37:05,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:37:05,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141926198] [2022-12-06 04:37:05,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141926198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:37:05,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:37:05,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:37:05,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544743531] [2022-12-06 04:37:05,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:37:05,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:37:05,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:37:05,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:37:05,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:37:05,045 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 04:37:05,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:37:05,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:37:05,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 04:37:05,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:37:05,186 INFO L130 PetriNetUnfolder]: 347/548 cut-off events. [2022-12-06 04:37:05,186 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 04:37:05,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 548 events. 347/548 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2273 event pairs, 83 based on Foata normal form. 9/553 useless extension candidates. Maximal degree in co-relation 1147. Up to 436 conditions per place. [2022-12-06 04:37:05,189 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 21 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-06 04:37:05,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 25 transitions, 106 flow [2022-12-06 04:37:05,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:37:05,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:37:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 04:37:05,190 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-06 04:37:05,190 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 48 flow. Second operand 3 states and 30 transitions. [2022-12-06 04:37:05,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 25 transitions, 106 flow [2022-12-06 04:37:05,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:37:05,192 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 52 flow [2022-12-06 04:37:05,193 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2022-12-06 04:37:05,193 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, -4 predicate places. [2022-12-06 04:37:05,193 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:37:05,193 INFO L89 Accepts]: Start accepts. Operand has 29 places, 19 transitions, 52 flow [2022-12-06 04:37:05,194 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:37:05,194 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:37:05,194 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 19 transitions, 52 flow [2022-12-06 04:37:05,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 19 transitions, 52 flow [2022-12-06 04:37:05,198 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 04:37:05,199 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:37:05,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:37:05,199 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 19 transitions, 52 flow [2022-12-06 04:37:05,199 INFO L188 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-06 04:37:05,225 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:37:05,227 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 04:37:05,227 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 52 flow [2022-12-06 04:37:05,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:37:05,227 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:37:05,228 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:37:05,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:37:05,228 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:37:05,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:37:05,229 INFO L85 PathProgramCache]: Analyzing trace with hash -279495083, now seen corresponding path program 1 times [2022-12-06 04:37:05,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:37:05,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885239984] [2022-12-06 04:37:05,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:37:05,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:37:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:37:05,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:37:05,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:37:05,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885239984] [2022-12-06 04:37:05,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885239984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:37:05,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:37:05,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:37:05,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690447749] [2022-12-06 04:37:05,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:37:05,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:37:05,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:37:05,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:37:05,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:37:05,435 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 04:37:05,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:37:05,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:37:05,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 04:37:05,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:37:05,548 INFO L130 PetriNetUnfolder]: 318/556 cut-off events. [2022-12-06 04:37:05,548 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2022-12-06 04:37:05,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 556 events. 318/556 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2662 event pairs, 68 based on Foata normal form. 12/567 useless extension candidates. Maximal degree in co-relation 1156. Up to 393 conditions per place. [2022-12-06 04:37:05,553 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 27 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2022-12-06 04:37:05,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 31 transitions, 141 flow [2022-12-06 04:37:05,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:37:05,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:37:05,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 04:37:05,554 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2022-12-06 04:37:05,554 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 52 flow. Second operand 3 states and 36 transitions. [2022-12-06 04:37:05,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 31 transitions, 141 flow [2022-12-06 04:37:05,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 135 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:37:05,555 INFO L231 Difference]: Finished difference. Result has 30 places, 19 transitions, 56 flow [2022-12-06 04:37:05,555 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2022-12-06 04:37:05,556 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, -3 predicate places. [2022-12-06 04:37:05,556 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:37:05,556 INFO L89 Accepts]: Start accepts. Operand has 30 places, 19 transitions, 56 flow [2022-12-06 04:37:05,557 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:37:05,557 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:37:05,557 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 19 transitions, 56 flow [2022-12-06 04:37:05,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 19 transitions, 56 flow [2022-12-06 04:37:05,561 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 04:37:05,561 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:37:05,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 19 events. 0/19 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:37:05,561 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 19 transitions, 56 flow [2022-12-06 04:37:05,562 INFO L188 LiptonReduction]: Number of co-enabled transitions 158 [2022-12-06 04:37:05,562 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:37:05,563 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 04:37:05,564 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 56 flow [2022-12-06 04:37:05,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:37:05,564 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:37:05,564 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:37:05,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:37:05,564 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:37:05,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:37:05,564 INFO L85 PathProgramCache]: Analyzing trace with hash -148909681, now seen corresponding path program 1 times [2022-12-06 04:37:05,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:37:05,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383331573] [2022-12-06 04:37:05,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:37:05,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:37:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:37:05,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:37:05,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:37:05,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383331573] [2022-12-06 04:37:05,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383331573] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:37:05,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:37:05,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:37:05,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747679561] [2022-12-06 04:37:05,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:37:05,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:37:05,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:37:05,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:37:05,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:37:05,756 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 04:37:05,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 56 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:37:05,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:37:05,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 04:37:05,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:37:05,963 INFO L130 PetriNetUnfolder]: 866/1327 cut-off events. [2022-12-06 04:37:05,964 INFO L131 PetriNetUnfolder]: For 327/327 co-relation queries the response was YES. [2022-12-06 04:37:05,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3034 conditions, 1327 events. 866/1327 cut-off events. For 327/327 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5764 event pairs, 113 based on Foata normal form. 48/1375 useless extension candidates. Maximal degree in co-relation 3022. Up to 609 conditions per place. [2022-12-06 04:37:05,968 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 30 selfloop transitions, 3 changer transitions 7/40 dead transitions. [2022-12-06 04:37:05,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 40 transitions, 187 flow [2022-12-06 04:37:05,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:37:05,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:37:05,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 04:37:05,970 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2022-12-06 04:37:05,970 INFO L175 Difference]: Start difference. First operand has 30 places, 19 transitions, 56 flow. Second operand 4 states and 42 transitions. [2022-12-06 04:37:05,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 40 transitions, 187 flow [2022-12-06 04:37:05,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 40 transitions, 179 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:37:05,971 INFO L231 Difference]: Finished difference. Result has 33 places, 19 transitions, 66 flow [2022-12-06 04:37:05,971 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=33, PETRI_TRANSITIONS=19} [2022-12-06 04:37:05,972 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2022-12-06 04:37:05,972 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:37:05,972 INFO L89 Accepts]: Start accepts. Operand has 33 places, 19 transitions, 66 flow [2022-12-06 04:37:05,972 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:37:05,972 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:37:05,973 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 19 transitions, 66 flow [2022-12-06 04:37:05,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 19 transitions, 66 flow [2022-12-06 04:37:05,977 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 04:37:05,977 INFO L131 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2022-12-06 04:37:05,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 19 events. 0/19 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:37:05,977 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 19 transitions, 66 flow [2022-12-06 04:37:05,977 INFO L188 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-06 04:37:06,009 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:37:06,010 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-06 04:37:06,010 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 19 transitions, 66 flow [2022-12-06 04:37:06,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:37:06,011 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:37:06,011 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:37:06,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:37:06,011 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:37:06,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:37:06,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1276126987, now seen corresponding path program 1 times [2022-12-06 04:37:06,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:37:06,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782328335] [2022-12-06 04:37:06,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:37:06,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:37:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:37:06,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:37:06,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:37:06,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782328335] [2022-12-06 04:37:06,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782328335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:37:06,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:37:06,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:37:06,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854938800] [2022-12-06 04:37:06,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:37:06,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:37:06,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:37:06,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:37:06,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:37:06,148 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 04:37:06,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 19 transitions, 66 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:37:06,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:37:06,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 04:37:06,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:37:06,331 INFO L130 PetriNetUnfolder]: 617/970 cut-off events. [2022-12-06 04:37:06,332 INFO L131 PetriNetUnfolder]: For 613/613 co-relation queries the response was YES. [2022-12-06 04:37:06,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2316 conditions, 970 events. 617/970 cut-off events. For 613/613 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3894 event pairs, 310 based on Foata normal form. 36/1006 useless extension candidates. Maximal degree in co-relation 2302. Up to 500 conditions per place. [2022-12-06 04:37:06,336 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 24 selfloop transitions, 2 changer transitions 19/45 dead transitions. [2022-12-06 04:37:06,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 45 transitions, 217 flow [2022-12-06 04:37:06,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:37:06,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:37:06,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-12-06 04:37:06,338 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49473684210526314 [2022-12-06 04:37:06,338 INFO L175 Difference]: Start difference. First operand has 33 places, 19 transitions, 66 flow. Second operand 5 states and 47 transitions. [2022-12-06 04:37:06,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 45 transitions, 217 flow [2022-12-06 04:37:06,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 45 transitions, 203 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-06 04:37:06,340 INFO L231 Difference]: Finished difference. Result has 36 places, 19 transitions, 66 flow [2022-12-06 04:37:06,340 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=36, PETRI_TRANSITIONS=19} [2022-12-06 04:37:06,340 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2022-12-06 04:37:06,340 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:37:06,340 INFO L89 Accepts]: Start accepts. Operand has 36 places, 19 transitions, 66 flow [2022-12-06 04:37:06,341 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:37:06,341 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:37:06,341 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 19 transitions, 66 flow [2022-12-06 04:37:06,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 19 transitions, 66 flow [2022-12-06 04:37:06,345 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 04:37:06,345 INFO L131 PetriNetUnfolder]: For 8/9 co-relation queries the response was YES. [2022-12-06 04:37:06,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 19 events. 0/19 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 1/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:37:06,345 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 19 transitions, 66 flow [2022-12-06 04:37:06,346 INFO L188 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-06 04:37:06,347 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:37:06,348 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 04:37:06,348 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 19 transitions, 66 flow [2022-12-06 04:37:06,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:37:06,348 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:37:06,348 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:37:06,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:37:06,349 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:37:06,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:37:06,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2125146947, now seen corresponding path program 1 times [2022-12-06 04:37:06,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:37:06,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444110418] [2022-12-06 04:37:06,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:37:06,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:37:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:37:07,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:37:07,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:37:07,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444110418] [2022-12-06 04:37:07,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444110418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:37:07,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:37:07,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:37:07,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653689720] [2022-12-06 04:37:07,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:37:07,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:37:07,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:37:07,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:37:07,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:37:07,150 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 04:37:07,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 19 transitions, 66 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:37:07,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:37:07,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 04:37:07,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:37:07,332 INFO L130 PetriNetUnfolder]: 228/404 cut-off events. [2022-12-06 04:37:07,332 INFO L131 PetriNetUnfolder]: For 269/269 co-relation queries the response was YES. [2022-12-06 04:37:07,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 404 events. 228/404 cut-off events. For 269/269 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1637 event pairs, 19 based on Foata normal form. 8/411 useless extension candidates. Maximal degree in co-relation 957. Up to 190 conditions per place. [2022-12-06 04:37:07,336 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 31 selfloop transitions, 6 changer transitions 0/39 dead transitions. [2022-12-06 04:37:07,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 193 flow [2022-12-06 04:37:07,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:37:07,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:37:07,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-12-06 04:37:07,338 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5157894736842106 [2022-12-06 04:37:07,338 INFO L175 Difference]: Start difference. First operand has 34 places, 19 transitions, 66 flow. Second operand 5 states and 49 transitions. [2022-12-06 04:37:07,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 193 flow [2022-12-06 04:37:07,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 183 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-06 04:37:07,340 INFO L231 Difference]: Finished difference. Result has 37 places, 23 transitions, 97 flow [2022-12-06 04:37:07,340 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=97, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2022-12-06 04:37:07,341 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2022-12-06 04:37:07,341 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:37:07,341 INFO L89 Accepts]: Start accepts. Operand has 37 places, 23 transitions, 97 flow [2022-12-06 04:37:07,342 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:37:07,342 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:37:07,342 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 23 transitions, 97 flow [2022-12-06 04:37:07,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 23 transitions, 97 flow [2022-12-06 04:37:07,349 INFO L130 PetriNetUnfolder]: 6/37 cut-off events. [2022-12-06 04:37:07,349 INFO L131 PetriNetUnfolder]: For 27/31 co-relation queries the response was YES. [2022-12-06 04:37:07,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 37 events. 6/37 cut-off events. For 27/31 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 87 event pairs, 2 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 83. Up to 15 conditions per place. [2022-12-06 04:37:07,350 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 23 transitions, 97 flow [2022-12-06 04:37:07,350 INFO L188 LiptonReduction]: Number of co-enabled transitions 154 [2022-12-06 04:37:08,020 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [713] $Ultimate##0-->L820: Formula: (and (= v_~y$r_buff0_thd3~0_155 1) (= v_~y$r_buff0_thd3~0_156 v_~y$r_buff1_thd3~0_124) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_19| |v_P2Thread1of1ForFork1_~arg#1.offset_19|) (= v_~y$w_buff0~0_268 1) (= v_~y$r_buff0_thd1~0_180 v_~y$r_buff1_thd1~0_181) (= v_~y$w_buff0_used~0_414 v_~y$w_buff1_used~0_371) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_39| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_39|) (= v_~y$w_buff1~0_232 v_~y$w_buff0~0_269) (= v_~y$w_buff0_used~0_413 1) (= v_~y$r_buff0_thd0~0_137 v_~y$r_buff1_thd0~0_140) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_371 256) 0)) (not (= (mod v_~y$w_buff0_used~0_413 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_39|) (= v_~y$r_buff0_thd2~0_41 v_~y$r_buff1_thd2~0_43) (= v_~__unbuffered_p2_EAX~0_69 v_~x~0_107) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_39| 0)) (= |v_P2Thread1of1ForFork1_~arg#1.base_19| |v_P2Thread1of1ForFork1_#in~arg#1.base_19|)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_19|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_414, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_156, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_137, ~y$w_buff0~0=v_~y$w_buff0~0_269, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_41, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_180, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_19|, ~x~0=v_~x~0_107} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_413, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_19|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_19|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_181, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_124, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_19|, ~y$w_buff1~0=v_~y$w_buff1~0_232, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_155, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_137, ~y$w_buff0~0=v_~y$w_buff0~0_268, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_19|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_41, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_180, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_39|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_69, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ~x~0=v_~x~0_107, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_39|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_371} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [664] L3-->L860: Formula: (let ((.cse6 (= (mod v_~y$r_buff0_thd0~0_79 256) 0))) (let ((.cse7 (= (mod v_~y$r_buff1_thd0~0_83 256) 0)) (.cse5 (= (mod v_~y$w_buff0_used~0_249 256) 0)) (.cse8 (= (mod v_~y$w_buff1_used~0_222 256) 0)) (.cse11 (not (= (mod v_~y$w_buff0_used~0_248 256) 0))) (.cse0 (not .cse6))) (let ((.cse2 (and .cse11 .cse0)) (.cse4 (not .cse8)) (.cse1 (not .cse5)) (.cse3 (not .cse7)) (.cse9 (select |v_#memory_int_224| |v_~#y~0.base_136|))) (and (= v_~y$w_buff0_used~0_248 (ite (and .cse0 .cse1) 0 v_~y$w_buff0_used~0_249)) (= (ite (or .cse2 (and .cse3 .cse4)) 0 v_~y$w_buff1_used~0_222) v_~y$w_buff1_used~0_221) (= (ite .cse2 0 v_~y$r_buff0_thd0~0_79) v_~y$r_buff0_thd0~0_78) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~mem28#1_73| |v_ULTIMATE.start_main_#t~mem28#1_71|))) (or (and (= |v_ULTIMATE.start_main_#t~ite29#1_70| |v_ULTIMATE.start_main_#t~ite30#1_55|) (or .cse5 .cse6) (or (and (or .cse7 .cse8) (= |v_ULTIMATE.start_main_#t~mem28#1_71| |v_ULTIMATE.start_main_#t~ite29#1_70|) (= |v_ULTIMATE.start_main_#t~mem28#1_71| (select .cse9 |v_~#y~0.offset_136|))) (and .cse3 .cse10 .cse4 (= v_~y$w_buff1~0_123 |v_ULTIMATE.start_main_#t~ite29#1_70|)))) (and .cse10 (= |v_ULTIMATE.start_main_#t~ite29#1_72| |v_ULTIMATE.start_main_#t~ite29#1_70|) (= v_~y$w_buff0~0_144 |v_ULTIMATE.start_main_#t~ite30#1_55|) .cse0 .cse1))) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_221 256) 0))) (and .cse11 (not (= (mod v_~y$r_buff0_thd0~0_78 256) 0)))) 0 v_~y$r_buff1_thd0~0_83) v_~y$r_buff1_thd0~0_82) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|) (= (store |v_#memory_int_224| |v_~#y~0.base_136| (store .cse9 |v_~#y~0.offset_136| |v_ULTIMATE.start_main_#t~ite30#1_55|)) |v_#memory_int_223|))))) InVars {ULTIMATE.start_main_#t~ite29#1=|v_ULTIMATE.start_main_#t~ite29#1_72|, ~#y~0.offset=|v_~#y~0.offset_136|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_249, ~y$w_buff1~0=v_~y$w_buff1~0_123, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_79, ~y$w_buff0~0=v_~y$w_buff0~0_144, #memory_int=|v_#memory_int_224|, ~#y~0.base=|v_~#y~0.base_136|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_73|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_83, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_222, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} OutVars{~#y~0.offset=|v_~#y~0.offset_136|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_248, ~#y~0.base=|v_~#y~0.base_136|, ULTIMATE.start_main_#t~ite30#1=|v_ULTIMATE.start_main_#t~ite30#1_54|, ~y$w_buff1~0=v_~y$w_buff1~0_123, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_78, ~y$w_buff0~0=v_~y$w_buff0~0_144, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|, #memory_int=|v_#memory_int_223|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_82, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_221, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} AuxVars[|v_ULTIMATE.start_main_#t~ite29#1_70|, |v_ULTIMATE.start_main_#t~mem28#1_71|, |v_ULTIMATE.start_main_#t~ite30#1_55|] AssignedVars[ULTIMATE.start_main_#t~ite30#1, ULTIMATE.start_main_#t~ite29#1, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~mem28#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 04:37:08,481 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:37:08,482 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1141 [2022-12-06 04:37:08,482 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 109 flow [2022-12-06 04:37:08,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:37:08,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:37:08,482 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:37:08,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:37:08,482 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:37:08,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:37:08,482 INFO L85 PathProgramCache]: Analyzing trace with hash -551111974, now seen corresponding path program 1 times [2022-12-06 04:37:08,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:37:08,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237162254] [2022-12-06 04:37:08,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:37:08,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:37:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:37:09,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:37:09,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:37:09,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237162254] [2022-12-06 04:37:09,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237162254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:37:09,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:37:09,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:37:09,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512431210] [2022-12-06 04:37:09,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:37:09,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:37:09,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:37:09,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:37:09,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:37:09,259 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 04:37:09,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 109 flow. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:37:09,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:37:09,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 04:37:09,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:37:09,483 INFO L130 PetriNetUnfolder]: 216/386 cut-off events. [2022-12-06 04:37:09,483 INFO L131 PetriNetUnfolder]: For 431/431 co-relation queries the response was YES. [2022-12-06 04:37:09,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 386 events. 216/386 cut-off events. For 431/431 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1650 event pairs, 21 based on Foata normal form. 4/389 useless extension candidates. Maximal degree in co-relation 1134. Up to 190 conditions per place. [2022-12-06 04:37:09,486 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 28 selfloop transitions, 6 changer transitions 2/38 dead transitions. [2022-12-06 04:37:09,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 229 flow [2022-12-06 04:37:09,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:37:09,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:37:09,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-12-06 04:37:09,489 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44761904761904764 [2022-12-06 04:37:09,490 INFO L175 Difference]: Start difference. First operand has 36 places, 22 transitions, 109 flow. Second operand 5 states and 47 transitions. [2022-12-06 04:37:09,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 229 flow [2022-12-06 04:37:09,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:37:09,494 INFO L231 Difference]: Finished difference. Result has 40 places, 22 transitions, 121 flow [2022-12-06 04:37:09,495 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=40, PETRI_TRANSITIONS=22} [2022-12-06 04:37:09,496 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2022-12-06 04:37:09,496 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:37:09,496 INFO L89 Accepts]: Start accepts. Operand has 40 places, 22 transitions, 121 flow [2022-12-06 04:37:09,497 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:37:09,497 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:37:09,497 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 22 transitions, 121 flow [2022-12-06 04:37:09,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 22 transitions, 121 flow [2022-12-06 04:37:09,508 INFO L130 PetriNetUnfolder]: 5/34 cut-off events. [2022-12-06 04:37:09,509 INFO L131 PetriNetUnfolder]: For 77/82 co-relation queries the response was YES. [2022-12-06 04:37:09,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 34 events. 5/34 cut-off events. For 77/82 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 75 event pairs, 2 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 91. Up to 14 conditions per place. [2022-12-06 04:37:09,509 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 22 transitions, 121 flow [2022-12-06 04:37:09,509 INFO L188 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-06 04:37:09,528 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [715] $Ultimate##0-->L860: Formula: (let ((.cse2 (= (mod v_~y$r_buff0_thd0~0_142 256) 0))) (let ((.cse1 (not .cse2)) (.cse5 (not (= (mod v_~y$w_buff0_used~0_423 256) 0)))) (let ((.cse0 (select |v_#memory_int_411| |v_~#y~0.base_198|)) (.cse4 (= (mod v_~y$w_buff0_used~0_425 256) 0)) (.cse3 (and .cse1 .cse5))) (and (= v_~y$r_buff0_thd3~0_166 v_~y$r_buff1_thd3~0_130) (= v_~y$w_buff0~0_276 1) (= v_~y$w_buff1~0_236 v_~y$w_buff0~0_277) (= |v_P2Thread1of1ForFork1_~arg#1.base_23| |v_P2Thread1of1ForFork1_#in~arg#1.base_23|) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_43| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_43|) (= v_~y$r_buff0_thd2~0_45 v_~y$r_buff1_thd2~0_47) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|) (= |v_#memory_int_410| (store |v_#memory_int_411| |v_~#y~0.base_198| (store .cse0 |v_~#y~0.offset_198| |v_ULTIMATE.start_main_#t~ite30#1_107|))) (or (and (= |v_ULTIMATE.start_main_#t~ite30#1_107| v_~y$w_buff0~0_276) .cse1 (= |v_ULTIMATE.start_main_#t~mem28#1_133| |v_ULTIMATE.start_main_#t~mem28#1_131|) (= |v_ULTIMATE.start_main_#t~ite29#1_132| |v_ULTIMATE.start_main_#t~ite29#1_130|)) (and .cse2 (= |v_ULTIMATE.start_main_#t~ite29#1_130| |v_ULTIMATE.start_main_#t~mem28#1_131|) (= (select .cse0 |v_~#y~0.offset_198|) |v_ULTIMATE.start_main_#t~mem28#1_131|) (= |v_ULTIMATE.start_main_#t~ite29#1_130| |v_ULTIMATE.start_main_#t~ite30#1_107|))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| 0)) (= v_~y$w_buff0_used~0_423 (ite .cse1 0 1)) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_43| 0)) (= v_~__unbuffered_p2_EAX~0_73 v_~x~0_111) (= v_~y$r_buff0_thd0~0_141 (ite .cse3 0 v_~y$r_buff0_thd0~0_142)) (= v_~y$r_buff0_thd1~0_184 v_~y$r_buff1_thd1~0_185) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_23| |v_P2Thread1of1ForFork1_~arg#1.offset_23|) (= (ite .cse4 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_43|) (= v_~y$r_buff0_thd3~0_165 1) (= v_~y$w_buff1_used~0_377 (ite (or (and .cse1 (not .cse4)) .cse3) 0 v_~y$w_buff0_used~0_425)) (= v_~y$r_buff1_thd0~0_144 (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_377 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_141 256) 0)) .cse5)) 0 v_~y$r_buff0_thd0~0_142)))))) InVars {~#y~0.offset=|v_~#y~0.offset_198|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_425, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_23|, ~#y~0.base=|v_~#y~0.base_198|, ULTIMATE.start_main_#t~ite29#1=|v_ULTIMATE.start_main_#t~ite29#1_132|, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_23|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~y$w_buff0~0=v_~y$w_buff0~0_277, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_166, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_45, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_184, #memory_int=|v_#memory_int_411|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_133|, ~x~0=v_~x~0_111, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|} OutVars{~#y~0.offset=|v_~#y~0.offset_198|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_423, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_23|, ~#y~0.base=|v_~#y~0.base_198|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_185, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_130, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_23|, ~y$w_buff0~0=v_~y$w_buff0~0_276, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_69|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_165, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_23|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_184, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_73, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_23|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_47, ULTIMATE.start_main_#t~ite30#1=|v_ULTIMATE.start_main_#t~ite30#1_106|, ~y$w_buff1~0=v_~y$w_buff1~0_236, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_141, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_45, #memory_int=|v_#memory_int_410|, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_43|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_144, ~x~0=v_~x~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_377, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_43|} AuxVars[|v_ULTIMATE.start_main_#t~mem28#1_131|, |v_ULTIMATE.start_main_#t~ite30#1_107|, |v_ULTIMATE.start_main_#t~ite29#1_130|] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30#1, ULTIMATE.start_main_#t~ite29#1, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_~arg#1.base, ~y$r_buff0_thd0~0, #memory_int, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~mem28#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [588] L820-->L827: Formula: (let ((.cse5 (= (mod v_~y$r_buff0_thd3~0_42 256) 0))) (let ((.cse9 (= (mod v_~y$r_buff1_thd3~0_39 256) 0)) (.cse8 (= (mod v_~y$w_buff1_used~0_144 256) 0)) (.cse3 (not (= 0 (mod v_~y$w_buff0_used~0_154 256)))) (.cse1 (not .cse5)) (.cse6 (= (mod v_~y$w_buff0_used~0_155 256) 0))) (let ((.cse0 (not .cse6)) (.cse11 (and .cse3 .cse1)) (.cse10 (not .cse8)) (.cse2 (not .cse9)) (.cse7 (select |v_#memory_int_134| |v_~#y~0.base_88|))) (and (= v_~y$w_buff0_used~0_154 (ite (and .cse0 .cse1) 0 v_~y$w_buff0_used~0_155)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_143 256) 0)) .cse2) (and (not (= (mod v_~y$r_buff0_thd3~0_41 256) 0)) .cse3)) 0 v_~y$r_buff1_thd3~0_39) v_~y$r_buff1_thd3~0_38) (let ((.cse4 (= |v_P2Thread1of1ForFork1_#t~mem19#1_1| |v_P2_#t~mem19#1_30|))) (or (and .cse0 .cse4 (= |v_P2_#t~ite21#1_27| v_~y$w_buff0~0_66) (= |v_P2Thread1of1ForFork1_#t~ite20#1_1| |v_P2_#t~ite20#1_29|) .cse1) (and (or .cse5 .cse6) (or (and (= |v_P2_#t~ite20#1_29| |v_P2_#t~mem19#1_30|) (= |v_P2_#t~mem19#1_30| (select .cse7 |v_~#y~0.offset_88|)) (or .cse8 .cse9)) (and .cse4 .cse10 (= |v_P2_#t~ite20#1_29| v_~y$w_buff1~0_65) .cse2)) (= |v_P2_#t~ite20#1_29| |v_P2_#t~ite21#1_27|)))) (= v_~y$r_buff0_thd3~0_41 (ite .cse11 0 v_~y$r_buff0_thd3~0_42)) (= v_~y$w_buff1_used~0_143 (ite (or .cse11 (and .cse10 .cse2)) 0 v_~y$w_buff1_used~0_144)) (= (store |v_#memory_int_134| |v_~#y~0.base_88| (store .cse7 |v_~#y~0.offset_88| |v_P2_#t~ite21#1_27|)) |v_#memory_int_133|))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_39, ~#y~0.offset=|v_~#y~0.offset_88|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_155, ~y$w_buff1~0=v_~y$w_buff1~0_65, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_42, ~y$w_buff0~0=v_~y$w_buff0~0_66, #memory_int=|v_#memory_int_134|, ~#y~0.base=|v_~#y~0.base_88|, P2Thread1of1ForFork1_#t~mem19#1=|v_P2Thread1of1ForFork1_#t~mem19#1_1|, P2Thread1of1ForFork1_#t~ite20#1=|v_P2Thread1of1ForFork1_#t~ite20#1_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_144} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_38, ~#y~0.offset=|v_~#y~0.offset_88|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_154, ~y$w_buff1~0=v_~y$w_buff1~0_65, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_66, #memory_int=|v_#memory_int_133|, ~#y~0.base=|v_~#y~0.base_88|, P2Thread1of1ForFork1_#t~ite21#1=|v_P2Thread1of1ForFork1_#t~ite21#1_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_143} AuxVars[|v_P2_#t~ite21#1_27|, |v_P2_#t~mem19#1_30|, |v_P2_#t~ite20#1_29|] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, #memory_int, P2Thread1of1ForFork1_#t~mem19#1, P2Thread1of1ForFork1_#t~ite20#1, P2Thread1of1ForFork1_#t~ite21#1, ~y$w_buff1_used~0] [2022-12-06 04:37:10,637 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [716] $Ultimate##0-->L827: Formula: (let ((.cse5 (= (mod v_~y$r_buff0_thd0~0_146 256) 0))) (let ((.cse7 (not .cse5))) (let ((.cse10 (ite .cse7 0 1))) (let ((.cse1 (= (mod .cse10 256) 0))) (let ((.cse2 (not .cse1))) (let ((.cse8 (= 0 (mod v_~y$w_buff0_used~0_431 256))) (.cse0 (and .cse7 .cse2))) (let ((.cse11 (ite (or (and .cse7 (not .cse8)) .cse0) 0 v_~y$w_buff0_used~0_431))) (let ((.cse6 (select |v_#memory_int_416| |v_~#y~0.base_200|)) (.cse4 (not (= (mod v_~y$w_buff0_used~0_429 256) 0))) (.cse3 (not (= (mod v_~y$r_buff0_thd3~0_171 256) 0))) (.cse9 (not (= (mod .cse11 256) 0)))) (and (= v_~y$r_buff0_thd0~0_145 (ite .cse0 0 v_~y$r_buff0_thd0~0_146)) (= v_~y$w_buff0~0_280 1) (or (and .cse1 (= |v_P2_#t~mem19#1_60| |v_ULTIMATE.start_main_#t~ite30#1_112|) (= |v_P2_#t~ite20#1_59| |v_P2_#t~ite21#1_57|) (= |v_P2_#t~ite20#1_59| |v_P2_#t~mem19#1_60|)) (and (= |v_P2Thread1of1ForFork1_#t~mem19#1_58| |v_P2_#t~mem19#1_60|) (= |v_P2Thread1of1ForFork1_#t~ite20#1_58| |v_P2_#t~ite20#1_59|) .cse2 (= |v_P2_#t~ite21#1_57| v_~y$w_buff0~0_280))) (= (ite (or (and (not (= 0 (mod v_~y$w_buff1_used~0_381 256))) .cse3) (and (not (= (mod v_~y$r_buff0_thd3~0_169 256) 0)) .cse4)) 0 v_~y$r_buff0_thd3~0_171) v_~y$r_buff1_thd3~0_132) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_71| 0)) (= v_~__unbuffered_p2_EAX~0_75 v_~x~0_113) (or (and .cse5 (= |v_ULTIMATE.start_main_#t~mem28#1_138| (select .cse6 |v_~#y~0.offset_200|)) (= |v_ULTIMATE.start_main_#t~ite29#1_137| |v_ULTIMATE.start_main_#t~ite30#1_112|) (= |v_ULTIMATE.start_main_#t~ite29#1_137| |v_ULTIMATE.start_main_#t~mem28#1_138|)) (and .cse7 (= |v_ULTIMATE.start_main_#t~mem28#1_138| |v_ULTIMATE.start_main_#t~mem28#1_140|) (= |v_ULTIMATE.start_main_#t~ite29#1_139| |v_ULTIMATE.start_main_#t~ite29#1_137|) (= |v_ULTIMATE.start_main_#t~ite30#1_112| v_~y$w_buff0~0_280))) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_45| 0)) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_25| |v_P2Thread1of1ForFork1_~arg#1.offset_25|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_71| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|) (= v_~y$r_buff0_thd1~0_186 v_~y$r_buff1_thd1~0_187) (= (ite .cse8 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_45|) (= v_~y$w_buff1~0_238 v_~y$w_buff0~0_281) (= (store |v_#memory_int_416| |v_~#y~0.base_200| (store .cse6 |v_~#y~0.offset_200| |v_P2_#t~ite21#1_57|)) |v_#memory_int_414|) (= v_~y$r_buff0_thd2~0_47 v_~y$r_buff1_thd2~0_49) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_145 256) 0)) .cse2) (and .cse7 .cse9)) 0 v_~y$r_buff0_thd0~0_146) v_~y$r_buff1_thd0~0_148) (= v_~y$w_buff0_used~0_429 (ite .cse2 0 .cse10)) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_45| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_45|) (= |v_P2Thread1of1ForFork1_~arg#1.base_25| |v_P2Thread1of1ForFork1_#in~arg#1.base_25|) (= (ite .cse4 0 1) v_~y$r_buff0_thd3~0_169) (= v_~y$w_buff1_used~0_381 (ite (or .cse4 (and .cse3 .cse9)) 0 .cse11))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_200|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_431, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_25|, ~#y~0.base=|v_~#y~0.base_200|, ULTIMATE.start_main_#t~ite29#1=|v_ULTIMATE.start_main_#t~ite29#1_139|, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_25|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_171, ~y$w_buff0~0=v_~y$w_buff0~0_281, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_146, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_186, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, #memory_int=|v_#memory_int_416|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_140|, P2Thread1of1ForFork1_#t~mem19#1=|v_P2Thread1of1ForFork1_#t~mem19#1_58|, P2Thread1of1ForFork1_#t~ite20#1=|v_P2Thread1of1ForFork1_#t~ite20#1_58|, ~x~0=v_~x~0_113, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|} OutVars{~#y~0.offset=|v_~#y~0.offset_200|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_429, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_25|, ~#y~0.base=|v_~#y~0.base_200|, P2Thread1of1ForFork1_#t~ite21#1=|v_P2Thread1of1ForFork1_#t~ite21#1_31|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_187, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_132, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_25|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_169, ~y$w_buff0~0=v_~y$w_buff0~0_280, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_71|, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_25|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_186, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_75, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_25|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_49, ULTIMATE.start_main_#t~ite30#1=|v_ULTIMATE.start_main_#t~ite30#1_111|, ~y$w_buff1~0=v_~y$w_buff1~0_238, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_145, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, #memory_int=|v_#memory_int_414|, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_45|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_148, ~x~0=v_~x~0_113, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_381, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_45|} AuxVars[|v_P2_#t~ite20#1_59|, |v_P2_#t~mem19#1_60|, |v_ULTIMATE.start_main_#t~ite29#1_137|, |v_P2_#t~ite21#1_57|, |v_ULTIMATE.start_main_#t~ite30#1_112|, |v_ULTIMATE.start_main_#t~mem28#1_138|] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, P2Thread1of1ForFork1_#t~ite21#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30#1, ULTIMATE.start_main_#t~ite29#1, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, P2Thread1of1ForFork1_~arg#1.base, ~y$r_buff0_thd0~0, #memory_int, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~mem28#1, P2Thread1of1ForFork1_#t~mem19#1, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1_#t~ite20#1, ~y$w_buff1_used~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [702] L860-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (let ((.cse2 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_55 256) 0)) (.cse0 (= |v_ULTIMATE.start_main_#t~mem32#1_87| |v_ULTIMATE.start_main_#t~mem32#1_85|))) (or (and (let ((.cse1 (= (mod v_~weak$$choice1~0_96 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_82| v_~__unbuffered_p0_EAX~0_88) .cse0 .cse1) (and (= (select (select |v_#memory_int_300| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_56) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_56) |v_ULTIMATE.start_main_#t~mem32#1_85|) (= |v_ULTIMATE.start_main_#t~ite33#1_82| |v_ULTIMATE.start_main_#t~mem32#1_85|) (not .cse1)))) (= |v_ULTIMATE.start_main_#t~ite33#1_82| v_~__unbuffered_p0_EAX~0_87) (not .cse2)) (and .cse2 .cse0 (= |v_ULTIMATE.start_main_#t~ite33#1_84| |v_ULTIMATE.start_main_#t~ite33#1_82|) (= v_~__unbuffered_p0_EAX~0_88 v_~__unbuffered_p0_EAX~0_87)))) (= |v_ULTIMATE.start_main_#t~nondet31#1_49| v_~weak$$choice1~0_96) (= (mod v_~main$tmp_guard1~0_32 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|) (= (ite (= (ite (not (and (= v_~x~0_55 2) (= v_~__unbuffered_p0_EAX~0_87 1) (= 2 v_~__unbuffered_p2_EAX~0_40) (= v_~__unbuffered_p0_EBX~0_36 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_32)) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_87|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_36, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_84|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_56, #memory_int=|v_#memory_int_300|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_49|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_55, ~x~0=v_~x~0_55, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_56} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_36, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_48|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_56, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_87, ~weak$$choice1~0=v_~weak$$choice1~0_96, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_56, #memory_int=|v_#memory_int_300|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_55, ~x~0=v_~x~0_55} AuxVars[|v_ULTIMATE.start_main_#t~ite33#1_82|, |v_ULTIMATE.start_main_#t~mem32#1_85|] AssignedVars[ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite34#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite33#1, ULTIMATE.start_main_#t~nondet31#1, ~main$tmp_guard1~0] [2022-12-06 04:37:11,869 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:37:11,870 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2374 [2022-12-06 04:37:11,870 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 21 transitions, 117 flow [2022-12-06 04:37:11,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:37:11,871 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:37:11,871 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:37:11,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:37:11,871 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:37:11,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:37:11,872 INFO L85 PathProgramCache]: Analyzing trace with hash -238649939, now seen corresponding path program 1 times [2022-12-06 04:37:11,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:37:11,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487711379] [2022-12-06 04:37:11,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:37:11,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:37:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:37:12,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:37:12,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:37:12,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487711379] [2022-12-06 04:37:12,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487711379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:37:12,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:37:12,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:37:12,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071550248] [2022-12-06 04:37:12,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:37:12,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:37:12,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:37:12,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:37:12,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:37:12,059 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 04:37:12,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 21 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:37:12,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:37:12,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 04:37:12,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:37:12,177 INFO L130 PetriNetUnfolder]: 160/292 cut-off events. [2022-12-06 04:37:12,177 INFO L131 PetriNetUnfolder]: For 750/750 co-relation queries the response was YES. [2022-12-06 04:37:12,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 292 events. 160/292 cut-off events. For 750/750 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1159 event pairs, 32 based on Foata normal form. 31/320 useless extension candidates. Maximal degree in co-relation 952. Up to 195 conditions per place. [2022-12-06 04:37:12,178 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 28 selfloop transitions, 4 changer transitions 19/53 dead transitions. [2022-12-06 04:37:12,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 389 flow [2022-12-06 04:37:12,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:37:12,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:37:12,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-12-06 04:37:12,179 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.61 [2022-12-06 04:37:12,179 INFO L175 Difference]: Start difference. First operand has 38 places, 21 transitions, 117 flow. Second operand 5 states and 61 transitions. [2022-12-06 04:37:12,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 389 flow [2022-12-06 04:37:12,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 53 transitions, 336 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-12-06 04:37:12,182 INFO L231 Difference]: Finished difference. Result has 40 places, 24 transitions, 134 flow [2022-12-06 04:37:12,182 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2022-12-06 04:37:12,184 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2022-12-06 04:37:12,184 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:37:12,184 INFO L89 Accepts]: Start accepts. Operand has 40 places, 24 transitions, 134 flow [2022-12-06 04:37:12,185 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:37:12,185 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:37:12,185 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 24 transitions, 134 flow [2022-12-06 04:37:12,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 24 transitions, 134 flow [2022-12-06 04:37:12,199 INFO L130 PetriNetUnfolder]: 63/125 cut-off events. [2022-12-06 04:37:12,199 INFO L131 PetriNetUnfolder]: For 201/217 co-relation queries the response was YES. [2022-12-06 04:37:12,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 125 events. 63/125 cut-off events. For 201/217 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 448 event pairs, 21 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 385. Up to 77 conditions per place. [2022-12-06 04:37:12,200 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 24 transitions, 134 flow [2022-12-06 04:37:12,200 INFO L188 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-06 04:37:12,202 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:37:12,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 04:37:12,203 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 24 transitions, 134 flow [2022-12-06 04:37:12,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:37:12,203 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:37:12,203 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:37:12,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:37:12,204 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:37:12,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:37:12,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1208982499, now seen corresponding path program 1 times [2022-12-06 04:37:12,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:37:12,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560770653] [2022-12-06 04:37:12,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:37:12,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:37:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:37:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:37:12,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:37:12,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560770653] [2022-12-06 04:37:12,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560770653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:37:12,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:37:12,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:37:12,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786668510] [2022-12-06 04:37:12,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:37:12,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:37:12,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:37:12,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:37:12,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:37:12,345 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 04:37:12,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 24 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:37:12,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:37:12,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 04:37:12,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:37:12,461 INFO L130 PetriNetUnfolder]: 92/186 cut-off events. [2022-12-06 04:37:12,461 INFO L131 PetriNetUnfolder]: For 364/364 co-relation queries the response was YES. [2022-12-06 04:37:12,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 186 events. 92/186 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 639 event pairs, 13 based on Foata normal form. 22/205 useless extension candidates. Maximal degree in co-relation 700. Up to 85 conditions per place. [2022-12-06 04:37:12,463 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 33 selfloop transitions, 7 changer transitions 16/58 dead transitions. [2022-12-06 04:37:12,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 58 transitions, 430 flow [2022-12-06 04:37:12,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:37:12,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:37:12,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-12-06 04:37:12,464 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.575 [2022-12-06 04:37:12,465 INFO L175 Difference]: Start difference. First operand has 38 places, 24 transitions, 134 flow. Second operand 6 states and 69 transitions. [2022-12-06 04:37:12,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 58 transitions, 430 flow [2022-12-06 04:37:12,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 422 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 04:37:12,467 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 186 flow [2022-12-06 04:37:12,468 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2022-12-06 04:37:12,468 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2022-12-06 04:37:12,468 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:37:12,468 INFO L89 Accepts]: Start accepts. Operand has 44 places, 27 transitions, 186 flow [2022-12-06 04:37:12,470 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:37:12,470 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:37:12,470 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 27 transitions, 186 flow [2022-12-06 04:37:12,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 27 transitions, 186 flow [2022-12-06 04:37:12,482 INFO L130 PetriNetUnfolder]: 26/70 cut-off events. [2022-12-06 04:37:12,483 INFO L131 PetriNetUnfolder]: For 192/214 co-relation queries the response was YES. [2022-12-06 04:37:12,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 70 events. 26/70 cut-off events. For 192/214 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 182 event pairs, 3 based on Foata normal form. 4/71 useless extension candidates. Maximal degree in co-relation 275. Up to 39 conditions per place. [2022-12-06 04:37:12,483 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 27 transitions, 186 flow [2022-12-06 04:37:12,483 INFO L188 LiptonReduction]: Number of co-enabled transitions 118 [2022-12-06 04:37:12,485 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [704] L849-3-->L3: Formula: (and (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_79) 1 0) 0) 0 1) v_~main$tmp_guard0~0_36) (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_29|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_47|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre26#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [717] $Ultimate##0-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse12 (= (mod v_~y$r_buff0_thd0~0_150 256) 0))) (let ((.cse7 (not .cse12))) (let ((.cse1 (ite .cse7 0 1))) (let ((.cse14 (= (mod .cse1 256) 0))) (let ((.cse0 (not .cse14))) (let ((.cse8 (= (mod v_~y$w_buff0_used~0_436 256) 0)) (.cse6 (and .cse7 .cse0))) (let ((.cse5 (ite (or (and .cse7 (not .cse8)) .cse6) 0 v_~y$w_buff0_used~0_436))) (let ((.cse4 (not (= (mod .cse5 256) 0))) (.cse13 (select |v_#memory_int_423| |v_~#y~0.base_202|)) (.cse2 (not (= (mod v_~y$w_buff0_used~0_435 256) 0))) (.cse3 (not (= (mod v_~y$r_buff0_thd3~0_176 256) 0)))) (and (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_47| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59| 0) (= (ite .cse0 0 .cse1) v_~y$w_buff0_used~0_435) (= (ite (or .cse2 (and .cse3 .cse4)) 0 .cse5) v_~y$w_buff1_used~0_385) (= v_~y$r_buff0_thd0~0_149 (ite .cse6 0 v_~y$r_buff0_thd0~0_150)) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_47| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_47|) (= v_~y$r_buff0_thd2~0_49 v_~y$r_buff1_thd2~0_51) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|) (= (ite .cse2 0 1) v_~y$r_buff0_thd3~0_175) (= (ite (= (ite (not (and (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p2_EAX~0_79) (= v_~__unbuffered_p0_EBX~0_76 0) (= v_~__unbuffered_p0_EAX~0_153 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_54) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_73| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_65|) (= (mod v_~main$tmp_guard1~0_54 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|) (= v_~y$r_buff1_thd0~0_150 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_149 256) 0)) .cse0) (and .cse7 .cse4)) 0 v_~y$r_buff0_thd0~0_150)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_73| 0)) (= (ite .cse8 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_47|) (let ((.cse11 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_105 256) 0)) (.cse10 (= |v_ULTIMATE.start_main_#t~mem32#1_154| |v_ULTIMATE.start_main_#t~mem32#1_152|))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_149| v_~__unbuffered_p0_EAX~0_153) (let ((.cse9 (= (mod v_~weak$$choice1~0_144 256) 0))) (or (and (= (select (select |v_#memory_int_422| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_106) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_106) |v_ULTIMATE.start_main_#t~mem32#1_152|) (not .cse9) (= |v_ULTIMATE.start_main_#t~ite33#1_149| |v_ULTIMATE.start_main_#t~mem32#1_152|)) (and .cse9 (= |v_ULTIMATE.start_main_#t~ite33#1_149| v_~__unbuffered_p0_EAX~0_154) .cse10))) (not .cse11)) (and (= v_~__unbuffered_p0_EAX~0_154 v_~__unbuffered_p0_EAX~0_153) (= |v_ULTIMATE.start_main_#t~ite33#1_149| |v_ULTIMATE.start_main_#t~ite33#1_151|) .cse11 .cse10))) (= v_~y$r_buff0_thd1~0_188 v_~y$r_buff1_thd1~0_189) (or (and (= |v_ULTIMATE.start_main_#t~ite29#1_145| |v_ULTIMATE.start_main_#t~ite29#1_143|) (= |v_ULTIMATE.start_main_#t~mem28#1_146| |v_ULTIMATE.start_main_#t~mem28#1_144|) .cse7 (= |v_ULTIMATE.start_main_#t~ite30#1_116| v_~y$w_buff0~0_284)) (and (= |v_ULTIMATE.start_main_#t~ite29#1_143| |v_ULTIMATE.start_main_#t~mem28#1_144|) .cse12 (= |v_ULTIMATE.start_main_#t~ite29#1_143| |v_ULTIMATE.start_main_#t~ite30#1_116|) (= |v_ULTIMATE.start_main_#t~mem28#1_144| (select .cse13 |v_~#y~0.offset_202|)))) (= |v_P2Thread1of1ForFork1_~arg#1.base_27| |v_P2Thread1of1ForFork1_#in~arg#1.base_27|) (= v_~y$w_buff1~0_240 v_~y$w_buff0~0_285) (or (and (= |v_P2Thread1of1ForFork1_#t~ite20#1_62| |v_P2_#t~ite20#1_61|) (= |v_P2_#t~ite21#1_59| v_~y$w_buff0~0_284) (= |v_P2Thread1of1ForFork1_#t~mem19#1_62| |v_P2_#t~mem19#1_62|) .cse0) (and (= |v_P2_#t~mem19#1_62| |v_ULTIMATE.start_main_#t~ite30#1_116|) (= |v_P2_#t~ite20#1_61| |v_P2_#t~ite21#1_59|) (= |v_P2_#t~ite20#1_61| |v_P2_#t~mem19#1_62|) .cse14)) (= (store |v_#memory_int_423| |v_~#y~0.base_202| (store .cse13 |v_~#y~0.offset_202| |v_P2_#t~ite21#1_59|)) |v_#memory_int_422|) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_27| |v_P2Thread1of1ForFork1_~arg#1.offset_27|) (= (ite (or (and .cse2 (not (= (mod v_~y$r_buff0_thd3~0_175 256) 0))) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_385 256) 0)))) 0 v_~y$r_buff0_thd3~0_176) v_~y$r_buff1_thd3~0_136) (= v_~weak$$choice1~0_144 |v_ULTIMATE.start_main_#t~nondet31#1_89|) (= v_~y$w_buff0~0_284 1)))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_202|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_436, ~#y~0.base=|v_~#y~0.base_202|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_154, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_27|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_176, ~y$w_buff0~0=v_~y$w_buff0~0_285, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_188, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_105, P2Thread1of1ForFork1_#t~mem19#1=|v_P2Thread1of1ForFork1_#t~mem19#1_62|, P2Thread1of1ForFork1_#t~ite20#1=|v_P2Thread1of1ForFork1_#t~ite20#1_62|, ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_154|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_76, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_89|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_27|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_106, ULTIMATE.start_main_#t~ite29#1=|v_ULTIMATE.start_main_#t~ite29#1_145|, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_151|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_150, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_106, #memory_int=|v_#memory_int_423|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_146|, ~x~0=v_~x~0_117, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_65|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|, ~#y~0.offset=|v_~#y~0.offset_202|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_435, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ~#y~0.base=|v_~#y~0.base_202|, P2Thread1of1ForFork1_#t~ite21#1=|v_P2Thread1of1ForFork1_#t~ite21#1_33|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_189, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_153, ~weak$$choice1~0=v_~weak$$choice1~0_144, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_136, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_27|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_175, ~y$w_buff0~0=v_~y$w_buff0~0_284, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_73|, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_27|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_188, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_79, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_105, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_76, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_70|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_27|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_106, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, ULTIMATE.start_main_#t~ite30#1=|v_ULTIMATE.start_main_#t~ite30#1_115|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|, ~y$w_buff1~0=v_~y$w_buff1~0_240, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_149, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_106, #memory_int=|v_#memory_int_422|, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_47|, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_150, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_385, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_65|, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_47|} AuxVars[|v_ULTIMATE.start_main_#t~ite29#1_143|, |v_ULTIMATE.start_main_#t~mem32#1_152|, |v_ULTIMATE.start_main_#t~mem28#1_144|, |v_P2_#t~ite20#1_61|, |v_ULTIMATE.start_main_#t~ite33#1_149|, |v_P2_#t~mem19#1_62|, |v_ULTIMATE.start_main_#t~ite30#1_116|, |v_P2_#t~ite21#1_59|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~main$tmp_guard1~0, P2Thread1of1ForFork1_#t~ite21#1, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, P2Thread1of1ForFork1_~arg#1.base, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork1_#t~mem19#1, P2Thread1of1ForFork1_#t~ite20#1, ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start_main_#t~ite34#1, ULTIMATE.start_main_#t~nondet31#1, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite30#1, ULTIMATE.start_main_#t~ite29#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite33#1, #memory_int, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~mem28#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] [2022-12-06 04:37:13,469 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:37:13,470 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1002 [2022-12-06 04:37:13,470 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 190 flow [2022-12-06 04:37:13,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:37:13,470 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:37:13,470 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:37:13,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:37:13,471 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:37:13,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:37:13,471 INFO L85 PathProgramCache]: Analyzing trace with hash 2106936769, now seen corresponding path program 1 times [2022-12-06 04:37:13,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:37:13,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014391511] [2022-12-06 04:37:13,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:37:13,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:37:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:37:13,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:37:13,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:37:13,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014391511] [2022-12-06 04:37:13,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014391511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:37:13,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:37:13,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:37:13,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152778805] [2022-12-06 04:37:13,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:37:13,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:37:13,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:37:13,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:37:13,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:37:13,638 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 04:37:13,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 190 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:37:13,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:37:13,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 04:37:13,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:37:13,761 INFO L130 PetriNetUnfolder]: 135/269 cut-off events. [2022-12-06 04:37:13,761 INFO L131 PetriNetUnfolder]: For 660/660 co-relation queries the response was YES. [2022-12-06 04:37:13,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1134 conditions, 269 events. 135/269 cut-off events. For 660/660 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 933 event pairs, 41 based on Foata normal form. 6/275 useless extension candidates. Maximal degree in co-relation 1112. Up to 125 conditions per place. [2022-12-06 04:37:13,762 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 31 selfloop transitions, 2 changer transitions 14/47 dead transitions. [2022-12-06 04:37:13,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 47 transitions, 418 flow [2022-12-06 04:37:13,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:37:13,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:37:13,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 04:37:13,763 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-06 04:37:13,763 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 190 flow. Second operand 4 states and 36 transitions. [2022-12-06 04:37:13,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 47 transitions, 418 flow [2022-12-06 04:37:13,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 355 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-12-06 04:37:13,765 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 171 flow [2022-12-06 04:37:13,765 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2022-12-06 04:37:13,765 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places. [2022-12-06 04:37:13,765 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:37:13,766 INFO L89 Accepts]: Start accepts. Operand has 43 places, 28 transitions, 171 flow [2022-12-06 04:37:13,766 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:37:13,766 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:37:13,766 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 28 transitions, 171 flow [2022-12-06 04:37:13,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 28 transitions, 171 flow [2022-12-06 04:37:13,776 INFO L130 PetriNetUnfolder]: 37/102 cut-off events. [2022-12-06 04:37:13,776 INFO L131 PetriNetUnfolder]: For 207/225 co-relation queries the response was YES. [2022-12-06 04:37:13,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 102 events. 37/102 cut-off events. For 207/225 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 6 based on Foata normal form. 7/103 useless extension candidates. Maximal degree in co-relation 321. Up to 55 conditions per place. [2022-12-06 04:37:13,777 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 28 transitions, 171 flow [2022-12-06 04:37:13,777 INFO L188 LiptonReduction]: Number of co-enabled transitions 118 [2022-12-06 04:37:13,778 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:37:13,778 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 04:37:13,778 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 171 flow [2022-12-06 04:37:13,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:37:13,778 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:37:13,779 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:37:13,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:37:13,779 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:37:13,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:37:13,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1811792187, now seen corresponding path program 2 times [2022-12-06 04:37:13,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:37:13,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976264855] [2022-12-06 04:37:13,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:37:13,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:37:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:37:13,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:37:13,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:37:13,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976264855] [2022-12-06 04:37:13,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976264855] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:37:13,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:37:13,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:37:13,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137672721] [2022-12-06 04:37:13,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:37:13,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:37:13,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:37:13,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:37:13,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:37:13,916 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 04:37:13,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:37:13,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:37:13,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 04:37:13,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:37:13,989 INFO L130 PetriNetUnfolder]: 93/199 cut-off events. [2022-12-06 04:37:13,990 INFO L131 PetriNetUnfolder]: For 387/405 co-relation queries the response was YES. [2022-12-06 04:37:13,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 783 conditions, 199 events. 93/199 cut-off events. For 387/405 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 727 event pairs, 11 based on Foata normal form. 13/203 useless extension candidates. Maximal degree in co-relation 762. Up to 68 conditions per place. [2022-12-06 04:37:13,991 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 31 selfloop transitions, 10 changer transitions 1/45 dead transitions. [2022-12-06 04:37:13,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 330 flow [2022-12-06 04:37:13,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:37:13,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:37:13,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-12-06 04:37:13,992 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.51 [2022-12-06 04:37:13,992 INFO L175 Difference]: Start difference. First operand has 43 places, 28 transitions, 171 flow. Second operand 5 states and 51 transitions. [2022-12-06 04:37:13,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 330 flow [2022-12-06 04:37:13,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 329 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:37:13,994 INFO L231 Difference]: Finished difference. Result has 46 places, 27 transitions, 171 flow [2022-12-06 04:37:13,994 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=46, PETRI_TRANSITIONS=27} [2022-12-06 04:37:13,994 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 13 predicate places. [2022-12-06 04:37:13,994 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:37:13,994 INFO L89 Accepts]: Start accepts. Operand has 46 places, 27 transitions, 171 flow [2022-12-06 04:37:13,996 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:37:13,996 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:37:13,996 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 27 transitions, 171 flow [2022-12-06 04:37:13,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 27 transitions, 171 flow [2022-12-06 04:37:14,006 INFO L130 PetriNetUnfolder]: 36/100 cut-off events. [2022-12-06 04:37:14,006 INFO L131 PetriNetUnfolder]: For 202/215 co-relation queries the response was YES. [2022-12-06 04:37:14,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 100 events. 36/100 cut-off events. For 202/215 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 6 based on Foata normal form. 1/95 useless extension candidates. Maximal degree in co-relation 358. Up to 53 conditions per place. [2022-12-06 04:37:14,007 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 27 transitions, 171 flow [2022-12-06 04:37:14,007 INFO L188 LiptonReduction]: Number of co-enabled transitions 118 [2022-12-06 04:37:14,008 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:37:14,008 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 04:37:14,008 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 27 transitions, 171 flow [2022-12-06 04:37:14,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:37:14,008 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:37:14,008 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:37:14,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:37:14,009 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:37:14,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:37:14,009 INFO L85 PathProgramCache]: Analyzing trace with hash 567155544, now seen corresponding path program 1 times [2022-12-06 04:37:14,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:37:14,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197119292] [2022-12-06 04:37:14,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:37:14,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:37:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:37:14,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:37:14,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:37:14,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197119292] [2022-12-06 04:37:14,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197119292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:37:14,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:37:14,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:37:14,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048459457] [2022-12-06 04:37:14,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:37:14,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:37:14,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:37:14,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:37:14,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:37:14,172 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 04:37:14,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 27 transitions, 171 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:37:14,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:37:14,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 04:37:14,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:37:14,262 INFO L130 PetriNetUnfolder]: 78/170 cut-off events. [2022-12-06 04:37:14,262 INFO L131 PetriNetUnfolder]: For 375/384 co-relation queries the response was YES. [2022-12-06 04:37:14,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 170 events. 78/170 cut-off events. For 375/384 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 608 event pairs, 11 based on Foata normal form. 18/179 useless extension candidates. Maximal degree in co-relation 699. Up to 62 conditions per place. [2022-12-06 04:37:14,263 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 20 selfloop transitions, 10 changer transitions 17/49 dead transitions. [2022-12-06 04:37:14,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 389 flow [2022-12-06 04:37:14,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:37:14,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:37:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-12-06 04:37:14,264 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45112781954887216 [2022-12-06 04:37:14,264 INFO L175 Difference]: Start difference. First operand has 46 places, 27 transitions, 171 flow. Second operand 7 states and 60 transitions. [2022-12-06 04:37:14,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 389 flow [2022-12-06 04:37:14,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 324 flow, removed 17 selfloop flow, removed 5 redundant places. [2022-12-06 04:37:14,267 INFO L231 Difference]: Finished difference. Result has 50 places, 23 transitions, 148 flow [2022-12-06 04:37:14,267 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=148, PETRI_PLACES=50, PETRI_TRANSITIONS=23} [2022-12-06 04:37:14,268 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2022-12-06 04:37:14,268 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:37:14,268 INFO L89 Accepts]: Start accepts. Operand has 50 places, 23 transitions, 148 flow [2022-12-06 04:37:14,269 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:37:14,269 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:37:14,269 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 23 transitions, 148 flow [2022-12-06 04:37:14,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 23 transitions, 148 flow [2022-12-06 04:37:14,273 INFO L130 PetriNetUnfolder]: 6/32 cut-off events. [2022-12-06 04:37:14,273 INFO L131 PetriNetUnfolder]: For 55/62 co-relation queries the response was YES. [2022-12-06 04:37:14,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 32 events. 6/32 cut-off events. For 55/62 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 44 event pairs, 0 based on Foata normal form. 1/31 useless extension candidates. Maximal degree in co-relation 108. Up to 13 conditions per place. [2022-12-06 04:37:14,274 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 23 transitions, 148 flow [2022-12-06 04:37:14,274 INFO L188 LiptonReduction]: Number of co-enabled transitions 64 [2022-12-06 04:37:18,310 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 04:37:18,311 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4043 [2022-12-06 04:37:18,311 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 19 transitions, 156 flow [2022-12-06 04:37:18,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:37:18,312 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:37:18,312 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:37:18,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:37:18,312 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:37:18,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:37:18,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1377961663, now seen corresponding path program 1 times [2022-12-06 04:37:18,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:37:18,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172149052] [2022-12-06 04:37:18,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:37:18,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:37:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:37:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:37:18,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:37:18,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172149052] [2022-12-06 04:37:18,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172149052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:37:18,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:37:18,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:37:18,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881849401] [2022-12-06 04:37:18,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:37:18,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:37:18,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:37:18,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:37:18,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:37:18,520 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 04:37:18,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 19 transitions, 156 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:37:18,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:37:18,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 04:37:18,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:37:18,598 INFO L130 PetriNetUnfolder]: 52/122 cut-off events. [2022-12-06 04:37:18,598 INFO L131 PetriNetUnfolder]: For 376/376 co-relation queries the response was YES. [2022-12-06 04:37:18,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 567 conditions, 122 events. 52/122 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 437 event pairs, 20 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 544. Up to 67 conditions per place. [2022-12-06 04:37:18,599 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 18 selfloop transitions, 3 changer transitions 15/36 dead transitions. [2022-12-06 04:37:18,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 36 transitions, 356 flow [2022-12-06 04:37:18,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:37:18,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:37:18,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-12-06 04:37:18,600 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38823529411764707 [2022-12-06 04:37:18,600 INFO L175 Difference]: Start difference. First operand has 42 places, 19 transitions, 156 flow. Second operand 5 states and 33 transitions. [2022-12-06 04:37:18,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 36 transitions, 356 flow [2022-12-06 04:37:18,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 36 transitions, 277 flow, removed 19 selfloop flow, removed 10 redundant places. [2022-12-06 04:37:18,603 INFO L231 Difference]: Finished difference. Result has 38 places, 19 transitions, 125 flow [2022-12-06 04:37:18,603 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=38, PETRI_TRANSITIONS=19} [2022-12-06 04:37:18,604 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2022-12-06 04:37:18,604 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:37:18,604 INFO L89 Accepts]: Start accepts. Operand has 38 places, 19 transitions, 125 flow [2022-12-06 04:37:18,605 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:37:18,605 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:37:18,605 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 19 transitions, 125 flow [2022-12-06 04:37:18,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 19 transitions, 125 flow [2022-12-06 04:37:18,612 INFO L130 PetriNetUnfolder]: 5/27 cut-off events. [2022-12-06 04:37:18,612 INFO L131 PetriNetUnfolder]: For 102/120 co-relation queries the response was YES. [2022-12-06 04:37:18,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 27 events. 5/27 cut-off events. For 102/120 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 53 event pairs, 0 based on Foata normal form. 3/28 useless extension candidates. Maximal degree in co-relation 92. Up to 9 conditions per place. [2022-12-06 04:37:18,612 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 19 transitions, 125 flow [2022-12-06 04:37:18,612 INFO L188 LiptonReduction]: Number of co-enabled transitions 36 [2022-12-06 04:37:18,669 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:37:18,670 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-06 04:37:18,670 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 18 transitions, 124 flow [2022-12-06 04:37:18,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:37:18,671 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:37:18,671 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:37:18,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:37:18,671 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:37:18,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:37:18,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1786169191, now seen corresponding path program 1 times [2022-12-06 04:37:18,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:37:18,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583708652] [2022-12-06 04:37:18,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:37:18,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:37:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:37:18,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:37:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:37:18,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:37:18,787 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:37:18,788 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 04:37:18,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 04:37:18,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 04:37:18,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 04:37:18,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 04:37:18,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 04:37:18,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 04:37:18,790 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:37:18,794 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:37:18,794 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:37:18,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:37:18 BasicIcfg [2022-12-06 04:37:18,875 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:37:18,875 INFO L158 Benchmark]: Toolchain (without parser) took 518171.70ms. Allocated memory was 255.9MB in the beginning and 1.1GB in the end (delta: 860.9MB). Free memory was 231.5MB in the beginning and 852.1MB in the end (delta: -620.6MB). Peak memory consumption was 240.8MB. Max. memory is 8.0GB. [2022-12-06 04:37:18,875 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 255.9MB. Free memory is still 233.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:37:18,875 INFO L158 Benchmark]: CACSL2BoogieTranslator took 503.59ms. Allocated memory is still 255.9MB. Free memory was 231.1MB in the beginning and 204.3MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 04:37:18,876 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.69ms. Allocated memory is still 255.9MB. Free memory was 204.3MB in the beginning and 201.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:37:18,876 INFO L158 Benchmark]: Boogie Preprocessor took 53.42ms. Allocated memory is still 255.9MB. Free memory was 201.7MB in the beginning and 199.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:37:18,876 INFO L158 Benchmark]: RCFGBuilder took 948.66ms. Allocated memory was 255.9MB in the beginning and 323.0MB in the end (delta: 67.1MB). Free memory was 199.6MB in the beginning and 284.2MB in the end (delta: -84.6MB). Peak memory consumption was 58.4MB. Max. memory is 8.0GB. [2022-12-06 04:37:18,876 INFO L158 Benchmark]: TraceAbstraction took 516602.76ms. Allocated memory was 323.0MB in the beginning and 1.1GB in the end (delta: 793.8MB). Free memory was 283.7MB in the beginning and 852.1MB in the end (delta: -568.4MB). Peak memory consumption was 225.4MB. Max. memory is 8.0GB. [2022-12-06 04:37:18,877 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 255.9MB. Free memory is still 233.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 503.59ms. Allocated memory is still 255.9MB. Free memory was 231.1MB in the beginning and 204.3MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.69ms. Allocated memory is still 255.9MB. Free memory was 204.3MB in the beginning and 201.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.42ms. Allocated memory is still 255.9MB. Free memory was 201.7MB in the beginning and 199.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 948.66ms. Allocated memory was 255.9MB in the beginning and 323.0MB in the end (delta: 67.1MB). Free memory was 199.6MB in the beginning and 284.2MB in the end (delta: -84.6MB). Peak memory consumption was 58.4MB. Max. memory is 8.0GB. * TraceAbstraction took 516602.76ms. Allocated memory was 323.0MB in the beginning and 1.1GB in the end (delta: 793.8MB). Free memory was 283.7MB in the beginning and 852.1MB in the end (delta: -568.4MB). Peak memory consumption was 225.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 501.4s, 130 PlacesBefore, 33 PlacesAfterwards, 122 TransitionsBefore, 24 TransitionsAfterwards, 1676 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 57 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 101 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1287, independent: 1236, independent conditional: 1236, independent unconditional: 0, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1287, independent: 1236, independent conditional: 0, independent unconditional: 1236, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1287, independent: 1236, independent conditional: 0, independent unconditional: 1236, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1287, independent: 1236, independent conditional: 0, independent unconditional: 1236, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1022, independent: 990, independent conditional: 0, independent unconditional: 990, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1022, independent: 980, independent conditional: 0, independent unconditional: 980, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 250, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 238, dependent conditional: 0, dependent unconditional: 238, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1287, independent: 246, independent conditional: 0, independent unconditional: 246, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 1022, unknown conditional: 0, unknown unconditional: 1022] , Statistics on independence cache: Total cache size (in pairs): 1596, Positive cache size: 1564, Positive conditional cache size: 0, Positive unconditional cache size: 1564, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, 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.2s, 28 PlacesBefore, 28 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 58, independent: 40, independent conditional: 2, independent unconditional: 38, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 58, independent: 40, independent conditional: 2, independent unconditional: 38, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 58, independent: 40, independent conditional: 2, independent unconditional: 38, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 54, independent: 39, independent conditional: 2, independent unconditional: 37, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 54, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 169, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 154, dependent conditional: 33, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 58, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 54, unknown conditional: 4, unknown unconditional: 50] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 39, Positive conditional cache size: 2, Positive unconditional cache size: 37, Negative cache size: 15, Negative conditional cache size: 2, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 29 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 40, independent conditional: 2, independent unconditional: 38, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 41, Positive conditional cache size: 2, Positive unconditional cache size: 39, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 41, independent conditional: 41, 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: 56, independent: 41, independent conditional: 4, independent unconditional: 37, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, independent: 41, independent conditional: 0, independent unconditional: 41, 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: 56, independent: 41, independent conditional: 0, independent unconditional: 41, 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: 56, independent: 41, independent conditional: 0, independent unconditional: 41, 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): 58, Positive cache size: 41, Positive conditional cache size: 2, Positive unconditional cache size: 39, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 49, independent: 35, independent conditional: 3, independent unconditional: 32, dependent: 14, dependent conditional: 2, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 14, dependent conditional: 2, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 14, dependent conditional: 2, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 3, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 49, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 42, Positive conditional cache size: 2, Positive unconditional cache size: 40, Negative cache size: 21, Negative conditional cache size: 4, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 47, independent: 31, independent conditional: 3, independent unconditional: 28, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 44, Positive conditional cache size: 2, Positive unconditional cache size: 42, Negative cache size: 22, Negative conditional cache size: 5, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 37 PlacesBefore, 36 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 154 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 114, independent: 94, independent conditional: 94, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 114, independent: 94, independent conditional: 34, independent unconditional: 60, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 114, independent: 94, independent conditional: 12, independent unconditional: 82, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114, independent: 94, independent conditional: 12, independent unconditional: 82, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 2, 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: 15, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 114, independent: 79, independent conditional: 10, independent unconditional: 69, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 15, unknown conditional: 2, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 60, Positive conditional cache size: 4, Positive unconditional cache size: 56, Negative cache size: 22, Negative conditional cache size: 5, Negative unconditional cache size: 17, 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: 2.4s, 39 PlacesBefore, 38 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 130, independent: 100, independent conditional: 100, 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: 130, independent: 100, independent conditional: 21, independent unconditional: 79, dependent: 30, dependent conditional: 3, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 130, independent: 100, independent conditional: 18, independent unconditional: 82, dependent: 30, dependent conditional: 3, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 130, independent: 100, independent conditional: 18, independent unconditional: 82, dependent: 30, dependent conditional: 3, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 3, independent unconditional: 4, 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: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 130, independent: 93, independent conditional: 15, independent unconditional: 78, dependent: 30, dependent conditional: 3, dependent unconditional: 27, unknown: 7, unknown conditional: 3, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 67, Positive conditional cache size: 7, Positive unconditional cache size: 60, Negative cache size: 22, Negative conditional cache size: 5, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 12, independent conditional: 3, independent unconditional: 9, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 6, dependent conditional: 1, dependent unconditional: 5, 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: 18, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 67, Positive conditional cache size: 7, Positive unconditional cache size: 60, Negative cache size: 22, Negative conditional cache size: 5, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 42 PlacesBefore, 42 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42, independent: 28, independent conditional: 5, independent unconditional: 23, dependent: 14, dependent conditional: 2, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, independent: 28, independent conditional: 4, independent unconditional: 24, dependent: 14, dependent conditional: 2, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 28, independent conditional: 4, independent unconditional: 24, dependent: 14, dependent conditional: 2, 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: 42, independent: 27, independent conditional: 4, independent unconditional: 23, dependent: 14, dependent conditional: 2, dependent unconditional: 12, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 68, Positive conditional cache size: 7, Positive unconditional cache size: 61, Negative cache size: 22, Negative conditional cache size: 5, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 68, Positive conditional cache size: 7, Positive unconditional cache size: 61, Negative cache size: 22, Negative conditional cache size: 5, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 68, Positive conditional cache size: 7, Positive unconditional cache size: 61, Negative cache size: 22, Negative conditional cache size: 5, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 46 PlacesBefore, 42 PlacesAfterwards, 23 TransitionsBefore, 19 TransitionsAfterwards, 64 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 47, independent: 42, independent conditional: 32, independent unconditional: 10, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 42, independent conditional: 30, independent unconditional: 12, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 42, independent conditional: 30, independent unconditional: 12, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 7, independent unconditional: 4, 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: 12, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, independent: 31, independent conditional: 23, independent unconditional: 8, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 12, unknown conditional: 8, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 105, Positive conditional cache size: 15, Positive unconditional cache size: 90, Negative cache size: 23, Negative conditional cache size: 6, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 36 PlacesBefore, 34 PlacesAfterwards, 19 TransitionsBefore, 18 TransitionsAfterwards, 36 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 113, Positive conditional cache size: 15, Positive unconditional cache size: 98, Negative cache size: 23, Negative conditional cache size: 6, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - 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; [L844] 0 pthread_t t2100; [L845] FCALL, FORK 0 pthread_create(&t2100, ((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(&t2100, ((void *)0), P0, ((void *)0))=-2, t2100={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] [L846] 0 pthread_t t2101; [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 [L780] 1 __unbuffered_p0_EBX = x [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L847] FCALL, FORK 0 pthread_create(&t2101, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __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, pthread_create(&t2101, ((void *)0), P1, ((void *)0))=-1, t2100={7:0}, t2101={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] [L792] 2 x = 1 [L795] 2 x = 2 VAL [\result={0:0}, __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, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=2, 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] [L848] 0 pthread_t t2102; [L849] FCALL, FORK 0 pthread_create(&t2102, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __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(&t2102, ((void *)0), P2, ((void *)0))=0, t2100={7:0}, t2101={5:0}, t2102={6:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=2, 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] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L807] 3 __unbuffered_p2_EAX = x [L810] 3 y$w_buff1 = y$w_buff0 [L811] 3 y$w_buff0 = 1 [L812] 3 y$w_buff1_used = y$w_buff0_used [L813] 3 y$w_buff0_used = (_Bool)1 [L814] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L814] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L815] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L816] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L817] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L818] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L819] 3 y$r_buff0_thd3 = (_Bool)1 [L822] 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) [L822] 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) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 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 [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 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) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 \read(y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] 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) [L855] 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) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 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 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 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 [L862] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L863] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L863] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L863] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L863] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L863] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L863] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __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=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=2, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 845]: 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: 847]: 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: 849]: 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, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 516.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 501.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 281 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 281 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 783 IncrementalHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 8 mSDtfsCounter, 783 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=9, InterpolantAutomatonStates: 60, 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, 3.1s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 926 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:37:18,919 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...