/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/mix040.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:16:04,048 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:16:04,050 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:16:04,076 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:16:04,076 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:16:04,079 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:16:04,081 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:16:04,085 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:16:04,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:16:04,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:16:04,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:16:04,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:16:04,095 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:16:04,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:16:04,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:16:04,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:16:04,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:16:04,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:16:04,104 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:16:04,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:16:04,109 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:16:04,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:16:04,111 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:16:04,111 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:16:04,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:16:04,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:16:04,114 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:16:04,114 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:16:04,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:16:04,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:16:04,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:16:04,115 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:16:04,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:16:04,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:16:04,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:16:04,117 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:16:04,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:16:04,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:16:04,118 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:16:04,118 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:16:04,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:16:04,123 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:16:04,154 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:16:04,155 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:16:04,156 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:16:04,156 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:16:04,157 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:16:04,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:16:04,157 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:16:04,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:16:04,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:16:04,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:16:04,158 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:16:04,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:16:04,158 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:16:04,158 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:16:04,159 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:16:04,159 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:16:04,159 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:16:04,159 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:16:04,159 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:16:04,159 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:16:04,159 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:16:04,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:16:04,159 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:16:04,160 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:16:04,160 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:16:04,160 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:16:04,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:16:04,160 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:16:04,160 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:16:04,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:16:04,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:16:04,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:16:04,425 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:16:04,426 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:16:04,427 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040.opt.i [2022-12-06 04:16:05,503 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:16:05,733 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:16:05,733 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040.opt.i [2022-12-06 04:16:05,742 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f1536c18/5cf7c28a997641e2a48ad9b4f0369706/FLAGe92b93bb3 [2022-12-06 04:16:05,753 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f1536c18/5cf7c28a997641e2a48ad9b4f0369706 [2022-12-06 04:16:05,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:16:05,756 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:16:05,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:16:05,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:16:05,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:16:05,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:16:05" (1/1) ... [2022-12-06 04:16:05,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb92a2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:05, skipping insertion in model container [2022-12-06 04:16:05,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:16:05" (1/1) ... [2022-12-06 04:16:05,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:16:05,801 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:16:05,970 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/mix040.opt.i[944,957] [2022-12-06 04:16:06,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:16:06,180 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:16:06,189 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/mix040.opt.i[944,957] [2022-12-06 04:16:06,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:06,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:06,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:16:06,279 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:16:06,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:06 WrapperNode [2022-12-06 04:16:06,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:16:06,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:16:06,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:16:06,282 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:16:06,287 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:16:06" (1/1) ... [2022-12-06 04:16:06,317 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:16:06" (1/1) ... [2022-12-06 04:16:06,337 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2022-12-06 04:16:06,338 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:16:06,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:16:06,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:16:06,338 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:16:06,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:06" (1/1) ... [2022-12-06 04:16:06,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:06" (1/1) ... [2022-12-06 04:16:06,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:06" (1/1) ... [2022-12-06 04:16:06,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:06" (1/1) ... [2022-12-06 04:16:06,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:06" (1/1) ... [2022-12-06 04:16:06,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:06" (1/1) ... [2022-12-06 04:16:06,374 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:06" (1/1) ... [2022-12-06 04:16:06,376 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:06" (1/1) ... [2022-12-06 04:16:06,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:16:06,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:16:06,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:16:06,379 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:16:06,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:06" (1/1) ... [2022-12-06 04:16:06,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:16:06,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:16:06,404 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:16:06,422 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:16:06,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:16:06,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:16:06,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:16:06,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:16:06,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:16:06,437 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:16:06,437 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:16:06,437 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:16:06,437 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:16:06,437 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:16:06,437 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:16:06,437 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:16:06,438 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:16:06,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:16:06,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:16:06,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:16:06,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:16:06,440 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:16:06,560 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:16:06,562 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:16:06,815 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:16:06,928 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:16:06,929 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:16:06,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:16:06 BoogieIcfgContainer [2022-12-06 04:16:06,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:16:06,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:16:06,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:16:06,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:16:06,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:16:05" (1/3) ... [2022-12-06 04:16:06,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1170d3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:16:06, skipping insertion in model container [2022-12-06 04:16:06,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:06" (2/3) ... [2022-12-06 04:16:06,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1170d3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:16:06, skipping insertion in model container [2022-12-06 04:16:06,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:16:06" (3/3) ... [2022-12-06 04:16:06,938 INFO L112 eAbstractionObserver]: Analyzing ICFG mix040.opt.i [2022-12-06 04:16:06,954 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:16:06,955 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:16:06,955 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:16:07,039 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:16:07,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2022-12-06 04:16:07,150 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-06 04:16:07,151 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:16:07,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-06 04:16:07,157 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2022-12-06 04:16:07,162 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2022-12-06 04:16:07,164 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:07,190 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-06 04:16:07,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2022-12-06 04:16:07,234 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-06 04:16:07,234 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:16:07,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-06 04:16:07,239 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-06 04:16:07,239 INFO L188 LiptonReduction]: Number of co-enabled transitions 2816 [2022-12-06 04:16:11,590 INFO L203 LiptonReduction]: Total number of compositions: 98 [2022-12-06 04:16:11,605 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:16:11,609 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;@11419e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:16:11,610 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 04:16:11,613 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-06 04:16:11,613 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:16:11,613 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:11,614 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:11,614 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:11,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:11,618 INFO L85 PathProgramCache]: Analyzing trace with hash 2085631278, now seen corresponding path program 1 times [2022-12-06 04:16:11,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:11,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582543666] [2022-12-06 04:16:11,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:11,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:11,929 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:16:11,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:11,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582543666] [2022-12-06 04:16:11,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582543666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:11,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:11,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:16:11,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503366889] [2022-12-06 04:16:11,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:11,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:16:11,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:11,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:16:11,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:16:11,955 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-06 04:16:11,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:11,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:11,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-06 04:16:11,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:12,355 INFO L130 PetriNetUnfolder]: 3113/4514 cut-off events. [2022-12-06 04:16:12,355 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-12-06 04:16:12,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8908 conditions, 4514 events. 3113/4514 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 24112 event pairs, 593 based on Foata normal form. 0/4150 useless extension candidates. Maximal degree in co-relation 8896. Up to 3385 conditions per place. [2022-12-06 04:16:12,410 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 30 selfloop transitions, 2 changer transitions 4/39 dead transitions. [2022-12-06 04:16:12,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 162 flow [2022-12-06 04:16:12,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:16:12,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:16:12,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-06 04:16:12,419 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 04:16:12,420 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 50 transitions. [2022-12-06 04:16:12,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 162 flow [2022-12-06 04:16:12,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:16:12,425 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 62 flow [2022-12-06 04:16:12,427 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2022-12-06 04:16:12,431 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2022-12-06 04:16:12,431 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:12,432 INFO L89 Accepts]: Start accepts. Operand has 38 places, 25 transitions, 62 flow [2022-12-06 04:16:12,434 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:12,434 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:12,435 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 25 transitions, 62 flow [2022-12-06 04:16:12,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 25 transitions, 62 flow [2022-12-06 04:16:12,440 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-06 04:16:12,440 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:16:12,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:16:12,441 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 25 transitions, 62 flow [2022-12-06 04:16:12,441 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 04:16:12,625 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:16:12,627 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 04:16:12,627 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 60 flow [2022-12-06 04:16:12,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:12,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:12,627 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:12,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:16:12,630 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:12,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:12,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1458042838, now seen corresponding path program 1 times [2022-12-06 04:16:12,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:12,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294892985] [2022-12-06 04:16:12,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:12,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:12,786 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:16:12,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:12,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294892985] [2022-12-06 04:16:12,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294892985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:12,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:12,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:16:12,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312651557] [2022-12-06 04:16:12,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:12,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:16:12,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:12,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:16:12,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:16:12,788 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 04:16:12,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 60 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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:16:12,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:12,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 04:16:12,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:13,396 INFO L130 PetriNetUnfolder]: 6240/8685 cut-off events. [2022-12-06 04:16:13,396 INFO L131 PetriNetUnfolder]: For 354/354 co-relation queries the response was YES. [2022-12-06 04:16:13,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18028 conditions, 8685 events. 6240/8685 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 42898 event pairs, 2152 based on Foata normal form. 242/8927 useless extension candidates. Maximal degree in co-relation 18018. Up to 5441 conditions per place. [2022-12-06 04:16:13,436 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 35 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2022-12-06 04:16:13,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 190 flow [2022-12-06 04:16:13,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:16:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:16:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-06 04:16:13,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-06 04:16:13,438 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 60 flow. Second operand 3 states and 44 transitions. [2022-12-06 04:16:13,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 190 flow [2022-12-06 04:16:13,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 43 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:16:13,444 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 118 flow [2022-12-06 04:16:13,444 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2022-12-06 04:16:13,445 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -5 predicate places. [2022-12-06 04:16:13,445 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:13,445 INFO L89 Accepts]: Start accepts. Operand has 37 places, 31 transitions, 118 flow [2022-12-06 04:16:13,446 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:13,446 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:13,446 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 31 transitions, 118 flow [2022-12-06 04:16:13,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 118 flow [2022-12-06 04:16:13,489 INFO L130 PetriNetUnfolder]: 276/619 cut-off events. [2022-12-06 04:16:13,490 INFO L131 PetriNetUnfolder]: For 83/93 co-relation queries the response was YES. [2022-12-06 04:16:13,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1279 conditions, 619 events. 276/619 cut-off events. For 83/93 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3835 event pairs, 120 based on Foata normal form. 0/597 useless extension candidates. Maximal degree in co-relation 1270. Up to 325 conditions per place. [2022-12-06 04:16:13,496 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 31 transitions, 118 flow [2022-12-06 04:16:13,496 INFO L188 LiptonReduction]: Number of co-enabled transitions 344 [2022-12-06 04:16:13,516 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:16:13,517 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-06 04:16:13,518 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 118 flow [2022-12-06 04:16:13,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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:16:13,521 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:13,522 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:13,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:16:13,522 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:13,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:13,523 INFO L85 PathProgramCache]: Analyzing trace with hash 2045313063, now seen corresponding path program 1 times [2022-12-06 04:16:13,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:13,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417392293] [2022-12-06 04:16:13,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:13,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:13,691 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:16:13,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:13,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417392293] [2022-12-06 04:16:13,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417392293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:13,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:13,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:16:13,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361859607] [2022-12-06 04:16:13,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:13,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:16:13,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:13,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:16:13,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:16:13,696 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 04:16:13,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 118 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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:16:13,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:13,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 04:16:13,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:14,277 INFO L130 PetriNetUnfolder]: 5978/8325 cut-off events. [2022-12-06 04:16:14,277 INFO L131 PetriNetUnfolder]: For 4188/4188 co-relation queries the response was YES. [2022-12-06 04:16:14,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22273 conditions, 8325 events. 5978/8325 cut-off events. For 4188/4188 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 40136 event pairs, 1022 based on Foata normal form. 52/8377 useless extension candidates. Maximal degree in co-relation 22261. Up to 4339 conditions per place. [2022-12-06 04:16:14,327 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 46 selfloop transitions, 9 changer transitions 0/55 dead transitions. [2022-12-06 04:16:14,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 306 flow [2022-12-06 04:16:14,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:16:14,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:16:14,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-06 04:16:14,330 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2022-12-06 04:16:14,330 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 118 flow. Second operand 4 states and 50 transitions. [2022-12-06 04:16:14,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 306 flow [2022-12-06 04:16:14,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 55 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:16:14,346 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 170 flow [2022-12-06 04:16:14,346 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2022-12-06 04:16:14,347 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2022-12-06 04:16:14,347 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:14,347 INFO L89 Accepts]: Start accepts. Operand has 41 places, 36 transitions, 170 flow [2022-12-06 04:16:14,349 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:14,349 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:14,349 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 36 transitions, 170 flow [2022-12-06 04:16:14,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 170 flow [2022-12-06 04:16:14,392 INFO L130 PetriNetUnfolder]: 222/529 cut-off events. [2022-12-06 04:16:14,392 INFO L131 PetriNetUnfolder]: For 318/382 co-relation queries the response was YES. [2022-12-06 04:16:14,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1285 conditions, 529 events. 222/529 cut-off events. For 318/382 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3180 event pairs, 69 based on Foata normal form. 0/516 useless extension candidates. Maximal degree in co-relation 1273. Up to 265 conditions per place. [2022-12-06 04:16:14,397 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 36 transitions, 170 flow [2022-12-06 04:16:14,397 INFO L188 LiptonReduction]: Number of co-enabled transitions 390 [2022-12-06 04:16:14,414 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:16:14,415 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-06 04:16:14,415 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 170 flow [2022-12-06 04:16:14,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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:16:14,416 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:14,416 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:14,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:16:14,416 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:14,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:14,416 INFO L85 PathProgramCache]: Analyzing trace with hash 2045313280, now seen corresponding path program 1 times [2022-12-06 04:16:14,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:14,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399142200] [2022-12-06 04:16:14,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:14,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:14,498 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:16:14,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:14,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399142200] [2022-12-06 04:16:14,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399142200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:14,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:14,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:16:14,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646866549] [2022-12-06 04:16:14,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:14,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:16:14,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:14,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:16:14,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:16:14,500 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 04:16:14,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:14,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:14,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 04:16:14,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:15,013 INFO L130 PetriNetUnfolder]: 4886/7069 cut-off events. [2022-12-06 04:16:15,014 INFO L131 PetriNetUnfolder]: For 6955/7077 co-relation queries the response was YES. [2022-12-06 04:16:15,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20053 conditions, 7069 events. 4886/7069 cut-off events. For 6955/7077 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 37901 event pairs, 1944 based on Foata normal form. 123/7056 useless extension candidates. Maximal degree in co-relation 20038. Up to 6213 conditions per place. [2022-12-06 04:16:15,056 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 47 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2022-12-06 04:16:15,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 58 transitions, 364 flow [2022-12-06 04:16:15,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:16:15,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:16:15,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-06 04:16:15,057 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2022-12-06 04:16:15,058 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 170 flow. Second operand 3 states and 46 transitions. [2022-12-06 04:16:15,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 58 transitions, 364 flow [2022-12-06 04:16:15,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 58 transitions, 359 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:16:15,071 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 225 flow [2022-12-06 04:16:15,071 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2022-12-06 04:16:15,072 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2022-12-06 04:16:15,072 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:15,072 INFO L89 Accepts]: Start accepts. Operand has 43 places, 41 transitions, 225 flow [2022-12-06 04:16:15,073 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:15,073 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:15,073 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 41 transitions, 225 flow [2022-12-06 04:16:15,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 41 transitions, 225 flow [2022-12-06 04:16:15,103 INFO L130 PetriNetUnfolder]: 196/478 cut-off events. [2022-12-06 04:16:15,103 INFO L131 PetriNetUnfolder]: For 395/486 co-relation queries the response was YES. [2022-12-06 04:16:15,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 478 events. 196/478 cut-off events. For 395/486 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2861 event pairs, 45 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 1267. Up to 233 conditions per place. [2022-12-06 04:16:15,108 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 41 transitions, 225 flow [2022-12-06 04:16:15,108 INFO L188 LiptonReduction]: Number of co-enabled transitions 448 [2022-12-06 04:16:15,119 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:16:15,123 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-06 04:16:15,123 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 225 flow [2022-12-06 04:16:15,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:15,123 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:15,123 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:15,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:16:15,123 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:15,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:15,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1019803485, now seen corresponding path program 1 times [2022-12-06 04:16:15,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:15,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910196828] [2022-12-06 04:16:15,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:15,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:15,231 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:16:15,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:15,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910196828] [2022-12-06 04:16:15,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910196828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:15,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:15,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:16:15,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552521694] [2022-12-06 04:16:15,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:15,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:16:15,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:15,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:16:15,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:16:15,233 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 04:16:15,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 225 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:16:15,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:15,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 04:16:15,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:15,820 INFO L130 PetriNetUnfolder]: 5666/7901 cut-off events. [2022-12-06 04:16:15,820 INFO L131 PetriNetUnfolder]: For 7956/7956 co-relation queries the response was YES. [2022-12-06 04:16:15,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23998 conditions, 7901 events. 5666/7901 cut-off events. For 7956/7956 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 38623 event pairs, 764 based on Foata normal form. 24/7925 useless extension candidates. Maximal degree in co-relation 23981. Up to 4513 conditions per place. [2022-12-06 04:16:15,860 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 57 selfloop transitions, 21 changer transitions 0/78 dead transitions. [2022-12-06 04:16:15,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 78 transitions, 547 flow [2022-12-06 04:16:15,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:16:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:16:15,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 04:16:15,862 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2022-12-06 04:16:15,862 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 225 flow. Second operand 4 states and 58 transitions. [2022-12-06 04:16:15,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 78 transitions, 547 flow [2022-12-06 04:16:15,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 78 transitions, 539 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:16:15,875 INFO L231 Difference]: Finished difference. Result has 48 places, 54 transitions, 418 flow [2022-12-06 04:16:15,875 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=418, PETRI_PLACES=48, PETRI_TRANSITIONS=54} [2022-12-06 04:16:15,876 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2022-12-06 04:16:15,876 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:15,876 INFO L89 Accepts]: Start accepts. Operand has 48 places, 54 transitions, 418 flow [2022-12-06 04:16:15,876 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:15,877 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:15,877 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 54 transitions, 418 flow [2022-12-06 04:16:15,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 54 transitions, 418 flow [2022-12-06 04:16:15,904 INFO L130 PetriNetUnfolder]: 173/425 cut-off events. [2022-12-06 04:16:15,904 INFO L131 PetriNetUnfolder]: For 877/970 co-relation queries the response was YES. [2022-12-06 04:16:15,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1464 conditions, 425 events. 173/425 cut-off events. For 877/970 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2419 event pairs, 38 based on Foata normal form. 2/419 useless extension candidates. Maximal degree in co-relation 1446. Up to 210 conditions per place. [2022-12-06 04:16:15,908 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 54 transitions, 418 flow [2022-12-06 04:16:15,908 INFO L188 LiptonReduction]: Number of co-enabled transitions 578 [2022-12-06 04:16:15,912 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:16:15,912 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 04:16:15,913 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 54 transitions, 418 flow [2022-12-06 04:16:15,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:16:15,913 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:15,913 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:15,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:16:15,913 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:15,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:15,914 INFO L85 PathProgramCache]: Analyzing trace with hash -815583621, now seen corresponding path program 1 times [2022-12-06 04:16:15,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:15,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117795239] [2022-12-06 04:16:15,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:15,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:15,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:15,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:15,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117795239] [2022-12-06 04:16:15,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117795239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:15,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:15,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:16:15,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285719612] [2022-12-06 04:16:15,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:15,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:16:15,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:15,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:16:15,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:16:15,987 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 04:16:15,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 54 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:15,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:15,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 04:16:15,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:16,616 INFO L130 PetriNetUnfolder]: 5957/8675 cut-off events. [2022-12-06 04:16:16,616 INFO L131 PetriNetUnfolder]: For 19143/19529 co-relation queries the response was YES. [2022-12-06 04:16:16,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28222 conditions, 8675 events. 5957/8675 cut-off events. For 19143/19529 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 48817 event pairs, 2292 based on Foata normal form. 319/8718 useless extension candidates. Maximal degree in co-relation 28201. Up to 4577 conditions per place. [2022-12-06 04:16:16,661 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 48 selfloop transitions, 8 changer transitions 3/71 dead transitions. [2022-12-06 04:16:16,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 71 transitions, 608 flow [2022-12-06 04:16:16,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:16:16,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:16:16,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-06 04:16:16,662 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-06 04:16:16,662 INFO L175 Difference]: Start difference. First operand has 48 places, 54 transitions, 418 flow. Second operand 3 states and 44 transitions. [2022-12-06 04:16:16,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 71 transitions, 608 flow [2022-12-06 04:16:16,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 71 transitions, 608 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:16:16,744 INFO L231 Difference]: Finished difference. Result has 51 places, 53 transitions, 434 flow [2022-12-06 04:16:16,744 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=434, PETRI_PLACES=51, PETRI_TRANSITIONS=53} [2022-12-06 04:16:16,745 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2022-12-06 04:16:16,745 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:16,745 INFO L89 Accepts]: Start accepts. Operand has 51 places, 53 transitions, 434 flow [2022-12-06 04:16:16,746 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:16,746 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:16,746 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 53 transitions, 434 flow [2022-12-06 04:16:16,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 53 transitions, 434 flow [2022-12-06 04:16:16,775 INFO L130 PetriNetUnfolder]: 161/452 cut-off events. [2022-12-06 04:16:16,775 INFO L131 PetriNetUnfolder]: For 1190/1287 co-relation queries the response was YES. [2022-12-06 04:16:16,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1584 conditions, 452 events. 161/452 cut-off events. For 1190/1287 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2805 event pairs, 40 based on Foata normal form. 2/446 useless extension candidates. Maximal degree in co-relation 1564. Up to 216 conditions per place. [2022-12-06 04:16:16,779 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 53 transitions, 434 flow [2022-12-06 04:16:16,779 INFO L188 LiptonReduction]: Number of co-enabled transitions 562 [2022-12-06 04:16:16,782 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:16:16,782 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-06 04:16:16,782 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 53 transitions, 434 flow [2022-12-06 04:16:16,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:16,782 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:16,783 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:16,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:16:16,783 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:16,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:16,783 INFO L85 PathProgramCache]: Analyzing trace with hash 517601950, now seen corresponding path program 1 times [2022-12-06 04:16:16,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:16,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726095959] [2022-12-06 04:16:16,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:16,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:16,905 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:16:16,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:16,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726095959] [2022-12-06 04:16:16,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726095959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:16,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:16,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:16:16,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854131077] [2022-12-06 04:16:16,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:16,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:16:16,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:16,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:16:16,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:16:16,906 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-06 04:16:16,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 53 transitions, 434 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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:16:16,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:16,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-06 04:16:16,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:17,596 INFO L130 PetriNetUnfolder]: 4822/7298 cut-off events. [2022-12-06 04:16:17,596 INFO L131 PetriNetUnfolder]: For 18281/19062 co-relation queries the response was YES. [2022-12-06 04:16:17,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23599 conditions, 7298 events. 4822/7298 cut-off events. For 18281/19062 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 45422 event pairs, 459 based on Foata normal form. 898/7920 useless extension candidates. Maximal degree in co-relation 23576. Up to 3374 conditions per place. [2022-12-06 04:16:17,639 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 85 selfloop transitions, 6 changer transitions 0/108 dead transitions. [2022-12-06 04:16:17,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 108 transitions, 1012 flow [2022-12-06 04:16:17,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:16:17,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:16:17,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 04:16:17,640 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2022-12-06 04:16:17,640 INFO L175 Difference]: Start difference. First operand has 51 places, 53 transitions, 434 flow. Second operand 4 states and 62 transitions. [2022-12-06 04:16:17,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 108 transitions, 1012 flow [2022-12-06 04:16:17,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 108 transitions, 992 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 04:16:17,658 INFO L231 Difference]: Finished difference. Result has 55 places, 58 transitions, 470 flow [2022-12-06 04:16:17,658 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=470, PETRI_PLACES=55, PETRI_TRANSITIONS=58} [2022-12-06 04:16:17,658 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2022-12-06 04:16:17,659 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:17,659 INFO L89 Accepts]: Start accepts. Operand has 55 places, 58 transitions, 470 flow [2022-12-06 04:16:17,659 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:17,659 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:17,660 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 58 transitions, 470 flow [2022-12-06 04:16:17,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 58 transitions, 470 flow [2022-12-06 04:16:17,823 INFO L130 PetriNetUnfolder]: 886/1885 cut-off events. [2022-12-06 04:16:17,823 INFO L131 PetriNetUnfolder]: For 2100/2311 co-relation queries the response was YES. [2022-12-06 04:16:17,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5286 conditions, 1885 events. 886/1885 cut-off events. For 2100/2311 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 15257 event pairs, 359 based on Foata normal form. 9/1611 useless extension candidates. Maximal degree in co-relation 5263. Up to 1350 conditions per place. [2022-12-06 04:16:17,844 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 58 transitions, 470 flow [2022-12-06 04:16:17,844 INFO L188 LiptonReduction]: Number of co-enabled transitions 766 [2022-12-06 04:16:18,129 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:16:18,130 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 471 [2022-12-06 04:16:18,130 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 58 transitions, 472 flow [2022-12-06 04:16:18,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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:16:18,130 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:18,130 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:18,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:16:18,130 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:18,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:18,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1610172504, now seen corresponding path program 1 times [2022-12-06 04:16:18,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:18,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105009127] [2022-12-06 04:16:18,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:18,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:18,253 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:16:18,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:18,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105009127] [2022-12-06 04:16:18,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105009127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:18,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:18,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:16:18,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083748074] [2022-12-06 04:16:18,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:18,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:16:18,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:18,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:16:18,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:16:18,254 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 04:16:18,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 58 transitions, 472 flow. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:18,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:18,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 04:16:18,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:18,972 INFO L130 PetriNetUnfolder]: 6109/9094 cut-off events. [2022-12-06 04:16:18,972 INFO L131 PetriNetUnfolder]: For 28052/28052 co-relation queries the response was YES. [2022-12-06 04:16:18,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36541 conditions, 9094 events. 6109/9094 cut-off events. For 28052/28052 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 51245 event pairs, 1816 based on Foata normal form. 78/9172 useless extension candidates. Maximal degree in co-relation 36515. Up to 4349 conditions per place. [2022-12-06 04:16:19,011 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 71 selfloop transitions, 23 changer transitions 10/104 dead transitions. [2022-12-06 04:16:19,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 104 transitions, 949 flow [2022-12-06 04:16:19,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:16:19,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:16:19,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 04:16:19,012 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.62 [2022-12-06 04:16:19,013 INFO L175 Difference]: Start difference. First operand has 55 places, 58 transitions, 472 flow. Second operand 4 states and 62 transitions. [2022-12-06 04:16:19,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 104 transitions, 949 flow [2022-12-06 04:16:19,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 104 transitions, 924 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 04:16:19,039 INFO L231 Difference]: Finished difference. Result has 59 places, 59 transitions, 587 flow [2022-12-06 04:16:19,039 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=587, PETRI_PLACES=59, PETRI_TRANSITIONS=59} [2022-12-06 04:16:19,039 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2022-12-06 04:16:19,040 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:19,040 INFO L89 Accepts]: Start accepts. Operand has 59 places, 59 transitions, 587 flow [2022-12-06 04:16:19,040 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:19,040 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:19,041 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 59 transitions, 587 flow [2022-12-06 04:16:19,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 59 transitions, 587 flow [2022-12-06 04:16:19,148 INFO L130 PetriNetUnfolder]: 846/1778 cut-off events. [2022-12-06 04:16:19,149 INFO L131 PetriNetUnfolder]: For 2786/2956 co-relation queries the response was YES. [2022-12-06 04:16:19,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4887 conditions, 1778 events. 846/1778 cut-off events. For 2786/2956 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 13794 event pairs, 401 based on Foata normal form. 8/1601 useless extension candidates. Maximal degree in co-relation 4861. Up to 1270 conditions per place. [2022-12-06 04:16:19,166 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 59 transitions, 587 flow [2022-12-06 04:16:19,166 INFO L188 LiptonReduction]: Number of co-enabled transitions 694 [2022-12-06 04:16:19,176 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:16:19,176 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-06 04:16:19,176 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 59 transitions, 587 flow [2022-12-06 04:16:19,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:19,177 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:19,177 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:19,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:16:19,177 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:19,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:19,177 INFO L85 PathProgramCache]: Analyzing trace with hash 901392012, now seen corresponding path program 1 times [2022-12-06 04:16:19,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:19,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666110851] [2022-12-06 04:16:19,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:19,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:19,307 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:16:19,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:19,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666110851] [2022-12-06 04:16:19,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666110851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:19,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:19,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:16:19,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612940082] [2022-12-06 04:16:19,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:19,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:16:19,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:19,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:16:19,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:16:19,309 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-06 04:16:19,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 59 transitions, 587 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:19,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:19,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-06 04:16:19,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:19,807 INFO L130 PetriNetUnfolder]: 3281/5310 cut-off events. [2022-12-06 04:16:19,807 INFO L131 PetriNetUnfolder]: For 17375/17938 co-relation queries the response was YES. [2022-12-06 04:16:19,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19322 conditions, 5310 events. 3281/5310 cut-off events. For 17375/17938 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 34531 event pairs, 200 based on Foata normal form. 835/5975 useless extension candidates. Maximal degree in co-relation 19293. Up to 2352 conditions per place. [2022-12-06 04:16:19,830 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 111 selfloop transitions, 10 changer transitions 0/136 dead transitions. [2022-12-06 04:16:19,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 136 transitions, 1526 flow [2022-12-06 04:16:19,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:16:19,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:16:19,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-12-06 04:16:19,831 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6583333333333333 [2022-12-06 04:16:19,831 INFO L175 Difference]: Start difference. First operand has 59 places, 59 transitions, 587 flow. Second operand 5 states and 79 transitions. [2022-12-06 04:16:19,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 136 transitions, 1526 flow [2022-12-06 04:16:19,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 136 transitions, 1502 flow, removed 12 selfloop flow, removed 0 redundant places. [2022-12-06 04:16:19,840 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 643 flow [2022-12-06 04:16:19,840 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=643, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2022-12-06 04:16:19,841 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2022-12-06 04:16:19,841 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:19,841 INFO L89 Accepts]: Start accepts. Operand has 65 places, 64 transitions, 643 flow [2022-12-06 04:16:19,842 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:19,842 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:19,842 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 64 transitions, 643 flow [2022-12-06 04:16:19,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 64 transitions, 643 flow [2022-12-06 04:16:19,951 INFO L130 PetriNetUnfolder]: 746/1723 cut-off events. [2022-12-06 04:16:19,951 INFO L131 PetriNetUnfolder]: For 3547/4365 co-relation queries the response was YES. [2022-12-06 04:16:19,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6366 conditions, 1723 events. 746/1723 cut-off events. For 3547/4365 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 14137 event pairs, 124 based on Foata normal form. 46/1620 useless extension candidates. Maximal degree in co-relation 6336. Up to 1223 conditions per place. [2022-12-06 04:16:19,970 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 64 transitions, 643 flow [2022-12-06 04:16:19,970 INFO L188 LiptonReduction]: Number of co-enabled transitions 854 [2022-12-06 04:16:20,180 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:16:20,181 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 340 [2022-12-06 04:16:20,181 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 647 flow [2022-12-06 04:16:20,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:20,182 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:20,182 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:20,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:16:20,182 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:20,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:20,182 INFO L85 PathProgramCache]: Analyzing trace with hash 8422292, now seen corresponding path program 1 times [2022-12-06 04:16:20,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:20,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460223741] [2022-12-06 04:16:20,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:20,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:20,323 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:16:20,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:20,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460223741] [2022-12-06 04:16:20,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460223741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:20,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:20,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:16:20,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618550735] [2022-12-06 04:16:20,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:20,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:16:20,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:20,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:16:20,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:16:20,325 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 04:16:20,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 647 flow. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:20,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:20,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 04:16:20,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:20,723 INFO L130 PetriNetUnfolder]: 1874/3170 cut-off events. [2022-12-06 04:16:20,723 INFO L131 PetriNetUnfolder]: For 13057/13500 co-relation queries the response was YES. [2022-12-06 04:16:20,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14115 conditions, 3170 events. 1874/3170 cut-off events. For 13057/13500 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 19445 event pairs, 149 based on Foata normal form. 534/3621 useless extension candidates. Maximal degree in co-relation 14082. Up to 1319 conditions per place. [2022-12-06 04:16:20,738 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 110 selfloop transitions, 14 changer transitions 7/144 dead transitions. [2022-12-06 04:16:20,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 144 transitions, 1599 flow [2022-12-06 04:16:20,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:16:20,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:16:20,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2022-12-06 04:16:20,740 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6266666666666667 [2022-12-06 04:16:20,740 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 647 flow. Second operand 6 states and 94 transitions. [2022-12-06 04:16:20,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 144 transitions, 1599 flow [2022-12-06 04:16:20,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 144 transitions, 1569 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 04:16:20,769 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 669 flow [2022-12-06 04:16:20,769 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=669, PETRI_PLACES=68, PETRI_TRANSITIONS=66} [2022-12-06 04:16:20,770 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2022-12-06 04:16:20,770 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:20,770 INFO L89 Accepts]: Start accepts. Operand has 68 places, 66 transitions, 669 flow [2022-12-06 04:16:20,771 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:20,771 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:20,771 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 66 transitions, 669 flow [2022-12-06 04:16:20,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 66 transitions, 669 flow [2022-12-06 04:16:20,858 INFO L130 PetriNetUnfolder]: 456/1118 cut-off events. [2022-12-06 04:16:20,858 INFO L131 PetriNetUnfolder]: For 3589/3975 co-relation queries the response was YES. [2022-12-06 04:16:20,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4745 conditions, 1118 events. 456/1118 cut-off events. For 3589/3975 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 8351 event pairs, 32 based on Foata normal form. 63/1126 useless extension candidates. Maximal degree in co-relation 4714. Up to 638 conditions per place. [2022-12-06 04:16:20,870 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 66 transitions, 669 flow [2022-12-06 04:16:20,870 INFO L188 LiptonReduction]: Number of co-enabled transitions 746 [2022-12-06 04:16:21,011 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:16:21,012 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 242 [2022-12-06 04:16:21,012 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 675 flow [2022-12-06 04:16:21,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:21,012 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:21,012 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:21,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:16:21,012 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:21,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:21,013 INFO L85 PathProgramCache]: Analyzing trace with hash -120919426, now seen corresponding path program 1 times [2022-12-06 04:16:21,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:21,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759594964] [2022-12-06 04:16:21,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:21,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:21,152 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:16:21,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:21,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759594964] [2022-12-06 04:16:21,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759594964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:21,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:21,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:16:21,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479704818] [2022-12-06 04:16:21,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:21,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:16:21,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:21,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:16:21,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:16:21,154 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 04:16:21,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 675 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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:16:21,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:21,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 04:16:21,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:21,495 INFO L130 PetriNetUnfolder]: 1443/2404 cut-off events. [2022-12-06 04:16:21,496 INFO L131 PetriNetUnfolder]: For 11096/11524 co-relation queries the response was YES. [2022-12-06 04:16:21,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11370 conditions, 2404 events. 1443/2404 cut-off events. For 11096/11524 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 13779 event pairs, 148 based on Foata normal form. 334/2665 useless extension candidates. Maximal degree in co-relation 11336. Up to 827 conditions per place. [2022-12-06 04:16:21,507 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 60 selfloop transitions, 18 changer transitions 43/128 dead transitions. [2022-12-06 04:16:21,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 128 transitions, 1456 flow [2022-12-06 04:16:21,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:16:21,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:16:21,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-12-06 04:16:21,508 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49714285714285716 [2022-12-06 04:16:21,508 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 675 flow. Second operand 7 states and 87 transitions. [2022-12-06 04:16:21,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 128 transitions, 1456 flow [2022-12-06 04:16:21,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 128 transitions, 1336 flow, removed 12 selfloop flow, removed 8 redundant places. [2022-12-06 04:16:21,546 INFO L231 Difference]: Finished difference. Result has 68 places, 47 transitions, 409 flow [2022-12-06 04:16:21,546 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=409, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2022-12-06 04:16:21,547 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2022-12-06 04:16:21,547 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:21,547 INFO L89 Accepts]: Start accepts. Operand has 68 places, 47 transitions, 409 flow [2022-12-06 04:16:21,548 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:21,548 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:21,548 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 47 transitions, 409 flow [2022-12-06 04:16:21,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 47 transitions, 409 flow [2022-12-06 04:16:21,559 INFO L130 PetriNetUnfolder]: 49/129 cut-off events. [2022-12-06 04:16:21,559 INFO L131 PetriNetUnfolder]: For 321/362 co-relation queries the response was YES. [2022-12-06 04:16:21,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 129 events. 49/129 cut-off events. For 321/362 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 428 event pairs, 2 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 508. Up to 42 conditions per place. [2022-12-06 04:16:21,561 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 47 transitions, 409 flow [2022-12-06 04:16:21,561 INFO L188 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-06 04:16:21,563 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [439] L771-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork3_#res.base_21| 0) (= |v_P1Thread1of1ForFork3_#res.offset_21| 0) (= v_~__unbuffered_cnt~0_141 (+ v_~__unbuffered_cnt~0_142 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_142} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_21|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0] and [413] L861-3-->L864: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_65 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_12) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 04:16:21,579 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [447] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.offset_15| 0) (= |v_P0Thread1of1ForFork1_#res.base_15| 0) (= v_~__unbuffered_cnt~0_153 (+ v_~__unbuffered_cnt~0_154 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_154} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_15|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] and [413] L861-3-->L864: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_65 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_12) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 04:16:21,597 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [432] L837-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#res#1.base_15| 0) (= v_~__unbuffered_cnt~0_133 (+ v_~__unbuffered_cnt~0_134 1)) (= |v_P3Thread1of1ForFork2_#res#1.offset_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134} OutVars{P3Thread1of1ForFork2_#res#1.base=|v_P3Thread1of1ForFork2_#res#1.base_15|, P3Thread1of1ForFork2_#res#1.offset=|v_P3Thread1of1ForFork2_#res#1.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_133} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res#1.base, P3Thread1of1ForFork2_#res#1.offset, ~__unbuffered_cnt~0] and [413] L861-3-->L864: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_65 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_12) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 04:16:21,615 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [426] L799-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_103 (+ v_~__unbuffered_cnt~0_104 1)) (= |v_P2Thread1of1ForFork0_#res.offset_7| 0) (= |v_P2Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] and [413] L861-3-->L864: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_65 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_12) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 04:16:23,078 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:16:23,079 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1532 [2022-12-06 04:16:23,079 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 44 transitions, 423 flow [2022-12-06 04:16:23,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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:16:23,079 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:23,079 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:23,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:16:23,079 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:23,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:23,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1937006091, now seen corresponding path program 1 times [2022-12-06 04:16:23,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:23,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249629604] [2022-12-06 04:16:23,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:23,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:23,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:23,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:23,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249629604] [2022-12-06 04:16:23,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249629604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:23,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:23,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:16:23,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278124685] [2022-12-06 04:16:23,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:23,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:16:23,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:23,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:16:23,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:16:23,225 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 04:16:23,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 44 transitions, 423 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:16:23,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:23,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 04:16:23,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:23,337 INFO L130 PetriNetUnfolder]: 342/604 cut-off events. [2022-12-06 04:16:23,337 INFO L131 PetriNetUnfolder]: For 2849/2859 co-relation queries the response was YES. [2022-12-06 04:16:23,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2955 conditions, 604 events. 342/604 cut-off events. For 2849/2859 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2402 event pairs, 66 based on Foata normal form. 14/614 useless extension candidates. Maximal degree in co-relation 2923. Up to 364 conditions per place. [2022-12-06 04:16:23,339 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 32 selfloop transitions, 1 changer transitions 37/72 dead transitions. [2022-12-06 04:16:23,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 72 transitions, 747 flow [2022-12-06 04:16:23,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:16:23,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:16:23,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-06 04:16:23,341 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.53 [2022-12-06 04:16:23,341 INFO L175 Difference]: Start difference. First operand has 65 places, 44 transitions, 423 flow. Second operand 4 states and 53 transitions. [2022-12-06 04:16:23,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 72 transitions, 747 flow [2022-12-06 04:16:23,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 72 transitions, 560 flow, removed 22 selfloop flow, removed 16 redundant places. [2022-12-06 04:16:23,348 INFO L231 Difference]: Finished difference. Result has 54 places, 33 transitions, 202 flow [2022-12-06 04:16:23,348 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=54, PETRI_TRANSITIONS=33} [2022-12-06 04:16:23,349 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2022-12-06 04:16:23,349 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:23,350 INFO L89 Accepts]: Start accepts. Operand has 54 places, 33 transitions, 202 flow [2022-12-06 04:16:23,352 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:23,353 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:23,353 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 33 transitions, 202 flow [2022-12-06 04:16:23,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 33 transitions, 202 flow [2022-12-06 04:16:23,360 INFO L130 PetriNetUnfolder]: 22/67 cut-off events. [2022-12-06 04:16:23,360 INFO L131 PetriNetUnfolder]: For 59/60 co-relation queries the response was YES. [2022-12-06 04:16:23,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 67 events. 22/67 cut-off events. For 59/60 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 162 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 181. Up to 18 conditions per place. [2022-12-06 04:16:23,361 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 33 transitions, 202 flow [2022-12-06 04:16:23,361 INFO L188 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-06 04:16:23,723 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [350] L753-->L756: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [485] $Ultimate##0-->L768: Formula: (and (= v_~x~0_54 2) (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~x~0] [2022-12-06 04:16:23,829 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 04:16:23,830 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 481 [2022-12-06 04:16:23,830 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 172 flow [2022-12-06 04:16:23,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:16:23,830 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:23,830 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:23,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:16:23,831 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:23,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:23,831 INFO L85 PathProgramCache]: Analyzing trace with hash 523737834, now seen corresponding path program 1 times [2022-12-06 04:16:23,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:23,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852805895] [2022-12-06 04:16:23,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:23,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:24,142 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:16:24,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:24,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852805895] [2022-12-06 04:16:24,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852805895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:24,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:24,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:16:24,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566828768] [2022-12-06 04:16:24,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:24,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:16:24,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:24,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:16:24,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:16:24,145 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 04:16:24,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 28 transitions, 172 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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:16:24,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:24,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 04:16:24,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:24,245 INFO L130 PetriNetUnfolder]: 64/126 cut-off events. [2022-12-06 04:16:24,245 INFO L131 PetriNetUnfolder]: For 459/459 co-relation queries the response was YES. [2022-12-06 04:16:24,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 126 events. 64/126 cut-off events. For 459/459 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 369 event pairs, 8 based on Foata normal form. 4/130 useless extension candidates. Maximal degree in co-relation 468. Up to 57 conditions per place. [2022-12-06 04:16:24,246 INFO L137 encePairwiseOnDemand]: 11/20 looper letters, 28 selfloop transitions, 4 changer transitions 17/49 dead transitions. [2022-12-06 04:16:24,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 49 transitions, 377 flow [2022-12-06 04:16:24,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:16:24,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:16:24,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-12-06 04:16:24,247 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-06 04:16:24,247 INFO L175 Difference]: Start difference. First operand has 48 places, 28 transitions, 172 flow. Second operand 7 states and 35 transitions. [2022-12-06 04:16:24,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 49 transitions, 377 flow [2022-12-06 04:16:24,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 288 flow, removed 10 selfloop flow, removed 16 redundant places. [2022-12-06 04:16:24,248 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 132 flow [2022-12-06 04:16:24,248 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=132, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2022-12-06 04:16:24,249 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2022-12-06 04:16:24,249 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:24,249 INFO L89 Accepts]: Start accepts. Operand has 41 places, 28 transitions, 132 flow [2022-12-06 04:16:24,249 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:24,249 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:24,249 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 28 transitions, 132 flow [2022-12-06 04:16:24,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 28 transitions, 132 flow [2022-12-06 04:16:24,254 INFO L130 PetriNetUnfolder]: 17/44 cut-off events. [2022-12-06 04:16:24,254 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-06 04:16:24,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 44 events. 17/44 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 73 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 97. Up to 12 conditions per place. [2022-12-06 04:16:24,254 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 132 flow [2022-12-06 04:16:24,254 INFO L188 LiptonReduction]: Number of co-enabled transitions 26 [2022-12-06 04:16:24,333 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [512] $Ultimate##0-->L771: Formula: (and (= v_~b~0_49 1) (= |v_P1Thread1of1ForFork3_#in~arg.offset_21| v_P1Thread1of1ForFork3_~arg.offset_21) (= |v_P1Thread1of1ForFork3_#in~arg.base_21| v_P1Thread1of1ForFork3_~arg.base_21) (= v_~y~0_110 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_17) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_17|) (= 2 v_~x~0_116)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_21|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_21|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_21, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_21|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_21, ~b~0=v_~b~0_49, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_21|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~y~0=v_~y~0_110, ~x~0=v_~x~0_116, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~b~0, P0Thread1of1ForFork1_~arg.offset, ~y~0, ~x~0, P0Thread1of1ForFork1_~arg.base] and [509] $Ultimate##0-->L799: Formula: (let ((.cse4 (= (mod v_~z$r_buff1_thd3~0_130 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_140 256) 0))) (let ((.cse7 (not .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_353 256) 0)) (.cse10 (and .cse5 (= (mod v_~z$w_buff1_used~0_326 256) 0))) (.cse6 (and .cse5 .cse4))) (let ((.cse1 (= (mod v_~z$w_buff1_used~0_325 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_69 256) 0))) (.cse3 (= (mod v_~z$w_buff0_used~0_352 256) 0)) (.cse8 (or .cse11 .cse10 .cse6)) (.cse9 (and (not .cse11) .cse7))) (and (= (ite .cse0 v_~z$r_buff1_thd3~0_130 (ite (let ((.cse2 (= (mod v_~z$r_buff0_thd3~0_139 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse2 .cse4))) v_~z$r_buff1_thd3~0_130 0)) v_~z$r_buff1_thd3~0_129) (= v_~z~0_274 (ite .cse0 v_~z$mem_tmp~0_59 v_~__unbuffered_p2_EAX~0_103)) (= (ite .cse0 v_~z$r_buff0_thd3~0_140 (ite (or (and .cse1 .cse5) .cse3 .cse6) v_~z$r_buff0_thd3~0_140 (ite (and .cse7 (not .cse3)) 0 v_~z$r_buff0_thd3~0_140))) v_~z$r_buff0_thd3~0_139) (= v_~weak$$choice0~0_44 |v_P2Thread1of1ForFork0_#t~nondet3_48|) (= |v_P2Thread1of1ForFork0_#in~arg.base_17| v_P2Thread1of1ForFork0_~arg.base_17) (= v_~z$w_buff0_used~0_352 (ite .cse0 v_~z$w_buff0_used~0_353 (ite .cse8 v_~z$w_buff0_used~0_353 (ite .cse9 0 v_~z$w_buff0_used~0_353)))) (= v_~z$w_buff1_used~0_325 (ite .cse0 v_~z$w_buff1_used~0_326 (ite (or .cse3 .cse10 .cse6) v_~z$w_buff1_used~0_326 0))) (= v_~z$w_buff0~0_206 v_~z$w_buff0~0_205) (= v_~y~0_104 2) (= v_~weak$$choice2~0_69 |v_P2Thread1of1ForFork0_#t~nondet4_48|) (= v_~z$w_buff1~0_188 v_~z$w_buff1~0_187) (= v_~z$mem_tmp~0_59 v_~z~0_275) (= v_~z$flush_delayed~0_66 0) (= (ite .cse8 v_~z~0_275 (ite .cse9 v_~z$w_buff0~0_206 v_~z$w_buff1~0_188)) v_~__unbuffered_p2_EAX~0_103) (= |v_P2Thread1of1ForFork0_#in~arg.offset_17| v_P2Thread1of1ForFork0_~arg.offset_17))))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_353, ~z$w_buff0~0=v_~z$w_buff0~0_206, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_130, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_326, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_48|, ~z$w_buff1~0=v_~z$w_buff1~0_188, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_140, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_48|, ~z~0=v_~z~0_275, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_17|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_59, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_352, ~z$w_buff0~0=v_~z$w_buff0~0_205, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_129, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_325, ~z$w_buff1~0=v_~z$w_buff1~0_187, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, ~weak$$choice0~0=v_~weak$$choice0~0_44, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_139, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_103, ~z~0=v_~z~0_274, ~weak$$choice2~0=v_~weak$$choice2~0_69, ~y~0=v_~y~0_104, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_17|} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, P2Thread1of1ForFork0_~arg.base, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0, ~y~0] [2022-12-06 04:16:24,935 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [508] $Ultimate##0-->L830: Formula: (and (= v_~z$r_buff0_thd0~0_201 v_~z$r_buff1_thd0~0_194) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_36| 0)) (= v_~z$r_buff0_thd4~0_151 v_~z$r_buff1_thd4~0_112) (= v_~a~0_45 v_~__unbuffered_p3_EAX~0_94) (= v_~a~0_45 1) (= v_~z$r_buff0_thd2~0_52 v_~z$r_buff1_thd2~0_46) (= v_~b~0_45 v_~__unbuffered_p3_EBX~0_96) (= v_~z$w_buff0_used~0_348 1) (= v_~z$w_buff0~0_201 1) (= v_~z$w_buff0_used~0_349 v_~z$w_buff1_used~0_323) (= v_~z$r_buff0_thd4~0_150 1) (= v_~z$r_buff0_thd1~0_52 v_~z$r_buff1_thd1~0_46) (= |v_P3Thread1of1ForFork2_~arg#1.base_34| |v_P3Thread1of1ForFork2_#in~arg#1.base_34|) (= v_~z$r_buff0_thd3~0_137 v_~z$r_buff1_thd3~0_127) (= |v_P3Thread1of1ForFork2_~arg#1.offset_34| |v_P3Thread1of1ForFork2_#in~arg#1.offset_34|) (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_323 256) 0)) (not (= (mod v_~z$w_buff0_used~0_348 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_36|) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_36| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_36|) (= v_~z$w_buff0~0_202 v_~z$w_buff1~0_185)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_201, ~b~0=v_~b~0_45, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_349, ~z$w_buff0~0=v_~z$w_buff0~0_202, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_34|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_34|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_151, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_137, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_52, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_112, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_348, ~z$w_buff0~0=v_~z$w_buff0~0_201, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_127, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_34|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_46, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_323, ~z$w_buff1~0=v_~z$w_buff1~0_185, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_96, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_36|, ~a~0=v_~a~0_45, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_36|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_201, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_34|, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_34|, ~b~0=v_~b~0_45, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_194, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_46, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_34|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_94, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_150, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_137, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_52, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~__unbuffered_p3_EBX~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~a~0, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] and [513] $Ultimate##0-->L799: Formula: (let ((.cse6 (= (mod v_~z$r_buff1_thd3~0_142 256) 0)) (.cse8 (= (mod v_~z$r_buff0_thd3~0_152 256) 0))) (let ((.cse9 (not .cse8)) (.cse10 (and (= (mod v_~z$w_buff1_used~0_342 256) 0) .cse8)) (.cse7 (and .cse6 .cse8)) (.cse11 (= (mod v_~z$w_buff0_used~0_369 256) 0))) (let ((.cse4 (= (mod v_~z$w_buff1_used~0_341 256) 0)) (.cse0 (or .cse10 .cse7 .cse11)) (.cse1 (and .cse9 (not .cse11))) (.cse2 (not (= (mod v_~weak$$choice2~0_75 256) 0))) (.cse5 (= (mod v_~z$w_buff0_used~0_368 256) 0))) (and (= (ite .cse0 v_~z~0_291 (ite .cse1 v_~z$w_buff0~0_218 v_~z$w_buff1~0_200)) v_~__unbuffered_p2_EAX~0_109) (= (ite .cse2 v_~z$r_buff1_thd3~0_142 (ite (let ((.cse3 (= (mod v_~z$r_buff0_thd3~0_151 256) 0))) (or (and .cse3 .cse4) .cse5 (and .cse3 .cse6))) v_~z$r_buff1_thd3~0_142 0)) v_~z$r_buff1_thd3~0_141) (= v_~z$mem_tmp~0_65 v_~z~0_291) (= v_~b~0_51 1) (= v_~y~0_112 2) (= (ite .cse2 v_~z$mem_tmp~0_65 v_~__unbuffered_p2_EAX~0_109) v_~z~0_290) (= v_~z$w_buff1~0_200 v_~z$w_buff1~0_199) (= (ite .cse2 v_~z$r_buff0_thd3~0_152 (ite (or .cse7 .cse5 (and .cse4 .cse8)) v_~z$r_buff0_thd3~0_152 (ite (and .cse9 (not .cse5)) 0 v_~z$r_buff0_thd3~0_152))) v_~z$r_buff0_thd3~0_151) (= v_~weak$$choice0~0_50 |v_P2Thread1of1ForFork0_#t~nondet3_60|) (= |v_P1Thread1of1ForFork3_#in~arg.base_23| v_P1Thread1of1ForFork3_~arg.base_23) (= v_~weak$$choice2~0_75 |v_P2Thread1of1ForFork0_#t~nondet4_60|) (= (ite .cse2 v_~z$w_buff0_used~0_369 (ite .cse0 v_~z$w_buff0_used~0_369 (ite .cse1 0 v_~z$w_buff0_used~0_369))) v_~z$w_buff0_used~0_368) (= |v_P2Thread1of1ForFork0_#in~arg.base_23| v_P2Thread1of1ForFork0_~arg.base_23) (= (ite .cse2 v_~z$w_buff1_used~0_342 (ite (or .cse10 .cse7 .cse5) v_~z$w_buff1_used~0_342 0)) v_~z$w_buff1_used~0_341) (= v_~z$w_buff0~0_218 v_~z$w_buff0~0_217) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (= |v_P1Thread1of1ForFork3_#in~arg.offset_23| v_P1Thread1of1ForFork3_~arg.offset_23) (= v_~z$flush_delayed~0_72 0) (= 2 v_~x~0_118) (= |v_P2Thread1of1ForFork0_#in~arg.offset_23| v_P2Thread1of1ForFork0_~arg.offset_23) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|))))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_369, ~z$w_buff0~0=v_~z$w_buff0~0_218, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_142, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_342, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_60|, ~z$w_buff1~0=v_~z$w_buff1~0_200, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_60|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_23|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_152, ~z~0=v_~z~0_291, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_23|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|} OutVars{~z$w_buff1~0=v_~z$w_buff1~0_199, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_23|, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_23, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_109, ~y~0=v_~y~0_112, ~z$mem_tmp~0=v_~z$mem_tmp~0_65, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_368, ~z$w_buff0~0=v_~z$w_buff0~0_217, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_141, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_341, ~z$flush_delayed~0=v_~z$flush_delayed~0_72, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_23, ~weak$$choice0~0=v_~weak$$choice0~0_50, ~b~0=v_~b~0_51, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_151, ~z~0=v_~z~0_290, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_23|, ~weak$$choice2~0=v_~weak$$choice2~0_75, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|, ~x~0=v_~x~0_118} AuxVars[] AssignedVars[~z$mem_tmp~0, P1Thread1of1ForFork3_~arg.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, P0Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork3_~arg.offset, ~weak$$choice0~0, P2Thread1of1ForFork0_~arg.base, ~b~0, P0Thread1of1ForFork1_~arg.offset, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y~0, ~weak$$choice2~0, ~x~0] [2022-12-06 04:16:25,347 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [508] $Ultimate##0-->L830: Formula: (and (= v_~z$r_buff0_thd0~0_201 v_~z$r_buff1_thd0~0_194) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_36| 0)) (= v_~z$r_buff0_thd4~0_151 v_~z$r_buff1_thd4~0_112) (= v_~a~0_45 v_~__unbuffered_p3_EAX~0_94) (= v_~a~0_45 1) (= v_~z$r_buff0_thd2~0_52 v_~z$r_buff1_thd2~0_46) (= v_~b~0_45 v_~__unbuffered_p3_EBX~0_96) (= v_~z$w_buff0_used~0_348 1) (= v_~z$w_buff0~0_201 1) (= v_~z$w_buff0_used~0_349 v_~z$w_buff1_used~0_323) (= v_~z$r_buff0_thd4~0_150 1) (= v_~z$r_buff0_thd1~0_52 v_~z$r_buff1_thd1~0_46) (= |v_P3Thread1of1ForFork2_~arg#1.base_34| |v_P3Thread1of1ForFork2_#in~arg#1.base_34|) (= v_~z$r_buff0_thd3~0_137 v_~z$r_buff1_thd3~0_127) (= |v_P3Thread1of1ForFork2_~arg#1.offset_34| |v_P3Thread1of1ForFork2_#in~arg#1.offset_34|) (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_323 256) 0)) (not (= (mod v_~z$w_buff0_used~0_348 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_36|) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_36| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_36|) (= v_~z$w_buff0~0_202 v_~z$w_buff1~0_185)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_201, ~b~0=v_~b~0_45, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_349, ~z$w_buff0~0=v_~z$w_buff0~0_202, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_34|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_34|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_151, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_137, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_52, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_112, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_348, ~z$w_buff0~0=v_~z$w_buff0~0_201, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_127, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_34|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_46, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_323, ~z$w_buff1~0=v_~z$w_buff1~0_185, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_96, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_36|, ~a~0=v_~a~0_45, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_36|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_201, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_34|, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_34|, ~b~0=v_~b~0_45, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_194, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_46, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_34|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_94, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_150, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_137, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_52, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~__unbuffered_p3_EBX~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~a~0, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] and [514] $Ultimate##0-->P2EXIT: Formula: (let ((.cse9 (= (mod v_~z$r_buff1_thd3~0_146 256) 0)) (.cse5 (= 0 (mod v_~z$r_buff0_thd3~0_156 256)))) (let ((.cse6 (not .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_373 256) 0)) (.cse1 (and .cse5 (= (mod v_~z$w_buff1_used~0_346 256) 0))) (.cse3 (and .cse9 .cse5))) (let ((.cse4 (= (mod v_~z$w_buff1_used~0_345 256) 0)) (.cse2 (= (mod v_~z$w_buff0_used~0_372 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_77 256) 0))) (.cse7 (or .cse11 .cse1 .cse3)) (.cse8 (and (not .cse11) .cse6))) (and (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_~z~0_294 (ite .cse0 v_~z$mem_tmp~0_67 v_~__unbuffered_p2_EAX~0_111)) (= v_~y~0_116 2) (= |v_P2Thread1of1ForFork0_#in~arg.base_25| v_P2Thread1of1ForFork0_~arg.base_25) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= v_~weak$$choice0~0_52 |v_P2Thread1of1ForFork0_#t~nondet3_64|) (= v_~z$w_buff1_used~0_345 (ite .cse0 v_~z$w_buff1_used~0_346 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_346 0))) (= (ite .cse0 v_~z$r_buff0_thd3~0_156 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_156 (ite (and .cse6 (not .cse2)) 0 v_~z$r_buff0_thd3~0_156))) v_~z$r_buff0_thd3~0_155) (= |v_P2Thread1of1ForFork0_#in~arg.offset_25| v_P2Thread1of1ForFork0_~arg.offset_25) (= v_~weak$$choice2~0_77 |v_P2Thread1of1ForFork0_#t~nondet4_64|) (= |v_P1Thread1of1ForFork3_#in~arg.base_25| v_P1Thread1of1ForFork3_~arg.base_25) (= v_~z$w_buff1~0_203 v_~z$w_buff1~0_204) (= (ite .cse7 v_~z~0_295 (ite .cse8 v_~z$w_buff0~0_222 v_~z$w_buff1~0_204)) v_~__unbuffered_p2_EAX~0_111) (= v_~z$w_buff0~0_222 v_~z$w_buff0~0_221) (= (ite .cse0 v_~z$r_buff1_thd3~0_146 (ite (let ((.cse10 (= (mod v_~z$r_buff0_thd3~0_155 256) 0))) (or (and .cse9 .cse10) (and .cse4 .cse10) .cse2)) v_~z$r_buff1_thd3~0_146 0)) v_~z$r_buff1_thd3~0_145) (= 2 v_~x~0_120) (= |v_P2Thread1of1ForFork0_#res.offset_35| 0) (= v_~__unbuffered_cnt~0_333 (+ v_~__unbuffered_cnt~0_334 1)) (= v_~z$mem_tmp~0_67 v_~z~0_295) (= v_~z$w_buff0_used~0_372 (ite .cse0 v_~z$w_buff0_used~0_373 (ite .cse7 v_~z$w_buff0_used~0_373 (ite .cse8 0 v_~z$w_buff0_used~0_373)))) (= |v_P2Thread1of1ForFork0_#res.base_35| 0) (= v_~z$flush_delayed~0_74 0) (= |v_P1Thread1of1ForFork3_#in~arg.offset_25| v_P1Thread1of1ForFork3_~arg.offset_25) (= v_~b~0_53 1))))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_25|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_373, ~z$w_buff0~0=v_~z$w_buff0~0_222, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_146, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_346, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_64|, ~z$w_buff1~0=v_~z$w_buff1~0_204, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_64|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_25|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_156, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_334, ~z~0=v_~z~0_295, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_25|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_25|} OutVars{~z$w_buff1~0=v_~z$w_buff1~0_203, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_25|, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_25, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_111, ~y~0=v_~y~0_116, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_35|, ~z$mem_tmp~0=v_~z$mem_tmp~0_67, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_25|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_25, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_35|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_372, ~z$w_buff0~0=v_~z$w_buff0~0_221, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_145, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_25, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_345, ~z$flush_delayed~0=v_~z$flush_delayed~0_74, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_25, ~weak$$choice0~0=v_~weak$$choice0~0_52, ~b~0=v_~b~0_53, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_155, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_333, ~z~0=v_~z~0_294, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_25|, ~weak$$choice2~0=v_~weak$$choice2~0_77, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_25|, ~x~0=v_~x~0_120} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, P0Thread1of1ForFork1_~arg.base, P2Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_p2_EAX~0, ~y~0, P2Thread1of1ForFork0_#res.offset, ~z$mem_tmp~0, P1Thread1of1ForFork3_~arg.base, P2Thread1of1ForFork0_#res.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$flush_delayed~0, P1Thread1of1ForFork3_~arg.offset, ~weak$$choice0~0, ~b~0, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~x~0] [2022-12-06 04:16:25,791 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L799: Formula: (let ((.cse3 (= (mod v_~z$r_buff0_thd3~0_160 256) 0)) (.cse8 (= (mod v_~z$w_buff0_used~0_378 256) 0))) (let ((.cse5 (and .cse3 .cse8))) (let ((.cse1 (or .cse3 .cse5)) (.cse0 (not (= (mod v_~weak$$choice2~0_79 256) 0))) (.cse7 (= (mod v_~z$w_buff1_used~0_349 256) 0)) (.cse4 (= (mod v_~z$w_buff0_used~0_376 256) 0)) (.cse2 (not .cse3))) (and (= v_~z$mem_tmp~0_69 v_~z~0_299) (= v_~y~0_118 2) (= v_~z$r_buff0_thd2~0_54 v_~z$r_buff1_thd2~0_48) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_38| 0)) (= (ite .cse0 1 (ite .cse1 1 (ite .cse2 0 1))) v_~z$w_buff0_used~0_376) (= v_~z$w_buff1_used~0_349 (ite .cse0 v_~z$w_buff0_used~0_378 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff0_used~0_378 0))) (= v_~z$flush_delayed~0_76 0) (= v_P0Thread1of1ForFork1_~arg.offset_23 |v_P0Thread1of1ForFork1_#in~arg.offset_23|) (= (ite .cse1 v_~z~0_299 (ite .cse2 v_~z$w_buff0~0_225 v_~z$w_buff0~0_227)) v_~__unbuffered_p2_EAX~0_113) (= |v_P3Thread1of1ForFork2_~arg#1.offset_36| |v_P3Thread1of1ForFork2_#in~arg#1.offset_36|) (= v_~z$w_buff0~0_227 v_~z$w_buff1~0_207) (= v_~z$r_buff1_thd3~0_149 (ite .cse0 v_~z$r_buff0_thd3~0_160 (ite (let ((.cse6 (= (mod v_~z$r_buff0_thd3~0_159 256) 0))) (or (and .cse6 .cse7) (and .cse3 .cse6) .cse4)) v_~z$r_buff0_thd3~0_160 0))) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_38| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_38|) (= v_~z$r_buff0_thd4~0_162 1) (= |v_P1Thread1of1ForFork3_#in~arg.base_27| v_P1Thread1of1ForFork3_~arg.base_27) (= v_~z$r_buff0_thd1~0_54 v_~z$r_buff1_thd1~0_48) (= v_~a~0_47 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_23| v_P0Thread1of1ForFork1_~arg.base_23) (= v_~z$r_buff0_thd0~0_203 v_~z$r_buff1_thd0~0_196) (= |v_P1Thread1of1ForFork3_#in~arg.offset_27| v_P1Thread1of1ForFork3_~arg.offset_27) (= v_~b~0_55 1) (= v_~z$r_buff0_thd4~0_163 v_~z$r_buff1_thd4~0_122) (= v_~z$w_buff0~0_225 1) (= v_~weak$$choice0~0_54 |v_P2Thread1of1ForFork0_#t~nondet3_68|) (= 2 v_~x~0_122) (= v_~z~0_298 (ite .cse0 v_~z$mem_tmp~0_69 v_~__unbuffered_p2_EAX~0_113)) (= |v_P2Thread1of1ForFork0_#in~arg.base_27| v_P2Thread1of1ForFork0_~arg.base_27) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_38| (ite .cse8 1 0)) (= v_~weak$$choice2~0_79 |v_P2Thread1of1ForFork0_#t~nondet4_68|) (= v_~b~0_56 v_~__unbuffered_p3_EBX~0_98) (= (ite .cse0 v_~z$r_buff0_thd3~0_160 (ite (or (and .cse3 .cse7) .cse3 .cse4) v_~z$r_buff0_thd3~0_160 (ite (and (not .cse4) .cse2) 0 v_~z$r_buff0_thd3~0_160))) v_~z$r_buff0_thd3~0_159) (= |v_P2Thread1of1ForFork0_#in~arg.offset_27| v_P2Thread1of1ForFork0_~arg.offset_27) (= v_~a~0_47 v_~__unbuffered_p3_EAX~0_96) (= |v_P3Thread1of1ForFork2_~arg#1.base_36| |v_P3Thread1of1ForFork2_#in~arg#1.base_36|))))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_27|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_378, ~z$w_buff0~0=v_~z$w_buff0~0_227, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_36|, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_68|, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_68|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_27|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_203, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, ~b~0=v_~b~0_56, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_36|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_163, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_160, ~z~0=v_~z~0_299, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_27|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_54, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_27|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_54} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_122, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_36|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_48, ~z$w_buff1~0=v_~z$w_buff1~0_207, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_38|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_23, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_27|, ~a~0=v_~a~0_47, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_38|, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_27, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_203, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_36|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_196, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_96, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_162, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_113, ~y~0=v_~y~0_118, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_54, ~z$mem_tmp~0=v_~z$mem_tmp~0_69, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_27|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_27, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_376, ~z$w_buff0~0=v_~z$w_buff0~0_225, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_149, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_349, ~z$flush_delayed~0=v_~z$flush_delayed~0_76, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_98, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_27, ~weak$$choice0~0=v_~weak$$choice0~0_54, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_36|, ~b~0=v_~b~0_55, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_48, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_36|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_159, ~z~0=v_~z~0_298, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_27|, ~weak$$choice2~0=v_~weak$$choice2~0_79, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_54, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_27|, ~x~0=v_~x~0_122} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$r_buff1_thd2~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork1_~arg.base, ~a~0, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg.base, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_p2_EAX~0, ~y~0, ~z$mem_tmp~0, P1Thread1of1ForFork3_~arg.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~__unbuffered_p3_EBX~0, P1Thread1of1ForFork3_~arg.offset, ~weak$$choice0~0, P3Thread1of1ForFork2_~arg#1.offset, ~b~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0, ~x~0] and [372] L830-->L837: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_85 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_86 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_85 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_85) v_~z$w_buff1_used~0_84) (= (ite .cse2 0 v_~z$w_buff0_used~0_86) v_~z$w_buff0_used~0_85) (= v_~z$r_buff0_thd4~0_32 (ite .cse1 0 v_~z$r_buff0_thd4~0_33)) (= v_~z$r_buff1_thd4~0_21 (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)) .cse4)) 0 v_~z$r_buff1_thd4~0_22)) (= v_~z~0_50 (ite .cse2 v_~z$w_buff0~0_37 (ite .cse0 v_~z$w_buff1~0_42 v_~z~0_51)))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_22, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_86, ~z$w_buff0~0=v_~z$w_buff0~0_37, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_85, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_51} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_85, ~z$w_buff0~0=v_~z$w_buff0~0_37, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_84, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] [2022-12-06 04:16:26,311 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] $Ultimate##0-->P2EXIT: Formula: (let ((.cse6 (= (mod v_~z$w_buff0_used~0_384 256) 0)) (.cse4 (= (mod v_~z$r_buff0_thd3~0_164 256) 0))) (let ((.cse7 (and .cse6 .cse4))) (let ((.cse5 (= (mod v_~z$w_buff0_used~0_382 256) 0)) (.cse3 (= (mod v_~z$w_buff1_used~0_353 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_81 256) 0))) (.cse0 (or .cse7 .cse4)) (.cse1 (not .cse4))) (and (= v_~a~0_49 1) (= |v_P3Thread1of1ForFork2_~arg#1.offset_38| |v_P3Thread1of1ForFork2_#in~arg#1.offset_38|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_29| v_P2Thread1of1ForFork0_~arg.offset_29) (= v_~z$r_buff0_thd1~0_56 v_~z$r_buff1_thd1~0_50) (= |v_P2Thread1of1ForFork0_#res.base_37| 0) (= v_~z$w_buff0~0_233 v_~z$w_buff1~0_211) (= v_~z$flush_delayed~0_78 0) (= v_~b~0_59 1) (= |v_P1Thread1of1ForFork3_#in~arg.base_29| v_P1Thread1of1ForFork3_~arg.base_29) (= (ite .cse0 v_~z~0_303 (ite .cse1 v_~z$w_buff0~0_231 v_~z$w_buff1~0_211)) v_~__unbuffered_p2_EAX~0_115) (= v_~z$r_buff0_thd4~0_166 1) (= v_~z$r_buff0_thd3~0_163 (ite .cse2 v_~z$r_buff0_thd3~0_164 (ite (or (and .cse3 .cse4) .cse4 .cse5) v_~z$r_buff0_thd3~0_164 (ite (and (not .cse5) .cse1) 0 v_~z$r_buff0_thd3~0_164)))) (= (ite .cse6 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_40|) (= v_~weak$$choice2~0_81 |v_P2Thread1of1ForFork0_#t~nondet4_72|) (= v_~weak$$choice0~0_56 |v_P2Thread1of1ForFork0_#t~nondet3_72|) (= v_~z$w_buff0~0_231 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_25| v_P0Thread1of1ForFork1_~arg.base_25) (= v_~z$r_buff0_thd0~0_205 v_~z$r_buff1_thd0~0_198) (= |v_P2Thread1of1ForFork0_#in~arg.base_29| v_P2Thread1of1ForFork0_~arg.base_29) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_40| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_40|) (= v_~z$w_buff1_used~0_353 (ite .cse2 v_~z$w_buff0_used~0_384 (ite (or .cse7 .cse4 .cse5) v_~z$w_buff0_used~0_384 0))) (= v_~__unbuffered_cnt~0_337 (+ v_~__unbuffered_cnt~0_338 1)) (= v_~a~0_49 v_~__unbuffered_p3_EAX~0_98) (= v_~b~0_60 v_~__unbuffered_p3_EBX~0_100) (= v_P0Thread1of1ForFork1_~arg.offset_25 |v_P0Thread1of1ForFork1_#in~arg.offset_25|) (= v_~z$r_buff0_thd4~0_167 v_~z$r_buff1_thd4~0_124) (= |v_P2Thread1of1ForFork0_#res.offset_37| 0) (= |v_P1Thread1of1ForFork3_#in~arg.offset_29| v_P1Thread1of1ForFork3_~arg.offset_29) (= v_~y~0_120 2) (= v_~z$r_buff0_thd2~0_56 v_~z$r_buff1_thd2~0_50) (= v_~z~0_302 (ite .cse2 v_~z$mem_tmp~0_71 v_~__unbuffered_p2_EAX~0_115)) (= |v_P3Thread1of1ForFork2_~arg#1.base_38| |v_P3Thread1of1ForFork2_#in~arg#1.base_38|) (= v_~z$r_buff1_thd3~0_153 (ite .cse2 v_~z$r_buff0_thd3~0_164 (ite (let ((.cse8 (= (mod v_~z$r_buff0_thd3~0_163 256) 0))) (or (and .cse8 .cse4) .cse5 (and .cse8 .cse3))) v_~z$r_buff0_thd3~0_164 0))) (= 2 v_~x~0_124) (= v_~z$w_buff0_used~0_382 (ite .cse2 1 (ite .cse0 1 (ite .cse1 0 1)))) (= v_~z$mem_tmp~0_71 v_~z~0_303) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_40| 0)))))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_29|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_384, ~z$w_buff0~0=v_~z$w_buff0~0_233, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_38|, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_72|, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_72|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_29|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_205, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, ~b~0=v_~b~0_60, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_38|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_167, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_164, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_338, ~z~0=v_~z~0_303, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_29|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_56, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_29|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_56} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_50, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_25, ~a~0=v_~a~0_49, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_205, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_38|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_98, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_115, ~z$mem_tmp~0=v_~z$mem_tmp~0_71, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_29|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_353, ~z$flush_delayed~0=v_~z$flush_delayed~0_78, ~weak$$choice0~0=v_~weak$$choice0~0_56, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_38|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_50, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_163, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_337, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_29|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_29|, ~x~0=v_~x~0_124, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_124, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_38|, ~z$w_buff1~0=v_~z$w_buff1~0_211, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_40|, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_29|, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_40|, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_29, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_198, ~y~0=v_~y~0_120, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_56, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_37|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_29, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_37|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_382, ~z$w_buff0~0=v_~z$w_buff0~0_231, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_153, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_29, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_100, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_29, ~b~0=v_~b~0_59, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_38|, ~z~0=v_~z~0_302, ~weak$$choice2~0=v_~weak$$choice2~0_81, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_56} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$r_buff1_thd2~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork1_~arg.base, ~a~0, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg.base, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_p2_EAX~0, ~y~0, P2Thread1of1ForFork0_#res.offset, ~z$mem_tmp~0, P1Thread1of1ForFork3_~arg.base, P2Thread1of1ForFork0_#res.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~__unbuffered_p3_EBX~0, P1Thread1of1ForFork3_~arg.offset, ~weak$$choice0~0, P3Thread1of1ForFork2_~arg#1.offset, ~b~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~x~0] and [372] L830-->L837: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_85 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_86 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_85 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_85) v_~z$w_buff1_used~0_84) (= (ite .cse2 0 v_~z$w_buff0_used~0_86) v_~z$w_buff0_used~0_85) (= v_~z$r_buff0_thd4~0_32 (ite .cse1 0 v_~z$r_buff0_thd4~0_33)) (= v_~z$r_buff1_thd4~0_21 (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)) .cse4)) 0 v_~z$r_buff1_thd4~0_22)) (= v_~z~0_50 (ite .cse2 v_~z$w_buff0~0_37 (ite .cse0 v_~z$w_buff1~0_42 v_~z~0_51)))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_22, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_86, ~z$w_buff0~0=v_~z$w_buff0~0_37, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_85, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_51} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_85, ~z$w_buff0~0=v_~z$w_buff0~0_37, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_84, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] [2022-12-06 04:16:26,854 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 04:16:26,855 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2606 [2022-12-06 04:16:26,855 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 131 flow [2022-12-06 04:16:26,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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:16:26,855 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:26,855 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:26,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:16:26,856 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:16:26,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:26,856 INFO L85 PathProgramCache]: Analyzing trace with hash -924391468, now seen corresponding path program 1 times [2022-12-06 04:16:26,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:26,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396165632] [2022-12-06 04:16:26,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:26,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:16:26,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:16:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:16:26,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:16:26,916 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:16:26,917 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 04:16:26,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 04:16:26,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 04:16:26,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 04:16:26,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 04:16:26,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 04:16:26,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 04:16:26,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 04:16:26,919 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:26,923 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:16:26,923 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:16:26,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:16:26 BasicIcfg [2022-12-06 04:16:26,961 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:16:26,961 INFO L158 Benchmark]: Toolchain (without parser) took 21205.52ms. Allocated memory was 235.9MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 212.1MB in the beginning and 824.7MB in the end (delta: -612.6MB). Peak memory consumption was 706.9MB. Max. memory is 8.0GB. [2022-12-06 04:16:26,961 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 235.9MB. Free memory is still 213.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:16:26,961 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.25ms. Allocated memory is still 235.9MB. Free memory was 212.1MB in the beginning and 184.4MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 04:16:26,962 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.20ms. Allocated memory is still 235.9MB. Free memory was 184.4MB in the beginning and 182.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:16:26,962 INFO L158 Benchmark]: Boogie Preprocessor took 39.73ms. Allocated memory is still 235.9MB. Free memory was 182.1MB in the beginning and 180.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:16:26,963 INFO L158 Benchmark]: RCFGBuilder took 552.54ms. Allocated memory is still 235.9MB. Free memory was 180.2MB in the beginning and 148.8MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-06 04:16:26,963 INFO L158 Benchmark]: TraceAbstraction took 20027.76ms. Allocated memory was 235.9MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 148.1MB in the beginning and 824.7MB in the end (delta: -676.6MB). Peak memory consumption was 642.9MB. Max. memory is 8.0GB. [2022-12-06 04:16:26,964 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 235.9MB. Free memory is still 213.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 524.25ms. Allocated memory is still 235.9MB. Free memory was 212.1MB in the beginning and 184.4MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.20ms. Allocated memory is still 235.9MB. Free memory was 184.4MB in the beginning and 182.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.73ms. Allocated memory is still 235.9MB. Free memory was 182.1MB in the beginning and 180.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 552.54ms. Allocated memory is still 235.9MB. Free memory was 180.2MB in the beginning and 148.8MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 20027.76ms. Allocated memory was 235.9MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 148.1MB in the beginning and 824.7MB in the end (delta: -676.6MB). Peak memory consumption was 642.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 136 PlacesBefore, 42 PlacesAfterwards, 125 TransitionsBefore, 30 TransitionsAfterwards, 2816 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 53 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2084, independent: 2023, independent conditional: 2023, independent unconditional: 0, dependent: 61, dependent conditional: 61, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2084, independent: 2023, independent conditional: 0, independent unconditional: 2023, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2084, independent: 2023, independent conditional: 0, independent unconditional: 2023, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2084, independent: 2023, independent conditional: 0, independent unconditional: 2023, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1751, independent: 1706, independent conditional: 0, independent unconditional: 1706, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1751, independent: 1688, independent conditional: 0, independent unconditional: 1688, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 63, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 167, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 145, dependent conditional: 0, dependent unconditional: 145, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2084, independent: 317, independent conditional: 0, independent unconditional: 317, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 1751, unknown conditional: 0, unknown unconditional: 1751] , Statistics on independence cache: Total cache size (in pairs): 2692, Positive cache size: 2647, Positive conditional cache size: 0, Positive unconditional cache size: 2647, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, 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, 36 PlacesBefore, 35 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 291, independent: 246, independent conditional: 246, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 291, independent: 246, independent conditional: 6, independent unconditional: 240, dependent: 45, dependent conditional: 3, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 291, independent: 246, independent conditional: 6, independent unconditional: 240, dependent: 45, dependent conditional: 3, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 291, independent: 246, independent conditional: 6, independent unconditional: 240, dependent: 45, dependent conditional: 3, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 145, independent: 126, independent conditional: 6, independent unconditional: 120, dependent: 19, dependent conditional: 3, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 145, independent: 120, independent conditional: 0, independent unconditional: 120, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 25, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 19, dependent conditional: 3, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 73, dependent conditional: 18, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 291, independent: 120, independent conditional: 0, independent unconditional: 120, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 145, unknown conditional: 9, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 126, Positive conditional cache size: 6, Positive unconditional cache size: 120, Negative cache size: 19, Negative conditional cache size: 3, Negative unconditional cache size: 16, 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, 37 PlacesBefore, 37 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 344 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 145, independent: 135, independent conditional: 135, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 145, independent: 135, independent conditional: 29, independent unconditional: 106, dependent: 10, dependent conditional: 5, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 145, independent: 135, independent conditional: 0, independent unconditional: 135, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 145, independent: 135, independent conditional: 0, independent unconditional: 135, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 145, independent: 118, independent conditional: 0, independent unconditional: 118, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 163, Positive cache size: 143, Positive conditional cache size: 6, Positive unconditional cache size: 137, Negative cache size: 20, Negative conditional cache size: 3, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 390 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 216, independent: 203, independent conditional: 203, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 216, independent: 203, independent conditional: 33, independent unconditional: 170, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 216, independent: 203, independent conditional: 0, independent unconditional: 203, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 216, independent: 203, independent conditional: 0, independent unconditional: 203, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 216, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 150, Positive conditional cache size: 6, Positive unconditional cache size: 144, Negative cache size: 20, Negative conditional cache size: 3, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 448 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 322, independent: 301, independent conditional: 301, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 322, independent: 301, independent conditional: 32, independent unconditional: 269, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 322, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 322, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 322, independent: 296, independent conditional: 0, independent unconditional: 296, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 155, Positive conditional cache size: 6, Positive unconditional cache size: 149, Negative cache size: 21, Negative conditional cache size: 3, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 578 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 521, independent: 493, independent conditional: 493, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 521, independent: 493, independent conditional: 163, independent unconditional: 330, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 521, independent: 493, independent conditional: 0, independent unconditional: 493, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 521, independent: 493, independent conditional: 0, independent unconditional: 493, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 521, independent: 491, independent conditional: 0, independent unconditional: 491, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 157, Positive conditional cache size: 6, Positive unconditional cache size: 151, Negative cache size: 21, Negative conditional cache size: 3, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 163, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 562 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 413, independent: 386, independent conditional: 386, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 413, independent: 386, independent conditional: 128, independent unconditional: 258, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 413, independent: 386, independent conditional: 0, independent unconditional: 386, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 413, independent: 386, independent conditional: 0, independent unconditional: 386, dependent: 27, dependent conditional: 0, dependent unconditional: 27, 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: 413, independent: 386, independent conditional: 0, independent unconditional: 386, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 157, Positive conditional cache size: 6, Positive unconditional cache size: 151, Negative cache size: 21, Negative conditional cache size: 3, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 128, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 55 PlacesBefore, 55 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 766 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 511, independent: 483, independent conditional: 483, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 511, independent: 483, independent conditional: 237, independent unconditional: 246, dependent: 28, dependent conditional: 4, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 511, independent: 483, independent conditional: 48, independent unconditional: 435, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 511, independent: 483, independent conditional: 48, independent unconditional: 435, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 511, independent: 480, independent conditional: 48, independent unconditional: 432, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 168, Positive conditional cache size: 6, Positive unconditional cache size: 162, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 193, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 694 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 161, independent: 150, independent conditional: 150, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 161, independent: 150, independent conditional: 93, independent unconditional: 57, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 161, independent: 150, independent conditional: 18, independent unconditional: 132, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 161, independent: 150, independent conditional: 18, independent unconditional: 132, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 161, independent: 145, independent conditional: 18, independent unconditional: 127, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 196, Positive cache size: 173, Positive conditional cache size: 6, Positive unconditional cache size: 167, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 77, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 65 PlacesBefore, 65 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 854 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 354, independent: 330, independent conditional: 330, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 354, independent: 330, independent conditional: 218, independent unconditional: 112, dependent: 24, dependent conditional: 8, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 358, independent: 330, independent conditional: 44, independent unconditional: 286, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 358, independent: 330, independent conditional: 44, independent unconditional: 286, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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: 358, independent: 330, independent conditional: 44, independent unconditional: 286, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 185, Positive conditional cache size: 6, Positive unconditional cache size: 179, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 186, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 68 PlacesBefore, 68 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 746 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 370, independent: 344, independent conditional: 344, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 370, independent: 344, independent conditional: 224, independent unconditional: 120, dependent: 26, dependent conditional: 4, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 374, independent: 344, independent conditional: 36, independent unconditional: 308, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 374, independent: 344, independent conditional: 36, independent unconditional: 308, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 374, independent: 344, independent conditional: 36, independent unconditional: 308, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 197, Positive conditional cache size: 6, Positive unconditional cache size: 191, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 196, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 68 PlacesBefore, 65 PlacesAfterwards, 47 TransitionsBefore, 44 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 180, independent: 160, independent conditional: 160, 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: 180, independent: 160, independent conditional: 128, independent unconditional: 32, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 180, independent: 160, independent conditional: 100, independent unconditional: 60, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 180, independent: 160, independent conditional: 100, independent unconditional: 60, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 180, independent: 157, independent conditional: 97, independent unconditional: 60, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 293, Positive cache size: 267, Positive conditional cache size: 11, Positive unconditional cache size: 256, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 53 PlacesBefore, 48 PlacesAfterwards, 33 TransitionsBefore, 28 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, independent: 29, independent conditional: 29, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 53, independent: 29, independent conditional: 21, independent unconditional: 8, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 125, independent: 29, independent conditional: 5, independent unconditional: 24, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125, independent: 29, independent conditional: 5, independent unconditional: 24, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 2, independent unconditional: 3, 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: 7, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 35, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 125, independent: 24, independent conditional: 3, independent unconditional: 21, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 7, unknown conditional: 2, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 381, Positive cache size: 353, Positive conditional cache size: 13, Positive unconditional cache size: 340, Negative cache size: 28, Negative conditional cache size: 3, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 112, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 39 PlacesBefore, 35 PlacesAfterwards, 28 TransitionsBefore, 25 TransitionsAfterwards, 26 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, 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: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 396, Positive cache size: 368, Positive conditional cache size: 17, Positive unconditional cache size: 351, Negative cache size: 28, Negative conditional cache size: 3, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L854] 0 pthread_t t1061; [L855] FCALL, FORK 0 pthread_create(&t1061, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1061, ((void *)0), P0, ((void *)0))=-3, t1061={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 pthread_t t1062; [L857] FCALL, FORK 0 pthread_create(&t1062, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1062, ((void *)0), P1, ((void *)0))=-2, t1061={5:0}, t1062={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 pthread_t t1063; [L859] FCALL, FORK 0 pthread_create(&t1063, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1063, ((void *)0), P2, ((void *)0))=-1, t1061={5:0}, t1062={6:0}, t1063={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 pthread_t t1064; [L861] FCALL, FORK 0 pthread_create(&t1064, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1064, ((void *)0), P3, ((void *)0))=0, t1061={5:0}, t1062={6:0}, t1063={7:0}, t1064={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 [L823] 4 a = 1 [L826] 4 __unbuffered_p3_EAX = a [L829] 4 __unbuffered_p3_EBX = b [L752] 4 b = 1 [L755] 4 x = 1 [L767] 4 x = 2 [L770] 4 y = 1 [L782] 4 y = 2 [L785] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 4 z$flush_delayed = weak$$choice2 [L788] 4 z$mem_tmp = z [L789] 4 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 4 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] 4 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 4 __unbuffered_p2_EAX = z [L797] 4 z = z$flush_delayed ? z$mem_tmp : z [L798] 4 z$flush_delayed = (_Bool)0 [L832] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L833] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L834] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L835] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L836] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L863] 3 main$tmp_guard0 = __unbuffered_cnt == 4 [L865] CALL 3 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 3 !(!cond) [L865] RET 3 assume_abort_if_not(main$tmp_guard0) [L867] 3 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L868] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L869] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L870] 3 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L871] 3 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L874] 3 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] CALL 3 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 3 !expression [L18] 3 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 857]: 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: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 164 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 528 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 528 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 830 IncrementalHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 20 mSDtfsCounter, 830 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=675occurred in iteration=10, InterpolantAutomatonStates: 57, 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.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 181 ConstructedInterpolants, 0 QuantifiedInterpolants, 897 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:16:26,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...