/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/mix053_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:19:33,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:19:33,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:19:33,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:19:33,256 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:19:33,259 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:19:33,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:19:33,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:19:33,275 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:19:33,278 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:19:33,279 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:19:33,281 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:19:33,281 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:19:33,283 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:19:33,287 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:19:33,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:19:33,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:19:33,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:19:33,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:19:33,293 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:19:33,294 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:19:33,295 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:19:33,296 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:19:33,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:19:33,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:19:33,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:19:33,300 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:19:33,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:19:33,301 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:19:33,301 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:19:33,302 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:19:33,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:19:33,303 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:19:33,304 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:19:33,304 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:19:33,305 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:19:33,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:19:33,305 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:19:33,306 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:19:33,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:19:33,311 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:19:33,313 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:19:33,344 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:19:33,345 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:19:33,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:19:33,346 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:19:33,346 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:19:33,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:19:33,347 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:19:33,347 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:19:33,347 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:19:33,347 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:19:33,348 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:19:33,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:19:33,348 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:19:33,348 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:19:33,348 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:19:33,348 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:19:33,348 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:19:33,349 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:19:33,349 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:19:33,349 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:19:33,349 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:19:33,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:19:33,349 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:19:33,349 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:19:33,349 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:19:33,349 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:19:33,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:19:33,350 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:19:33,350 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:19:33,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:19:33,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:19:33,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:19:33,636 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:19:33,637 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:19:33,638 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 04:19:34,605 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:19:34,840 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:19:34,840 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 04:19:34,851 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb2efb1fa/d254c2bb51e847968881b9b717790a4e/FLAG2ee9d524c [2022-12-06 04:19:34,864 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb2efb1fa/d254c2bb51e847968881b9b717790a4e [2022-12-06 04:19:34,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:19:34,867 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:19:34,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:19:34,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:19:34,870 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:19:34,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:19:34" (1/1) ... [2022-12-06 04:19:34,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a5de83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:34, skipping insertion in model container [2022-12-06 04:19:34,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:19:34" (1/1) ... [2022-12-06 04:19:34,876 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:19:34,917 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:19:35,057 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/mix053_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 04:19:35,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:19:35,331 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:19:35,343 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/mix053_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 04:19:35,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:19:35,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:19:35,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:19:35,481 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:19:35,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:35 WrapperNode [2022-12-06 04:19:35,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:19:35,483 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:19:35,483 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:19:35,483 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:19:35,490 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:19:35" (1/1) ... [2022-12-06 04:19:35,531 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:19:35" (1/1) ... [2022-12-06 04:19:35,564 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-06 04:19:35,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:19:35,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:19:35,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:19:35,566 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:19:35,572 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:35" (1/1) ... [2022-12-06 04:19:35,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:35" (1/1) ... [2022-12-06 04:19:35,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:35" (1/1) ... [2022-12-06 04:19:35,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:35" (1/1) ... [2022-12-06 04:19:35,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:35" (1/1) ... [2022-12-06 04:19:35,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:35" (1/1) ... [2022-12-06 04:19:35,582 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:35" (1/1) ... [2022-12-06 04:19:35,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:35" (1/1) ... [2022-12-06 04:19:35,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:19:35,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:19:35,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:19:35,588 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:19:35,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:35" (1/1) ... [2022-12-06 04:19:35,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:19:35,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:19:35,649 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:19:35,658 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:19:35,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:19:35,699 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:19:35,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:19:35,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:19:35,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:19:35,699 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:19:35,699 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:19:35,699 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:19:35,699 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:19:35,699 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:19:35,699 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:19:35,699 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:19:35,699 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:19:35,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:19:35,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:19:35,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:19:35,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:19:35,701 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:19:35,893 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:19:35,895 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:19:36,239 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:19:36,345 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:19:36,345 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:19:36,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:19:36 BoogieIcfgContainer [2022-12-06 04:19:36,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:19:36,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:19:36,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:19:36,352 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:19:36,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:19:34" (1/3) ... [2022-12-06 04:19:36,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3247961a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:19:36, skipping insertion in model container [2022-12-06 04:19:36,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:35" (2/3) ... [2022-12-06 04:19:36,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3247961a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:19:36, skipping insertion in model container [2022-12-06 04:19:36,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:19:36" (3/3) ... [2022-12-06 04:19:36,354 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 04:19:36,369 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:19:36,369 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:19:36,369 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:19:36,408 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:19:36,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2022-12-06 04:19:36,465 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-06 04:19:36,465 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:19:36,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-06 04:19:36,470 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2022-12-06 04:19:36,473 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 124 transitions, 260 flow [2022-12-06 04:19:36,474 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:36,486 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 124 transitions, 260 flow [2022-12-06 04:19:36,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 260 flow [2022-12-06 04:19:36,508 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-06 04:19:36,509 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:19:36,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-06 04:19:36,512 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 124 transitions, 260 flow [2022-12-06 04:19:36,512 INFO L188 LiptonReduction]: Number of co-enabled transitions 3058 [2022-12-06 04:19:40,722 INFO L203 LiptonReduction]: Total number of compositions: 95 [2022-12-06 04:19:40,734 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:19:40,738 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;@256f077d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:19:40,738 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 04:19:40,740 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 04:19:40,740 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:19:40,740 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:40,740 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 04:19:40,741 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:40,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:40,744 INFO L85 PathProgramCache]: Analyzing trace with hash 541648, now seen corresponding path program 1 times [2022-12-06 04:19:40,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:40,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78427379] [2022-12-06 04:19:40,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:40,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:40,961 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:19:40,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:40,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78427379] [2022-12-06 04:19:40,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78427379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:40,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:40,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:19:40,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023480775] [2022-12-06 04:19:40,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:40,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:19:40,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:40,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:19:40,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:19:40,982 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 04:19:40,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 82 flow. Second operand has 3 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:19:40,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:40,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 04:19:40,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:41,855 INFO L130 PetriNetUnfolder]: 6050/8368 cut-off events. [2022-12-06 04:19:41,855 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-12-06 04:19:41,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16767 conditions, 8368 events. 6050/8368 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 42750 event pairs, 2306 based on Foata normal form. 0/7635 useless extension candidates. Maximal degree in co-relation 16755. Up to 6574 conditions per place. [2022-12-06 04:19:41,894 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 41 selfloop transitions, 2 changer transitions 10/56 dead transitions. [2022-12-06 04:19:41,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 239 flow [2022-12-06 04:19:41,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:19:41,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:19:41,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-06 04:19:41,904 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2022-12-06 04:19:41,905 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 82 flow. Second operand 3 states and 67 transitions. [2022-12-06 04:19:41,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 239 flow [2022-12-06 04:19:41,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 232 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:19:41,910 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 66 flow [2022-12-06 04:19:41,911 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2022-12-06 04:19:41,915 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2022-12-06 04:19:41,915 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:41,916 INFO L89 Accepts]: Start accepts. Operand has 43 places, 27 transitions, 66 flow [2022-12-06 04:19:41,918 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:41,918 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:41,918 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 27 transitions, 66 flow [2022-12-06 04:19:41,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 66 flow [2022-12-06 04:19:41,924 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-12-06 04:19:41,924 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:19:41,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 27 events. 0/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 36 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:19:41,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 66 flow [2022-12-06 04:19:41,925 INFO L188 LiptonReduction]: Number of co-enabled transitions 384 [2022-12-06 04:19:42,057 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:19:42,059 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-06 04:19:42,059 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2022-12-06 04:19:42,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:19:42,059 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:42,059 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:42,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:19:42,060 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:42,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:42,060 INFO L85 PathProgramCache]: Analyzing trace with hash 785827368, now seen corresponding path program 1 times [2022-12-06 04:19:42,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:42,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631142448] [2022-12-06 04:19:42,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:42,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:42,337 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:19:42,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:42,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631142448] [2022-12-06 04:19:42,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631142448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:42,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:42,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:19:42,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610559002] [2022-12-06 04:19:42,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:42,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:19:42,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:42,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:19:42,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:19:42,340 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 04:19:42,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 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:19:42,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:42,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 04:19:42,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:44,025 INFO L130 PetriNetUnfolder]: 13482/18419 cut-off events. [2022-12-06 04:19:44,026 INFO L131 PetriNetUnfolder]: For 859/859 co-relation queries the response was YES. [2022-12-06 04:19:44,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38194 conditions, 18419 events. 13482/18419 cut-off events. For 859/859 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 96741 event pairs, 4784 based on Foata normal form. 529/18948 useless extension candidates. Maximal degree in co-relation 38184. Up to 10559 conditions per place. [2022-12-06 04:19:44,115 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 42 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2022-12-06 04:19:44,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 214 flow [2022-12-06 04:19:44,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:19:44,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:19:44,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-06 04:19:44,117 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6172839506172839 [2022-12-06 04:19:44,117 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 3 states and 50 transitions. [2022-12-06 04:19:44,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 214 flow [2022-12-06 04:19:44,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:19:44,118 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 116 flow [2022-12-06 04:19:44,119 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2022-12-06 04:19:44,119 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -7 predicate places. [2022-12-06 04:19:44,119 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:44,120 INFO L89 Accepts]: Start accepts. Operand has 40 places, 33 transitions, 116 flow [2022-12-06 04:19:44,120 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:44,120 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:44,121 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 33 transitions, 116 flow [2022-12-06 04:19:44,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 33 transitions, 116 flow [2022-12-06 04:19:44,160 INFO L130 PetriNetUnfolder]: 158/449 cut-off events. [2022-12-06 04:19:44,160 INFO L131 PetriNetUnfolder]: For 57/88 co-relation queries the response was YES. [2022-12-06 04:19:44,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 449 events. 158/449 cut-off events. For 57/88 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2871 event pairs, 68 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 846. Up to 189 conditions per place. [2022-12-06 04:19:44,165 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 33 transitions, 116 flow [2022-12-06 04:19:44,165 INFO L188 LiptonReduction]: Number of co-enabled transitions 488 [2022-12-06 04:19:44,196 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:19:44,197 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 04:19:44,197 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 116 flow [2022-12-06 04:19:44,197 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:19:44,197 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:44,197 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:44,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:19:44,198 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:44,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:44,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1409155189, now seen corresponding path program 1 times [2022-12-06 04:19:44,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:44,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403037965] [2022-12-06 04:19:44,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:44,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:44,340 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:19:44,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:44,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403037965] [2022-12-06 04:19:44,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403037965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:44,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:44,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:19:44,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348481382] [2022-12-06 04:19:44,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:44,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:19:44,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:44,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:19:44,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:19:44,346 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-06 04:19:44,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 116 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:19:44,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:44,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-06 04:19:44,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:45,664 INFO L130 PetriNetUnfolder]: 11273/15953 cut-off events. [2022-12-06 04:19:45,668 INFO L131 PetriNetUnfolder]: For 5914/5915 co-relation queries the response was YES. [2022-12-06 04:19:45,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38367 conditions, 15953 events. 11273/15953 cut-off events. For 5914/5915 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 93041 event pairs, 2626 based on Foata normal form. 40/15858 useless extension candidates. Maximal degree in co-relation 38355. Up to 14290 conditions per place. [2022-12-06 04:19:45,809 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 44 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2022-12-06 04:19:45,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 282 flow [2022-12-06 04:19:45,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:19:45,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:19:45,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-06 04:19:45,825 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2022-12-06 04:19:45,825 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 116 flow. Second operand 3 states and 48 transitions. [2022-12-06 04:19:45,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 282 flow [2022-12-06 04:19:45,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:19:45,879 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 143 flow [2022-12-06 04:19:45,879 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2022-12-06 04:19:45,881 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -6 predicate places. [2022-12-06 04:19:45,881 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:45,881 INFO L89 Accepts]: Start accepts. Operand has 41 places, 37 transitions, 143 flow [2022-12-06 04:19:45,882 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:45,882 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:45,882 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 37 transitions, 143 flow [2022-12-06 04:19:45,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 37 transitions, 143 flow [2022-12-06 04:19:45,923 INFO L130 PetriNetUnfolder]: 133/386 cut-off events. [2022-12-06 04:19:45,923 INFO L131 PetriNetUnfolder]: For 55/142 co-relation queries the response was YES. [2022-12-06 04:19:45,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 386 events. 133/386 cut-off events. For 55/142 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2357 event pairs, 44 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 715. Up to 163 conditions per place. [2022-12-06 04:19:45,926 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 37 transitions, 143 flow [2022-12-06 04:19:45,937 INFO L188 LiptonReduction]: Number of co-enabled transitions 560 [2022-12-06 04:19:45,988 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:19:45,989 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-06 04:19:45,989 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 143 flow [2022-12-06 04:19:45,989 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:19:45,990 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:45,990 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:45,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:19:45,990 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:45,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:45,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1409153980, now seen corresponding path program 1 times [2022-12-06 04:19:45,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:45,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443523345] [2022-12-06 04:19:45,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:45,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:46,104 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:19:46,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:46,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443523345] [2022-12-06 04:19:46,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443523345] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:46,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:46,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:19:46,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020813370] [2022-12-06 04:19:46,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:46,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:19:46,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:46,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:19:46,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:19:46,106 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 04:19:46,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 143 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:19:46,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:46,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 04:19:46,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:47,696 INFO L130 PetriNetUnfolder]: 12891/17616 cut-off events. [2022-12-06 04:19:47,696 INFO L131 PetriNetUnfolder]: For 6188/6188 co-relation queries the response was YES. [2022-12-06 04:19:47,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43603 conditions, 17616 events. 12891/17616 cut-off events. For 6188/6188 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 92830 event pairs, 2369 based on Foata normal form. 40/17656 useless extension candidates. Maximal degree in co-relation 43590. Up to 9627 conditions per place. [2022-12-06 04:19:47,761 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 63 selfloop transitions, 13 changer transitions 0/76 dead transitions. [2022-12-06 04:19:47,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 76 transitions, 407 flow [2022-12-06 04:19:47,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:19:47,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:19:47,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 04:19:47,762 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2022-12-06 04:19:47,763 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 143 flow. Second operand 4 states and 69 transitions. [2022-12-06 04:19:47,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 76 transitions, 407 flow [2022-12-06 04:19:47,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 76 transitions, 400 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:19:47,765 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 215 flow [2022-12-06 04:19:47,765 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2022-12-06 04:19:47,765 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2022-12-06 04:19:47,765 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:47,765 INFO L89 Accepts]: Start accepts. Operand has 45 places, 43 transitions, 215 flow [2022-12-06 04:19:47,766 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:47,766 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:47,766 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 43 transitions, 215 flow [2022-12-06 04:19:47,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 43 transitions, 215 flow [2022-12-06 04:19:47,788 INFO L130 PetriNetUnfolder]: 117/348 cut-off events. [2022-12-06 04:19:47,789 INFO L131 PetriNetUnfolder]: For 266/468 co-relation queries the response was YES. [2022-12-06 04:19:47,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 846 conditions, 348 events. 117/348 cut-off events. For 266/468 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2106 event pairs, 30 based on Foata normal form. 0/330 useless extension candidates. Maximal degree in co-relation 833. Up to 143 conditions per place. [2022-12-06 04:19:47,791 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 43 transitions, 215 flow [2022-12-06 04:19:47,791 INFO L188 LiptonReduction]: Number of co-enabled transitions 640 [2022-12-06 04:19:47,800 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:19:47,800 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 04:19:47,800 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 215 flow [2022-12-06 04:19:47,801 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:19:47,801 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:47,801 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:47,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:19:47,801 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:47,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:47,801 INFO L85 PathProgramCache]: Analyzing trace with hash -734136511, now seen corresponding path program 1 times [2022-12-06 04:19:47,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:47,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035622164] [2022-12-06 04:19:47,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:47,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:47,924 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:19:47,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:47,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035622164] [2022-12-06 04:19:47,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035622164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:47,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:47,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:19:47,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195105682] [2022-12-06 04:19:47,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:47,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:19:47,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:47,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:19:47,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:19:47,926 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 04:19:47,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:19:47,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:47,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 04:19:47,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:48,639 INFO L130 PetriNetUnfolder]: 6290/9314 cut-off events. [2022-12-06 04:19:48,639 INFO L131 PetriNetUnfolder]: For 6540/7026 co-relation queries the response was YES. [2022-12-06 04:19:48,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24410 conditions, 9314 events. 6290/9314 cut-off events. For 6540/7026 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 54661 event pairs, 1329 based on Foata normal form. 543/9624 useless extension candidates. Maximal degree in co-relation 24394. Up to 7734 conditions per place. [2022-12-06 04:19:48,721 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 53 selfloop transitions, 5 changer transitions 0/68 dead transitions. [2022-12-06 04:19:48,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 68 transitions, 430 flow [2022-12-06 04:19:48,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:19:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:19:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-06 04:19:48,730 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2022-12-06 04:19:48,730 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 215 flow. Second operand 3 states and 53 transitions. [2022-12-06 04:19:48,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 68 transitions, 430 flow [2022-12-06 04:19:48,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 68 transitions, 430 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:19:48,737 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 248 flow [2022-12-06 04:19:48,737 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2022-12-06 04:19:48,737 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 1 predicate places. [2022-12-06 04:19:48,738 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:48,738 INFO L89 Accepts]: Start accepts. Operand has 48 places, 47 transitions, 248 flow [2022-12-06 04:19:48,738 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:48,738 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:48,738 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 47 transitions, 248 flow [2022-12-06 04:19:48,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 47 transitions, 248 flow [2022-12-06 04:19:48,805 INFO L130 PetriNetUnfolder]: 456/1092 cut-off events. [2022-12-06 04:19:48,806 INFO L131 PetriNetUnfolder]: For 542/766 co-relation queries the response was YES. [2022-12-06 04:19:48,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2493 conditions, 1092 events. 456/1092 cut-off events. For 542/766 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 8296 event pairs, 187 based on Foata normal form. 4/1008 useless extension candidates. Maximal degree in co-relation 2477. Up to 547 conditions per place. [2022-12-06 04:19:48,815 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 47 transitions, 248 flow [2022-12-06 04:19:48,815 INFO L188 LiptonReduction]: Number of co-enabled transitions 756 [2022-12-06 04:19:48,825 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:19:48,828 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 04:19:48,828 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 248 flow [2022-12-06 04:19:48,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:19:48,828 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:48,828 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:19:48,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:19:48,828 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:48,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:48,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1689401351, now seen corresponding path program 1 times [2022-12-06 04:19:48,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:48,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963257707] [2022-12-06 04:19:48,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:48,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:48,990 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:19:48,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:48,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963257707] [2022-12-06 04:19:48,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963257707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:48,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:48,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:19:48,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157577465] [2022-12-06 04:19:48,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:48,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:19:48,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:48,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:19:48,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:19:48,992 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 04:19:48,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 248 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:19:48,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:48,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 04:19:48,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:50,233 INFO L130 PetriNetUnfolder]: 11596/16677 cut-off events. [2022-12-06 04:19:50,233 INFO L131 PetriNetUnfolder]: For 17438/17438 co-relation queries the response was YES. [2022-12-06 04:19:50,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51009 conditions, 16677 events. 11596/16677 cut-off events. For 17438/17438 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 95572 event pairs, 2917 based on Foata normal form. 223/16900 useless extension candidates. Maximal degree in co-relation 50990. Up to 7370 conditions per place. [2022-12-06 04:19:50,291 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 78 selfloop transitions, 15 changer transitions 4/97 dead transitions. [2022-12-06 04:19:50,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 97 transitions, 639 flow [2022-12-06 04:19:50,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:19:50,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:19:50,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-06 04:19:50,292 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6574074074074074 [2022-12-06 04:19:50,292 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 248 flow. Second operand 4 states and 71 transitions. [2022-12-06 04:19:50,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 97 transitions, 639 flow [2022-12-06 04:19:50,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 97 transitions, 626 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:19:50,302 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 339 flow [2022-12-06 04:19:50,302 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=339, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2022-12-06 04:19:50,302 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 6 predicate places. [2022-12-06 04:19:50,302 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:50,303 INFO L89 Accepts]: Start accepts. Operand has 53 places, 50 transitions, 339 flow [2022-12-06 04:19:50,303 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:50,303 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:50,303 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 50 transitions, 339 flow [2022-12-06 04:19:50,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 50 transitions, 339 flow [2022-12-06 04:19:50,375 INFO L130 PetriNetUnfolder]: 597/1383 cut-off events. [2022-12-06 04:19:50,375 INFO L131 PetriNetUnfolder]: For 1154/1547 co-relation queries the response was YES. [2022-12-06 04:19:50,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3290 conditions, 1383 events. 597/1383 cut-off events. For 1154/1547 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 10939 event pairs, 260 based on Foata normal form. 3/1256 useless extension candidates. Maximal degree in co-relation 3270. Up to 859 conditions per place. [2022-12-06 04:19:50,385 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 50 transitions, 339 flow [2022-12-06 04:19:50,385 INFO L188 LiptonReduction]: Number of co-enabled transitions 836 [2022-12-06 04:19:50,397 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:19:50,397 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 04:19:50,397 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 339 flow [2022-12-06 04:19:50,397 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:19:50,398 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:50,398 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:19:50,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:19:50,398 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:50,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:50,398 INFO L85 PathProgramCache]: Analyzing trace with hash -143707961, now seen corresponding path program 1 times [2022-12-06 04:19:50,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:50,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774613597] [2022-12-06 04:19:50,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:50,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:50,544 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:19:50,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:50,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774613597] [2022-12-06 04:19:50,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774613597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:50,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:50,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:19:50,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374523638] [2022-12-06 04:19:50,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:50,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:19:50,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:50,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:19:50,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:19:50,545 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 04:19:50,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 339 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:19:50,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:50,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 04:19:50,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:51,566 INFO L130 PetriNetUnfolder]: 4990/7780 cut-off events. [2022-12-06 04:19:51,567 INFO L131 PetriNetUnfolder]: For 10504/10987 co-relation queries the response was YES. [2022-12-06 04:19:51,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23880 conditions, 7780 events. 4990/7780 cut-off events. For 10504/10987 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 48497 event pairs, 961 based on Foata normal form. 729/8335 useless extension candidates. Maximal degree in co-relation 23857. Up to 3593 conditions per place. [2022-12-06 04:19:51,619 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 78 selfloop transitions, 9 changer transitions 0/98 dead transitions. [2022-12-06 04:19:51,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 98 transitions, 777 flow [2022-12-06 04:19:51,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:19:51,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:19:51,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-06 04:19:51,627 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6759259259259259 [2022-12-06 04:19:51,628 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 339 flow. Second operand 4 states and 73 transitions. [2022-12-06 04:19:51,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 98 transitions, 777 flow [2022-12-06 04:19:51,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 98 transitions, 767 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-12-06 04:19:51,637 INFO L231 Difference]: Finished difference. Result has 57 places, 54 transitions, 385 flow [2022-12-06 04:19:51,637 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=385, PETRI_PLACES=57, PETRI_TRANSITIONS=54} [2022-12-06 04:19:51,637 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 10 predicate places. [2022-12-06 04:19:51,638 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:51,638 INFO L89 Accepts]: Start accepts. Operand has 57 places, 54 transitions, 385 flow [2022-12-06 04:19:51,638 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:51,638 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:51,639 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 54 transitions, 385 flow [2022-12-06 04:19:51,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 54 transitions, 385 flow [2022-12-06 04:19:51,723 INFO L130 PetriNetUnfolder]: 359/970 cut-off events. [2022-12-06 04:19:51,723 INFO L131 PetriNetUnfolder]: For 1066/1457 co-relation queries the response was YES. [2022-12-06 04:19:51,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2981 conditions, 970 events. 359/970 cut-off events. For 1066/1457 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 7398 event pairs, 75 based on Foata normal form. 37/958 useless extension candidates. Maximal degree in co-relation 2958. Up to 554 conditions per place. [2022-12-06 04:19:51,734 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 54 transitions, 385 flow [2022-12-06 04:19:51,734 INFO L188 LiptonReduction]: Number of co-enabled transitions 980 [2022-12-06 04:19:51,749 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:19:51,750 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-06 04:19:51,750 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 385 flow [2022-12-06 04:19:51,750 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:19:51,750 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:51,751 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:51,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:19:51,751 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:51,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:51,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1671324546, now seen corresponding path program 1 times [2022-12-06 04:19:51,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:51,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952178181] [2022-12-06 04:19:51,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:51,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:51,987 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:19:51,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:51,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952178181] [2022-12-06 04:19:51,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952178181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:51,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:51,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:19:51,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622063463] [2022-12-06 04:19:51,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:51,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:19:51,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:51,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:19:51,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:19:51,990 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 04:19:51,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 385 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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:19:51,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:51,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 04:19:51,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:52,699 INFO L130 PetriNetUnfolder]: 3747/5822 cut-off events. [2022-12-06 04:19:52,699 INFO L131 PetriNetUnfolder]: For 10807/11195 co-relation queries the response was YES. [2022-12-06 04:19:52,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20369 conditions, 5822 events. 3747/5822 cut-off events. For 10807/11195 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 35317 event pairs, 798 based on Foata normal form. 435/6106 useless extension candidates. Maximal degree in co-relation 20343. Up to 2306 conditions per place. [2022-12-06 04:19:52,731 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 90 selfloop transitions, 13 changer transitions 4/118 dead transitions. [2022-12-06 04:19:52,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 118 transitions, 958 flow [2022-12-06 04:19:52,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:19:52,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:19:52,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-06 04:19:52,733 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.674074074074074 [2022-12-06 04:19:52,733 INFO L175 Difference]: Start difference. First operand has 57 places, 54 transitions, 385 flow. Second operand 5 states and 91 transitions. [2022-12-06 04:19:52,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 118 transitions, 958 flow [2022-12-06 04:19:52,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 118 transitions, 940 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 04:19:52,744 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 435 flow [2022-12-06 04:19:52,744 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=435, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2022-12-06 04:19:52,744 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 13 predicate places. [2022-12-06 04:19:52,745 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:52,745 INFO L89 Accepts]: Start accepts. Operand has 60 places, 58 transitions, 435 flow [2022-12-06 04:19:52,746 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:52,746 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:52,746 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 58 transitions, 435 flow [2022-12-06 04:19:52,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 58 transitions, 435 flow [2022-12-06 04:19:52,793 INFO L130 PetriNetUnfolder]: 233/620 cut-off events. [2022-12-06 04:19:52,793 INFO L131 PetriNetUnfolder]: For 1186/1540 co-relation queries the response was YES. [2022-12-06 04:19:52,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2190 conditions, 620 events. 233/620 cut-off events. For 1186/1540 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4090 event pairs, 19 based on Foata normal form. 44/630 useless extension candidates. Maximal degree in co-relation 2166. Up to 304 conditions per place. [2022-12-06 04:19:52,800 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 58 transitions, 435 flow [2022-12-06 04:19:52,800 INFO L188 LiptonReduction]: Number of co-enabled transitions 960 [2022-12-06 04:19:52,804 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:19:52,805 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-06 04:19:52,805 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 435 flow [2022-12-06 04:19:52,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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:19:52,805 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:52,805 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:52,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:19:52,806 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:52,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:52,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1228184581, now seen corresponding path program 1 times [2022-12-06 04:19:52,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:52,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731121774] [2022-12-06 04:19:52,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:52,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:52,992 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:19:52,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:52,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731121774] [2022-12-06 04:19:52,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731121774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:52,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:52,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:19:52,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744782382] [2022-12-06 04:19:52,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:52,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:19:52,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:52,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:19:52,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:19:52,994 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 04:19:52,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 435 flow. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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:19:52,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:52,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 04:19:52,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:53,592 INFO L130 PetriNetUnfolder]: 3629/5571 cut-off events. [2022-12-06 04:19:53,593 INFO L131 PetriNetUnfolder]: For 11410/11797 co-relation queries the response was YES. [2022-12-06 04:19:53,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20000 conditions, 5571 events. 3629/5571 cut-off events. For 11410/11797 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 33611 event pairs, 788 based on Foata normal form. 214/5635 useless extension candidates. Maximal degree in co-relation 19973. Up to 2306 conditions per place. [2022-12-06 04:19:53,630 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 76 selfloop transitions, 17 changer transitions 18/118 dead transitions. [2022-12-06 04:19:53,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 118 transitions, 984 flow [2022-12-06 04:19:53,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:19:53,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:19:53,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2022-12-06 04:19:53,633 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5802469135802469 [2022-12-06 04:19:53,633 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 435 flow. Second operand 6 states and 94 transitions. [2022-12-06 04:19:53,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 118 transitions, 984 flow [2022-12-06 04:19:53,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 118 transitions, 946 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 04:19:53,812 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 376 flow [2022-12-06 04:19:53,813 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2022-12-06 04:19:53,813 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 16 predicate places. [2022-12-06 04:19:53,814 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:53,814 INFO L89 Accepts]: Start accepts. Operand has 63 places, 51 transitions, 376 flow [2022-12-06 04:19:53,818 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:53,818 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:53,818 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 51 transitions, 376 flow [2022-12-06 04:19:53,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 51 transitions, 376 flow [2022-12-06 04:19:53,843 INFO L130 PetriNetUnfolder]: 95/244 cut-off events. [2022-12-06 04:19:53,843 INFO L131 PetriNetUnfolder]: For 457/523 co-relation queries the response was YES. [2022-12-06 04:19:53,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 888 conditions, 244 events. 95/244 cut-off events. For 457/523 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1217 event pairs, 6 based on Foata normal form. 1/232 useless extension candidates. Maximal degree in co-relation 863. Up to 77 conditions per place. [2022-12-06 04:19:53,847 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 51 transitions, 376 flow [2022-12-06 04:19:53,848 INFO L188 LiptonReduction]: Number of co-enabled transitions 606 [2022-12-06 04:19:54,192 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:19:54,192 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 378 [2022-12-06 04:19:54,193 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 372 flow [2022-12-06 04:19:54,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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:19:54,193 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:54,193 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:54,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:19:54,193 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:54,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:54,193 INFO L85 PathProgramCache]: Analyzing trace with hash -77296911, now seen corresponding path program 1 times [2022-12-06 04:19:54,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:54,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411162177] [2022-12-06 04:19:54,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:54,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:54,537 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:19:54,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:54,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411162177] [2022-12-06 04:19:54,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411162177] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:54,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:54,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:19:54,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306730135] [2022-12-06 04:19:54,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:54,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:19:54,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:54,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:19:54,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:19:54,539 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 04:19:54,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 372 flow. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:54,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:54,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 04:19:54,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:55,238 INFO L130 PetriNetUnfolder]: 3762/5714 cut-off events. [2022-12-06 04:19:55,239 INFO L131 PetriNetUnfolder]: For 18276/18276 co-relation queries the response was YES. [2022-12-06 04:19:55,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22904 conditions, 5714 events. 3762/5714 cut-off events. For 18276/18276 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 30779 event pairs, 215 based on Foata normal form. 2/5716 useless extension candidates. Maximal degree in co-relation 22876. Up to 1204 conditions per place. [2022-12-06 04:19:55,269 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 168 selfloop transitions, 75 changer transitions 35/278 dead transitions. [2022-12-06 04:19:55,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 278 transitions, 2543 flow [2022-12-06 04:19:55,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 04:19:55,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 04:19:55,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 171 transitions. [2022-12-06 04:19:55,271 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5261538461538462 [2022-12-06 04:19:55,271 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 372 flow. Second operand 13 states and 171 transitions. [2022-12-06 04:19:55,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 278 transitions, 2543 flow [2022-12-06 04:19:55,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 278 transitions, 2084 flow, removed 48 selfloop flow, removed 9 redundant places. [2022-12-06 04:19:55,331 INFO L231 Difference]: Finished difference. Result has 74 places, 116 transitions, 1047 flow [2022-12-06 04:19:55,331 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1047, PETRI_PLACES=74, PETRI_TRANSITIONS=116} [2022-12-06 04:19:55,331 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 27 predicate places. [2022-12-06 04:19:55,331 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:55,331 INFO L89 Accepts]: Start accepts. Operand has 74 places, 116 transitions, 1047 flow [2022-12-06 04:19:55,333 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:55,333 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:55,333 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 116 transitions, 1047 flow [2022-12-06 04:19:55,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 116 transitions, 1047 flow [2022-12-06 04:19:55,415 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([382] L782-->L789: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd2~0_24 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_129 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_26 256) 0)))) (let ((.cse1 (and (not (= (mod v_~a$w_buff0_used~0_130 256) 0)) .cse5)) (.cse0 (and .cse4 .cse5)) (.cse2 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_123 256) 0))))) (and (= v_~a$r_buff0_thd2~0_25 (ite .cse0 0 v_~a$r_buff0_thd2~0_26)) (= v_~a~0_74 (ite .cse1 v_~a$w_buff0~0_52 (ite .cse2 v_~a$w_buff1~0_47 v_~a~0_75))) (= (ite .cse1 0 v_~a$w_buff0_used~0_130) v_~a$w_buff0_used~0_129) (= (ite (or .cse0 .cse2) 0 v_~a$w_buff1_used~0_123) v_~a$w_buff1_used~0_122) (= v_~a$r_buff1_thd2~0_23 (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and .cse4 (not (= (mod v_~a$r_buff0_thd2~0_25 256) 0)))) 0 v_~a$r_buff1_thd2~0_24))))) InVars {~a~0=v_~a~0_75, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_24, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_26, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_130, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123} OutVars{~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_23, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_25, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_129, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][45], [Black: 192#(<= ~__unbuffered_cnt~0 3), P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 50#L769true, P0Thread1of1ForFork3InUse, 90#L789true, 39#L809true, Black: 211#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 0))), Black: 200#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 199#(not (= ~z~0 0)), 19#L866-3true, Black: 213#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 207#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$w_buff0_used~0 0) (not (= ~z~0 0))), Black: 157#(<= ~y~0 0), Black: 196#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 204#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 209#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$w_buff0_used~0 1) (not (= ~z~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 202#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$w_buff0_used~0 0)), 172#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 162#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 215#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (not (= ~z~0 0))), Black: 171#(= ~x~0 1), Black: 179#(<= ~__unbuffered_cnt~0 1), 76#L835true, Black: 185#(<= ~__unbuffered_cnt~0 2), 178#(= ~__unbuffered_cnt~0 0)]) [2022-12-06 04:19:55,416 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-06 04:19:55,416 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 04:19:55,416 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 04:19:55,416 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 04:19:55,428 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([382] L782-->L789: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd2~0_24 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_129 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_26 256) 0)))) (let ((.cse1 (and (not (= (mod v_~a$w_buff0_used~0_130 256) 0)) .cse5)) (.cse0 (and .cse4 .cse5)) (.cse2 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_123 256) 0))))) (and (= v_~a$r_buff0_thd2~0_25 (ite .cse0 0 v_~a$r_buff0_thd2~0_26)) (= v_~a~0_74 (ite .cse1 v_~a$w_buff0~0_52 (ite .cse2 v_~a$w_buff1~0_47 v_~a~0_75))) (= (ite .cse1 0 v_~a$w_buff0_used~0_130) v_~a$w_buff0_used~0_129) (= (ite (or .cse0 .cse2) 0 v_~a$w_buff1_used~0_123) v_~a$w_buff1_used~0_122) (= v_~a$r_buff1_thd2~0_23 (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and .cse4 (not (= (mod v_~a$r_buff0_thd2~0_25 256) 0)))) 0 v_~a$r_buff1_thd2~0_24))))) InVars {~a~0=v_~a~0_75, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_24, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_26, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_130, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123} OutVars{~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_23, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_25, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_129, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][45], [Black: 192#(<= ~__unbuffered_cnt~0 3), P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 50#L769true, P0Thread1of1ForFork3InUse, 90#L789true, 39#L809true, Black: 211#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 0))), Black: 200#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 199#(not (= ~z~0 0)), Black: 213#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 0)) (= ~a$r_buff0_thd1~0 1)), 19#L866-3true, Black: 207#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$w_buff0_used~0 0) (not (= ~z~0 0))), Black: 157#(<= ~y~0 0), Black: 196#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 204#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 209#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$w_buff0_used~0 1) (not (= ~z~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 202#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$w_buff0_used~0 0)), 172#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 162#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 215#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (not (= ~z~0 0))), Black: 171#(= ~x~0 1), Black: 179#(<= ~__unbuffered_cnt~0 1), 35#L842true, Black: 185#(<= ~__unbuffered_cnt~0 2), 178#(= ~__unbuffered_cnt~0 0)]) [2022-12-06 04:19:55,429 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-06 04:19:55,429 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 04:19:55,429 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 04:19:55,429 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 04:19:55,449 INFO L130 PetriNetUnfolder]: 771/1691 cut-off events. [2022-12-06 04:19:55,449 INFO L131 PetriNetUnfolder]: For 4416/4761 co-relation queries the response was YES. [2022-12-06 04:19:55,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6344 conditions, 1691 events. 771/1691 cut-off events. For 4416/4761 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 12994 event pairs, 118 based on Foata normal form. 69/1661 useless extension candidates. Maximal degree in co-relation 6314. Up to 477 conditions per place. [2022-12-06 04:19:55,463 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 116 transitions, 1047 flow [2022-12-06 04:19:55,463 INFO L188 LiptonReduction]: Number of co-enabled transitions 1158 [2022-12-06 04:19:55,466 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:19:55,466 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-06 04:19:55,466 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 116 transitions, 1047 flow [2022-12-06 04:19:55,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:19:55,466 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:55,466 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:55,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:19:55,467 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:55,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:55,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1889404507, now seen corresponding path program 2 times [2022-12-06 04:19:55,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:55,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618271719] [2022-12-06 04:19:55,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:55,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:19:56,123 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:19:56,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:19:56,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618271719] [2022-12-06 04:19:56,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618271719] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:19:56,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:19:56,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:19:56,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175184531] [2022-12-06 04:19:56,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:19:56,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:19:56,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:19:56,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:19:56,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:19:56,125 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 04:19:56,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 116 transitions, 1047 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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:19:56,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:19:56,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 04:19:56,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:19:56,807 INFO L130 PetriNetUnfolder]: 3386/5459 cut-off events. [2022-12-06 04:19:56,807 INFO L131 PetriNetUnfolder]: For 21423/21798 co-relation queries the response was YES. [2022-12-06 04:19:56,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26296 conditions, 5459 events. 3386/5459 cut-off events. For 21423/21798 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 33286 event pairs, 514 based on Foata normal form. 90/5502 useless extension candidates. Maximal degree in co-relation 26263. Up to 3017 conditions per place. [2022-12-06 04:19:56,831 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 92 selfloop transitions, 8 changer transitions 61/185 dead transitions. [2022-12-06 04:19:56,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 185 transitions, 1811 flow [2022-12-06 04:19:56,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:19:56,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:19:56,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-12-06 04:19:56,833 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5266666666666666 [2022-12-06 04:19:56,833 INFO L175 Difference]: Start difference. First operand has 74 places, 116 transitions, 1047 flow. Second operand 6 states and 79 transitions. [2022-12-06 04:19:56,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 185 transitions, 1811 flow [2022-12-06 04:19:56,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 185 transitions, 1799 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-06 04:19:56,933 INFO L231 Difference]: Finished difference. Result has 80 places, 96 transitions, 852 flow [2022-12-06 04:19:56,933 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=852, PETRI_PLACES=80, PETRI_TRANSITIONS=96} [2022-12-06 04:19:56,933 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 33 predicate places. [2022-12-06 04:19:56,933 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:19:56,933 INFO L89 Accepts]: Start accepts. Operand has 80 places, 96 transitions, 852 flow [2022-12-06 04:19:56,938 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:19:56,938 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:19:56,938 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 96 transitions, 852 flow [2022-12-06 04:19:56,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 96 transitions, 852 flow [2022-12-06 04:19:57,009 INFO L130 PetriNetUnfolder]: 434/997 cut-off events. [2022-12-06 04:19:57,011 INFO L131 PetriNetUnfolder]: For 3028/3190 co-relation queries the response was YES. [2022-12-06 04:19:57,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3881 conditions, 997 events. 434/997 cut-off events. For 3028/3190 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 6848 event pairs, 76 based on Foata normal form. 13/951 useless extension candidates. Maximal degree in co-relation 3848. Up to 301 conditions per place. [2022-12-06 04:19:57,019 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 96 transitions, 852 flow [2022-12-06 04:19:57,019 INFO L188 LiptonReduction]: Number of co-enabled transitions 678 [2022-12-06 04:19:57,483 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [416] $Ultimate##0-->L819: Formula: (and (= v_~z~0_10 1) (= |v_P3Thread1of1ForFork0_#in~arg.base_5| v_P3Thread1of1ForFork0_~arg.base_5) (= v_P3Thread1of1ForFork0_~arg.offset_5 |v_P3Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|} OutVars{P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_5, ~z~0=v_~z~0_10, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_5} AuxVars[] AssignedVars[P3Thread1of1ForFork0_~arg.offset, ~z~0, P3Thread1of1ForFork0_~arg.base] and [388] L799-->L802: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_1) InVars {~z~0=v_~z~0_1} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] [2022-12-06 04:19:57,503 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 04:19:57,504 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 571 [2022-12-06 04:19:57,504 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 92 transitions, 845 flow [2022-12-06 04:19:57,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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:19:57,504 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:19:57,504 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:57,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:19:57,504 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:19:57,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:19:57,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1185236179, now seen corresponding path program 3 times [2022-12-06 04:19:57,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:19:57,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757924879] [2022-12-06 04:19:57,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:19:57,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:19:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:19:57,552 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:19:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:19:57,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:19:57,651 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:19:57,652 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 04:19:57,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 04:19:57,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 04:19:57,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 04:19:57,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 04:19:57,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 04:19:57,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 04:19:57,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:19:57,655 INFO L458 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:19:57,659 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:19:57,659 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:19:57,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:19:57 BasicIcfg [2022-12-06 04:19:57,717 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:19:57,717 INFO L158 Benchmark]: Toolchain (without parser) took 22850.81ms. Allocated memory was 189.8MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 165.4MB in the beginning and 1.1GB in the end (delta: -961.1MB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-06 04:19:57,718 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory is still 166.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:19:57,718 INFO L158 Benchmark]: CACSL2BoogieTranslator took 614.73ms. Allocated memory is still 189.8MB. Free memory was 165.2MB in the beginning and 137.3MB in the end (delta: 27.9MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 04:19:57,718 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.67ms. Allocated memory is still 189.8MB. Free memory was 137.3MB in the beginning and 134.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:19:57,718 INFO L158 Benchmark]: Boogie Preprocessor took 21.62ms. Allocated memory is still 189.8MB. Free memory was 134.8MB in the beginning and 132.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:19:57,718 INFO L158 Benchmark]: RCFGBuilder took 760.34ms. Allocated memory is still 189.8MB. Free memory was 132.7MB in the beginning and 94.9MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-06 04:19:57,718 INFO L158 Benchmark]: TraceAbstraction took 21367.58ms. Allocated memory was 189.8MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 93.9MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-06 04:19:57,721 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.09ms. Allocated memory is still 189.8MB. Free memory is still 166.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 614.73ms. Allocated memory is still 189.8MB. Free memory was 165.2MB in the beginning and 137.3MB in the end (delta: 27.9MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 81.67ms. Allocated memory is still 189.8MB. Free memory was 137.3MB in the beginning and 134.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.62ms. Allocated memory is still 189.8MB. Free memory was 134.8MB in the beginning and 132.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 760.34ms. Allocated memory is still 189.8MB. Free memory was 132.7MB in the beginning and 94.9MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 21367.58ms. Allocated memory was 189.8MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 93.9MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 135 PlacesBefore, 47 PlacesAfterwards, 124 TransitionsBefore, 35 TransitionsAfterwards, 3058 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 95 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2350, independent: 2282, independent conditional: 2282, independent unconditional: 0, dependent: 68, dependent conditional: 68, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2350, independent: 2282, independent conditional: 0, independent unconditional: 2282, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2350, independent: 2282, independent conditional: 0, independent unconditional: 2282, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2350, independent: 2282, independent conditional: 0, independent unconditional: 2282, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1856, independent: 1805, independent conditional: 0, independent unconditional: 1805, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1856, independent: 1781, independent conditional: 0, independent unconditional: 1781, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 229, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 210, dependent conditional: 0, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2350, independent: 477, independent conditional: 0, independent unconditional: 477, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1856, unknown conditional: 0, unknown unconditional: 1856] , Statistics on independence cache: Total cache size (in pairs): 2805, Positive cache size: 2754, Positive conditional cache size: 0, Positive unconditional cache size: 2754, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 38 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 384 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 152, independent: 124, independent conditional: 124, 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: 152, independent: 124, independent conditional: 18, independent unconditional: 106, dependent: 28, dependent conditional: 11, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 152, independent: 124, independent conditional: 18, independent unconditional: 106, dependent: 28, dependent conditional: 11, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 152, independent: 124, independent conditional: 18, independent unconditional: 106, dependent: 28, dependent conditional: 11, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 138, independent: 115, independent conditional: 17, independent unconditional: 98, dependent: 23, dependent conditional: 10, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 138, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 30, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 23, dependent conditional: 10, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 127, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 118, dependent conditional: 74, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 152, independent: 9, independent conditional: 1, independent unconditional: 8, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 138, unknown conditional: 27, unknown unconditional: 111] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 115, Positive conditional cache size: 17, Positive unconditional cache size: 98, Negative cache size: 23, Negative conditional cache size: 10, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 488 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 152, independent: 134, independent conditional: 134, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 152, independent: 134, independent conditional: 18, independent unconditional: 116, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 152, independent: 134, independent conditional: 0, independent unconditional: 134, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 152, independent: 134, independent conditional: 0, independent unconditional: 134, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 152, independent: 119, independent conditional: 0, independent unconditional: 119, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 130, Positive conditional cache size: 17, Positive unconditional cache size: 113, Negative cache size: 29, Negative conditional cache size: 10, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 560 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 166, independent: 146, independent conditional: 146, 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: 166, independent: 146, independent conditional: 22, independent unconditional: 124, 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: 166, independent: 146, independent conditional: 0, independent unconditional: 146, 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: 166, independent: 146, independent conditional: 0, independent unconditional: 146, 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: 21, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 42, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 166, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 146, Positive conditional cache size: 17, Positive unconditional cache size: 129, Negative cache size: 34, Negative conditional cache size: 10, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 640 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 236, independent: 211, independent conditional: 211, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 236, independent: 211, independent conditional: 81, independent unconditional: 130, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 236, independent: 211, independent conditional: 0, independent unconditional: 211, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 236, independent: 211, independent conditional: 0, independent unconditional: 211, dependent: 25, dependent conditional: 0, dependent unconditional: 25, 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: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 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: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 236, independent: 208, independent conditional: 0, independent unconditional: 208, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 149, Positive conditional cache size: 17, Positive unconditional cache size: 132, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 81, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 756 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 148, independent: 125, independent conditional: 125, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 148, independent: 125, independent conditional: 57, independent unconditional: 68, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 148, independent: 125, independent conditional: 3, independent unconditional: 122, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 148, independent: 125, independent conditional: 3, independent unconditional: 122, dependent: 23, dependent conditional: 0, dependent unconditional: 23, 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: 148, independent: 125, independent conditional: 3, independent unconditional: 122, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 149, Positive conditional cache size: 17, Positive unconditional cache size: 132, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 54, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 836 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 144, independent: 119, independent conditional: 119, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 144, independent: 119, independent conditional: 58, independent unconditional: 61, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 144, independent: 119, independent conditional: 4, independent unconditional: 115, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 144, independent: 119, independent conditional: 4, independent unconditional: 115, dependent: 25, dependent conditional: 0, dependent unconditional: 25, 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: 144, independent: 119, independent conditional: 4, independent unconditional: 115, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 149, Positive conditional cache size: 17, Positive unconditional cache size: 132, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 54, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 980 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 134, independent conditional: 134, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 164, independent: 134, independent conditional: 68, independent unconditional: 66, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 134, independent conditional: 4, independent unconditional: 130, 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: 164, independent: 134, independent conditional: 4, independent unconditional: 130, 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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 164, independent: 134, independent conditional: 4, independent unconditional: 130, 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): 185, Positive cache size: 149, Positive conditional cache size: 17, Positive unconditional cache size: 132, Negative cache size: 36, Negative conditional cache size: 10, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 64, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 960 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 175, independent: 141, independent conditional: 141, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 175, independent: 141, independent conditional: 70, independent unconditional: 71, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 175, independent: 141, independent conditional: 4, independent unconditional: 137, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 175, independent: 141, independent conditional: 4, independent unconditional: 137, dependent: 34, dependent conditional: 0, dependent unconditional: 34, 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: 175, independent: 141, independent conditional: 4, independent unconditional: 137, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 149, Positive conditional cache size: 17, Positive unconditional cache size: 132, Negative cache size: 36, Negative conditional cache size: 10, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 66, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 63 PlacesBefore, 61 PlacesAfterwards, 51 TransitionsBefore, 49 TransitionsAfterwards, 606 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 232, independent: 172, independent conditional: 172, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 232, independent: 172, independent conditional: 88, independent unconditional: 84, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 232, independent: 172, independent conditional: 8, independent unconditional: 164, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 232, independent: 172, independent conditional: 8, independent unconditional: 164, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 55, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 232, independent: 172, independent conditional: 8, independent unconditional: 164, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 149, Positive conditional cache size: 17, Positive unconditional cache size: 132, Negative cache size: 41, Negative conditional cache size: 10, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 80, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 74 PlacesBefore, 74 PlacesAfterwards, 116 TransitionsBefore, 116 TransitionsAfterwards, 1158 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 149, Positive conditional cache size: 17, Positive unconditional cache size: 132, Negative cache size: 41, Negative conditional cache size: 10, Negative unconditional cache size: 31, 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.5s, 79 PlacesBefore, 78 PlacesAfterwards, 96 TransitionsBefore, 92 TransitionsAfterwards, 678 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 128, independent: 128, independent conditional: 128, 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: 128, independent: 128, independent conditional: 128, 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: 128, independent: 128, independent conditional: 106, independent unconditional: 22, 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: 128, independent: 128, independent conditional: 106, independent unconditional: 22, 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: 20, independent: 20, independent conditional: 15, independent unconditional: 5, 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: 20, independent: 20, independent conditional: 0, independent unconditional: 20, 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: 128, independent: 108, independent conditional: 91, independent unconditional: 17, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 20, unknown conditional: 15, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 263, Positive cache size: 222, Positive conditional cache size: 34, Positive unconditional cache size: 188, Negative cache size: 41, Negative conditional cache size: 10, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, 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 a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L859] 0 pthread_t t1409; [L860] FCALL, FORK 0 pthread_create(&t1409, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1409, ((void *)0), P0, ((void *)0))=8, t1409={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1410; [L862] FCALL, FORK 0 pthread_create(&t1410, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1410, ((void *)0), P1, ((void *)0))=9, t1409={5:0}, t1410={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1411; [L864] FCALL, FORK 0 pthread_create(&t1411, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1411, ((void *)0), P2, ((void *)0))=10, t1409={5:0}, t1410={6:0}, t1411={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1412; [L866] FCALL, FORK 0 pthread_create(&t1412, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1412, ((void *)0), P3, ((void *)0))=11, t1409={5:0}, t1410={6:0}, t1411={7:0}, t1412={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L798] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L801] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L818] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 a$flush_delayed = weak$$choice2 [L824] 4 a$mem_tmp = a [L825] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L827] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = a [L833] 4 a = a$flush_delayed ? a$mem_tmp : a [L834] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L837] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L879] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 862]: 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: 866]: 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: 864]: 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: 860]: 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: 21.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 448 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 448 mSDsluCounter, 55 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1112 IncrementalHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 27 mSDtfsCounter, 1112 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1047occurred in iteration=10, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 164 ConstructedInterpolants, 0 QuantifiedInterpolants, 1119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:19:57,741 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...