/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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:34:56,291 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:34:56,293 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:34:56,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:34:56,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:34:56,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:34:56,325 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:34:56,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:34:56,332 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:34:56,335 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:34:56,336 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:34:56,337 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:34:56,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:34:56,340 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:34:56,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:34:56,343 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:34:56,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:34:56,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:34:56,346 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:34:56,350 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:34:56,350 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:34:56,351 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:34:56,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:34:56,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:34:56,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:34:56,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:34:56,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:34:56,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:34:56,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:34:56,361 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:34:56,361 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:34:56,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:34:56,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:34:56,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:34:56,368 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:34:56,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:34:56,369 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:34:56,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:34:56,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:34:56,370 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:34:56,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:34:56,371 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:34:56,395 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:34:56,396 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:34:56,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:34:56,397 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:34:56,397 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:34:56,397 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:34:56,398 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:34:56,398 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:34:56,398 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:34:56,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:34:56,398 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:34:56,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:34:56,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:34:56,399 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:34:56,399 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:34:56,399 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:34:56,399 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:34:56,399 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:34:56,400 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:34:56,400 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:34:56,400 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:34:56,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:34:56,400 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:34:56,400 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:34:56,401 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:34:56,401 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:34:56,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:34:56,401 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:34:56,401 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:34:56,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:34:56,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:34:56,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:34:56,702 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:34:56,702 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:34:56,703 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 04:34:57,708 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:34:57,921 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:34:57,921 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 04:34:57,937 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c54f131da/005cc306678f44c1a64a8f280cba9124/FLAGd289b1615 [2022-12-06 04:34:57,947 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c54f131da/005cc306678f44c1a64a8f280cba9124 [2022-12-06 04:34:57,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:34:57,949 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:34:57,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:34:57,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:34:57,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:34:57,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:34:57" (1/1) ... [2022-12-06 04:34:57,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@591a0e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:57, skipping insertion in model container [2022-12-06 04:34:57,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:34:57" (1/1) ... [2022-12-06 04:34:57,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:34:57,999 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:34:58,110 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-06 04:34:58,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:34:58,304 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:34:58,313 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-06 04:34:58,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:58,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:58,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:34:58,398 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:34:58,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:58 WrapperNode [2022-12-06 04:34:58,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:34:58,399 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:34:58,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:34:58,400 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:34:58,404 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:34:58" (1/1) ... [2022-12-06 04:34:58,417 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:34:58" (1/1) ... [2022-12-06 04:34:58,434 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-06 04:34:58,435 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:34:58,436 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:34:58,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:34:58,436 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:34:58,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:58" (1/1) ... [2022-12-06 04:34:58,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:58" (1/1) ... [2022-12-06 04:34:58,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:58" (1/1) ... [2022-12-06 04:34:58,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:58" (1/1) ... [2022-12-06 04:34:58,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:58" (1/1) ... [2022-12-06 04:34:58,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:58" (1/1) ... [2022-12-06 04:34:58,456 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:58" (1/1) ... [2022-12-06 04:34:58,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:58" (1/1) ... [2022-12-06 04:34:58,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:34:58,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:34:58,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:34:58,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:34:58,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:58" (1/1) ... [2022-12-06 04:34:58,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:34:58,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:34:58,498 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:34:58,505 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:34:58,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:34:58,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:34:58,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:34:58,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:34:58,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:34:58,526 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:34:58,526 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:34:58,526 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:34:58,526 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:34:58,527 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:34:58,527 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:34:58,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:34:58,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:34:58,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:34:58,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:34:58,528 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:34:58,690 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:34:58,691 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:34:58,977 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:34:59,128 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:34:59,128 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:34:59,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:34:59 BoogieIcfgContainer [2022-12-06 04:34:59,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:34:59,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:34:59,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:34:59,133 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:34:59,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:34:57" (1/3) ... [2022-12-06 04:34:59,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4f2457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:34:59, skipping insertion in model container [2022-12-06 04:34:59,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:58" (2/3) ... [2022-12-06 04:34:59,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4f2457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:34:59, skipping insertion in model container [2022-12-06 04:34:59,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:34:59" (3/3) ... [2022-12-06 04:34:59,135 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 04:34:59,148 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:34:59,148 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:34:59,148 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:34:59,192 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:34:59,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-06 04:34:59,264 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-06 04:34:59,264 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:34:59,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 04:34:59,268 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-06 04:34:59,272 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-06 04:34:59,273 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:34:59,287 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-06 04:34:59,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2022-12-06 04:34:59,318 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-06 04:34:59,319 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:34:59,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 04:34:59,321 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-06 04:34:59,321 INFO L188 LiptonReduction]: Number of co-enabled transitions 1876 [2022-12-06 04:35:04,004 INFO L203 LiptonReduction]: Total number of compositions: 81 [2022-12-06 04:35:04,016 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:35:04,020 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;@738a6b6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:35:04,021 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:35:04,024 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-06 04:35:04,024 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:35:04,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:04,025 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:04,025 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:35:04,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:04,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1952544839, now seen corresponding path program 1 times [2022-12-06 04:35:04,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:04,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767550766] [2022-12-06 04:35:04,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:04,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:04,306 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:35:04,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:04,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767550766] [2022-12-06 04:35:04,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767550766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:04,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:04,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:35:04,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981313490] [2022-12-06 04:35:04,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:04,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:35:04,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:04,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:35:04,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:35:04,328 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 04:35:04,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:35:04,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:04,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 04:35:04,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:04,620 INFO L130 PetriNetUnfolder]: 1331/2108 cut-off events. [2022-12-06 04:35:04,620 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-06 04:35:04,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4135 conditions, 2108 events. 1331/2108 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10145 event pairs, 287 based on Foata normal form. 0/1916 useless extension candidates. Maximal degree in co-relation 4124. Up to 1477 conditions per place. [2022-12-06 04:35:04,630 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 29 selfloop transitions, 2 changer transitions 4/36 dead transitions. [2022-12-06 04:35:04,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 151 flow [2022-12-06 04:35:04,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:35:04,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:35:04,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 04:35:04,638 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2022-12-06 04:35:04,639 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 43 transitions. [2022-12-06 04:35:04,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 151 flow [2022-12-06 04:35:04,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 148 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:35:04,643 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2022-12-06 04:35:04,644 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-12-06 04:35:04,646 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-06 04:35:04,647 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:04,647 INFO L89 Accepts]: Start accepts. Operand has 32 places, 21 transitions, 52 flow [2022-12-06 04:35:04,649 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:04,649 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:04,649 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 52 flow [2022-12-06 04:35:04,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 52 flow [2022-12-06 04:35:04,654 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 04:35:04,654 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:35:04,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:35:04,654 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 52 flow [2022-12-06 04:35:04,654 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 04:35:04,811 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:35:04,813 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 04:35:04,813 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 52 flow [2022-12-06 04:35:04,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:35:04,813 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:04,813 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:04,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:35:04,814 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:35:04,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:04,814 INFO L85 PathProgramCache]: Analyzing trace with hash 505152948, now seen corresponding path program 1 times [2022-12-06 04:35:04,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:04,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200670171] [2022-12-06 04:35:04,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:04,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:04,997 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:35:04,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:04,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200670171] [2022-12-06 04:35:04,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200670171] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:04,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:04,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:35:04,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061743651] [2022-12-06 04:35:04,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:04,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:35:04,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:04,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:35:05,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:35:05,000 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 04:35:05,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 52 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:35:05,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:05,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 04:35:05,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:05,156 INFO L130 PetriNetUnfolder]: 763/1180 cut-off events. [2022-12-06 04:35:05,156 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-12-06 04:35:05,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2482 conditions, 1180 events. 763/1180 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4956 event pairs, 337 based on Foata normal form. 48/1216 useless extension candidates. Maximal degree in co-relation 2472. Up to 675 conditions per place. [2022-12-06 04:35:05,162 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 28 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2022-12-06 04:35:05,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 136 flow [2022-12-06 04:35:05,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:35:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:35:05,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 04:35:05,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2022-12-06 04:35:05,164 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 52 flow. Second operand 3 states and 34 transitions. [2022-12-06 04:35:05,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 136 flow [2022-12-06 04:35:05,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 31 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:35:05,165 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 56 flow [2022-12-06 04:35:05,165 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-06 04:35:05,166 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -4 predicate places. [2022-12-06 04:35:05,166 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:05,166 INFO L89 Accepts]: Start accepts. Operand has 31 places, 21 transitions, 56 flow [2022-12-06 04:35:05,167 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:05,167 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:05,167 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 21 transitions, 56 flow [2022-12-06 04:35:05,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 56 flow [2022-12-06 04:35:05,170 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 04:35:05,171 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:35:05,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:35:05,171 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 56 flow [2022-12-06 04:35:05,171 INFO L188 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-06 04:35:05,233 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:35:05,234 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-06 04:35:05,234 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2022-12-06 04:35:05,234 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:35:05,234 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:05,234 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:05,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:35:05,235 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:35:05,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:05,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1262713681, now seen corresponding path program 1 times [2022-12-06 04:35:05,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:05,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7344024] [2022-12-06 04:35:05,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:05,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:05,457 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:35:05,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:05,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7344024] [2022-12-06 04:35:05,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7344024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:05,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:05,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:35:05,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462148120] [2022-12-06 04:35:05,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:05,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:35:05,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:05,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:35:05,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:35:05,459 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 04:35:05,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 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:35:05,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:05,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 04:35:05,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:05,628 INFO L130 PetriNetUnfolder]: 938/1409 cut-off events. [2022-12-06 04:35:05,628 INFO L131 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-12-06 04:35:05,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3071 conditions, 1409 events. 938/1409 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5750 event pairs, 218 based on Foata normal form. 6/1415 useless extension candidates. Maximal degree in co-relation 3060. Up to 1312 conditions per place. [2022-12-06 04:35:05,635 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 32 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2022-12-06 04:35:05,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 35 transitions, 161 flow [2022-12-06 04:35:05,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:35:05,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:35:05,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 04:35:05,637 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-06 04:35:05,637 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 3 states and 36 transitions. [2022-12-06 04:35:05,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 35 transitions, 161 flow [2022-12-06 04:35:05,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 155 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:35:05,638 INFO L231 Difference]: Finished difference. Result has 32 places, 23 transitions, 71 flow [2022-12-06 04:35:05,638 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2022-12-06 04:35:05,639 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-06 04:35:05,639 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:05,639 INFO L89 Accepts]: Start accepts. Operand has 32 places, 23 transitions, 71 flow [2022-12-06 04:35:05,639 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:05,640 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:05,640 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 23 transitions, 71 flow [2022-12-06 04:35:05,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 23 transitions, 71 flow [2022-12-06 04:35:05,644 INFO L130 PetriNetUnfolder]: 3/31 cut-off events. [2022-12-06 04:35:05,644 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 04:35:05,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 31 events. 3/31 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 61 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 48. Up to 10 conditions per place. [2022-12-06 04:35:05,645 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 23 transitions, 71 flow [2022-12-06 04:35:05,645 INFO L188 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-06 04:35:05,753 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:35:05,755 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-06 04:35:05,755 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 71 flow [2022-12-06 04:35:05,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 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:35:05,755 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:05,755 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:05,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:35:05,755 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:35:05,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:05,756 INFO L85 PathProgramCache]: Analyzing trace with hash -555756370, now seen corresponding path program 1 times [2022-12-06 04:35:05,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:05,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465750957] [2022-12-06 04:35:05,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:05,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:06,438 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:35:06,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:06,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465750957] [2022-12-06 04:35:06,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465750957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:06,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:06,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:35:06,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147156637] [2022-12-06 04:35:06,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:06,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:35:06,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:06,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:35:06,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:35:06,442 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 04:35:06,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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:35:06,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:06,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 04:35:06,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:06,634 INFO L130 PetriNetUnfolder]: 818/1292 cut-off events. [2022-12-06 04:35:06,634 INFO L131 PetriNetUnfolder]: For 269/269 co-relation queries the response was YES. [2022-12-06 04:35:06,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2993 conditions, 1292 events. 818/1292 cut-off events. For 269/269 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5619 event pairs, 111 based on Foata normal form. 3/1293 useless extension candidates. Maximal degree in co-relation 2981. Up to 881 conditions per place. [2022-12-06 04:35:06,641 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 37 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2022-12-06 04:35:06,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 46 transitions, 220 flow [2022-12-06 04:35:06,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:35:06,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:35:06,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 04:35:06,642 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-06 04:35:06,642 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 71 flow. Second operand 4 states and 48 transitions. [2022-12-06 04:35:06,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 46 transitions, 220 flow [2022-12-06 04:35:06,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 46 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:35:06,644 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 114 flow [2022-12-06 04:35:06,644 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2022-12-06 04:35:06,644 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2022-12-06 04:35:06,644 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:06,645 INFO L89 Accepts]: Start accepts. Operand has 36 places, 28 transitions, 114 flow [2022-12-06 04:35:06,645 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:06,645 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:06,645 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 28 transitions, 114 flow [2022-12-06 04:35:06,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 28 transitions, 114 flow [2022-12-06 04:35:06,656 INFO L130 PetriNetUnfolder]: 29/103 cut-off events. [2022-12-06 04:35:06,656 INFO L131 PetriNetUnfolder]: For 42/46 co-relation queries the response was YES. [2022-12-06 04:35:06,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 103 events. 29/103 cut-off events. For 42/46 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 409 event pairs, 11 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 215. Up to 41 conditions per place. [2022-12-06 04:35:06,657 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 28 transitions, 114 flow [2022-12-06 04:35:06,657 INFO L188 LiptonReduction]: Number of co-enabled transitions 262 [2022-12-06 04:35:06,683 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:35:06,684 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 04:35:06,684 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 114 flow [2022-12-06 04:35:06,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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:35:06,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:06,684 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:06,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:35:06,684 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:35:06,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:06,685 INFO L85 PathProgramCache]: Analyzing trace with hash -321773638, now seen corresponding path program 1 times [2022-12-06 04:35:06,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:06,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097233479] [2022-12-06 04:35:06,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:06,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:07,521 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:35:07,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:07,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097233479] [2022-12-06 04:35:07,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097233479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:07,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:07,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:35:07,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936126316] [2022-12-06 04:35:07,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:07,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:35:07,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:07,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:35:07,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:35:07,524 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 04:35:07,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 114 flow. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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:35:07,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:07,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 04:35:07,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:08,033 INFO L130 PetriNetUnfolder]: 1394/2230 cut-off events. [2022-12-06 04:35:08,034 INFO L131 PetriNetUnfolder]: For 1086/1086 co-relation queries the response was YES. [2022-12-06 04:35:08,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5815 conditions, 2230 events. 1394/2230 cut-off events. For 1086/1086 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11456 event pairs, 56 based on Foata normal form. 36/2251 useless extension candidates. Maximal degree in co-relation 5800. Up to 1066 conditions per place. [2022-12-06 04:35:08,045 INFO L137 encePairwiseOnDemand]: 11/21 looper letters, 50 selfloop transitions, 17 changer transitions 18/87 dead transitions. [2022-12-06 04:35:08,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 87 transitions, 474 flow [2022-12-06 04:35:08,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:35:08,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:35:08,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-12-06 04:35:08,047 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 04:35:08,047 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 114 flow. Second operand 8 states and 88 transitions. [2022-12-06 04:35:08,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 87 transitions, 474 flow [2022-12-06 04:35:08,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 87 transitions, 467 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:35:08,052 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 248 flow [2022-12-06 04:35:08,052 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=248, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2022-12-06 04:35:08,053 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 13 predicate places. [2022-12-06 04:35:08,053 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:08,053 INFO L89 Accepts]: Start accepts. Operand has 48 places, 41 transitions, 248 flow [2022-12-06 04:35:08,055 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:08,055 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:08,055 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 41 transitions, 248 flow [2022-12-06 04:35:08,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 41 transitions, 248 flow [2022-12-06 04:35:08,106 INFO L130 PetriNetUnfolder]: 164/400 cut-off events. [2022-12-06 04:35:08,106 INFO L131 PetriNetUnfolder]: For 513/541 co-relation queries the response was YES. [2022-12-06 04:35:08,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1249 conditions, 400 events. 164/400 cut-off events. For 513/541 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2317 event pairs, 61 based on Foata normal form. 8/388 useless extension candidates. Maximal degree in co-relation 1230. Up to 182 conditions per place. [2022-12-06 04:35:08,111 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 41 transitions, 248 flow [2022-12-06 04:35:08,111 INFO L188 LiptonReduction]: Number of co-enabled transitions 338 [2022-12-06 04:35:08,114 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:35:08,115 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-06 04:35:08,115 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 248 flow [2022-12-06 04:35:08,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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:35:08,115 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:08,115 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:08,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:35:08,116 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:35:08,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:08,116 INFO L85 PathProgramCache]: Analyzing trace with hash 250494746, now seen corresponding path program 1 times [2022-12-06 04:35:08,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:08,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529166312] [2022-12-06 04:35:08,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:08,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:08,826 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:35:08,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:08,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529166312] [2022-12-06 04:35:08,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529166312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:08,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:08,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:35:08,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353699452] [2022-12-06 04:35:08,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:08,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:35:08,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:08,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:35:08,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:35:08,828 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 04:35:08,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 248 flow. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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:35:08,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:08,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 04:35:08,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:09,182 INFO L130 PetriNetUnfolder]: 1317/2117 cut-off events. [2022-12-06 04:35:09,183 INFO L131 PetriNetUnfolder]: For 4053/4053 co-relation queries the response was YES. [2022-12-06 04:35:09,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7448 conditions, 2117 events. 1317/2117 cut-off events. For 4053/4053 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 10682 event pairs, 273 based on Foata normal form. 6/2108 useless extension candidates. Maximal degree in co-relation 7426. Up to 1595 conditions per place. [2022-12-06 04:35:09,198 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 41 selfloop transitions, 10 changer transitions 3/56 dead transitions. [2022-12-06 04:35:09,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 56 transitions, 420 flow [2022-12-06 04:35:09,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:35:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:35:09,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 04:35:09,200 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 04:35:09,200 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 248 flow. Second operand 4 states and 44 transitions. [2022-12-06 04:35:09,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 56 transitions, 420 flow [2022-12-06 04:35:09,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 56 transitions, 416 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-06 04:35:09,209 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 288 flow [2022-12-06 04:35:09,209 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2022-12-06 04:35:09,211 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places. [2022-12-06 04:35:09,211 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:09,211 INFO L89 Accepts]: Start accepts. Operand has 53 places, 42 transitions, 288 flow [2022-12-06 04:35:09,212 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:09,212 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:09,212 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 42 transitions, 288 flow [2022-12-06 04:35:09,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 288 flow [2022-12-06 04:35:09,256 INFO L130 PetriNetUnfolder]: 163/400 cut-off events. [2022-12-06 04:35:09,256 INFO L131 PetriNetUnfolder]: For 784/822 co-relation queries the response was YES. [2022-12-06 04:35:09,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1343 conditions, 400 events. 163/400 cut-off events. For 784/822 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2343 event pairs, 31 based on Foata normal form. 8/393 useless extension candidates. Maximal degree in co-relation 1320. Up to 189 conditions per place. [2022-12-06 04:35:09,260 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 42 transitions, 288 flow [2022-12-06 04:35:09,260 INFO L188 LiptonReduction]: Number of co-enabled transitions 330 [2022-12-06 04:35:09,263 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:35:09,264 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-06 04:35:09,264 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 288 flow [2022-12-06 04:35:09,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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:35:09,265 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:09,265 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:09,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:35:09,265 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:35:09,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:09,268 INFO L85 PathProgramCache]: Analyzing trace with hash 405272287, now seen corresponding path program 1 times [2022-12-06 04:35:09,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:09,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374877618] [2022-12-06 04:35:09,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:09,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:09,903 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:35:09,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:09,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374877618] [2022-12-06 04:35:09,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374877618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:09,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:09,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:35:09,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266784540] [2022-12-06 04:35:09,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:09,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:35:09,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:09,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:35:09,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:35:09,905 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 04:35:09,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 288 flow. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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:35:09,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:09,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 04:35:09,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:10,225 INFO L130 PetriNetUnfolder]: 1163/1847 cut-off events. [2022-12-06 04:35:10,225 INFO L131 PetriNetUnfolder]: For 4863/4863 co-relation queries the response was YES. [2022-12-06 04:35:10,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6951 conditions, 1847 events. 1163/1847 cut-off events. For 4863/4863 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8997 event pairs, 194 based on Foata normal form. 21/1857 useless extension candidates. Maximal degree in co-relation 6925. Up to 1318 conditions per place. [2022-12-06 04:35:10,239 INFO L137 encePairwiseOnDemand]: 11/21 looper letters, 38 selfloop transitions, 19 changer transitions 3/62 dead transitions. [2022-12-06 04:35:10,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 62 transitions, 488 flow [2022-12-06 04:35:10,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:35:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:35:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 04:35:10,241 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 04:35:10,241 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 288 flow. Second operand 5 states and 55 transitions. [2022-12-06 04:35:10,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 62 transitions, 488 flow [2022-12-06 04:35:10,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 62 transitions, 468 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 04:35:10,248 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 338 flow [2022-12-06 04:35:10,248 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=338, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2022-12-06 04:35:10,249 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 20 predicate places. [2022-12-06 04:35:10,249 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:10,249 INFO L89 Accepts]: Start accepts. Operand has 55 places, 43 transitions, 338 flow [2022-12-06 04:35:10,249 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:10,250 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:10,250 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 43 transitions, 338 flow [2022-12-06 04:35:10,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 338 flow [2022-12-06 04:35:10,284 INFO L130 PetriNetUnfolder]: 159/342 cut-off events. [2022-12-06 04:35:10,284 INFO L131 PetriNetUnfolder]: For 960/977 co-relation queries the response was YES. [2022-12-06 04:35:10,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1374 conditions, 342 events. 159/342 cut-off events. For 960/977 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1753 event pairs, 20 based on Foata normal form. 6/336 useless extension candidates. Maximal degree in co-relation 1350. Up to 168 conditions per place. [2022-12-06 04:35:10,287 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 43 transitions, 338 flow [2022-12-06 04:35:10,288 INFO L188 LiptonReduction]: Number of co-enabled transitions 330 [2022-12-06 04:35:10,289 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:35:10,290 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-06 04:35:10,290 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 338 flow [2022-12-06 04:35:10,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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:35:10,290 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:10,290 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:10,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:35:10,291 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:35:10,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:10,291 INFO L85 PathProgramCache]: Analyzing trace with hash 405342967, now seen corresponding path program 2 times [2022-12-06 04:35:10,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:10,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276081869] [2022-12-06 04:35:10,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:10,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:10,864 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:35:10,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:10,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276081869] [2022-12-06 04:35:10,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276081869] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:10,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:10,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:35:10,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655624298] [2022-12-06 04:35:10,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:10,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:35:10,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:10,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:35:10,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:35:10,866 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 04:35:10,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 338 flow. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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:35:10,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:10,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 04:35:10,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:11,163 INFO L130 PetriNetUnfolder]: 1054/1664 cut-off events. [2022-12-06 04:35:11,163 INFO L131 PetriNetUnfolder]: For 5721/5733 co-relation queries the response was YES. [2022-12-06 04:35:11,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7059 conditions, 1664 events. 1054/1664 cut-off events. For 5721/5733 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7837 event pairs, 158 based on Foata normal form. 15/1670 useless extension candidates. Maximal degree in co-relation 7032. Up to 1055 conditions per place. [2022-12-06 04:35:11,180 INFO L137 encePairwiseOnDemand]: 11/21 looper letters, 43 selfloop transitions, 21 changer transitions 0/66 dead transitions. [2022-12-06 04:35:11,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 66 transitions, 581 flow [2022-12-06 04:35:11,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:35:11,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:35:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 04:35:11,183 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 04:35:11,183 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 338 flow. Second operand 5 states and 55 transitions. [2022-12-06 04:35:11,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 66 transitions, 581 flow [2022-12-06 04:35:11,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 66 transitions, 543 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 04:35:11,193 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 411 flow [2022-12-06 04:35:11,193 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=411, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2022-12-06 04:35:11,195 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 19 predicate places. [2022-12-06 04:35:11,195 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:11,196 INFO L89 Accepts]: Start accepts. Operand has 54 places, 48 transitions, 411 flow [2022-12-06 04:35:11,198 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:11,198 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:11,198 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 48 transitions, 411 flow [2022-12-06 04:35:11,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 48 transitions, 411 flow [2022-12-06 04:35:11,234 INFO L130 PetriNetUnfolder]: 173/368 cut-off events. [2022-12-06 04:35:11,235 INFO L131 PetriNetUnfolder]: For 1266/1291 co-relation queries the response was YES. [2022-12-06 04:35:11,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1652 conditions, 368 events. 173/368 cut-off events. For 1266/1291 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1963 event pairs, 28 based on Foata normal form. 14/371 useless extension candidates. Maximal degree in co-relation 1628. Up to 185 conditions per place. [2022-12-06 04:35:11,238 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 48 transitions, 411 flow [2022-12-06 04:35:11,239 INFO L188 LiptonReduction]: Number of co-enabled transitions 370 [2022-12-06 04:35:11,243 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:35:11,244 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 04:35:11,244 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 411 flow [2022-12-06 04:35:11,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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:35:11,245 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:11,245 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:11,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:35:11,245 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:35:11,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:11,245 INFO L85 PathProgramCache]: Analyzing trace with hash 404628727, now seen corresponding path program 3 times [2022-12-06 04:35:11,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:11,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578253613] [2022-12-06 04:35:11,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:11,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:11,624 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:35:11,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:11,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578253613] [2022-12-06 04:35:11,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578253613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:11,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:11,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:35:11,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715212852] [2022-12-06 04:35:11,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:11,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:35:11,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:11,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:35:11,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:35:11,626 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 04:35:11,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 411 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:35:11,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:11,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 04:35:11,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:11,912 INFO L130 PetriNetUnfolder]: 1180/1855 cut-off events. [2022-12-06 04:35:11,912 INFO L131 PetriNetUnfolder]: For 7628/7640 co-relation queries the response was YES. [2022-12-06 04:35:11,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8485 conditions, 1855 events. 1180/1855 cut-off events. For 7628/7640 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8930 event pairs, 102 based on Foata normal form. 15/1862 useless extension candidates. Maximal degree in co-relation 8458. Up to 1151 conditions per place. [2022-12-06 04:35:11,935 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 53 selfloop transitions, 21 changer transitions 0/76 dead transitions. [2022-12-06 04:35:11,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 76 transitions, 739 flow [2022-12-06 04:35:11,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:35:11,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:35:11,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-12-06 04:35:11,938 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4365079365079365 [2022-12-06 04:35:11,938 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 411 flow. Second operand 6 states and 55 transitions. [2022-12-06 04:35:11,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 76 transitions, 739 flow [2022-12-06 04:35:11,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 76 transitions, 707 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-06 04:35:11,947 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 566 flow [2022-12-06 04:35:11,947 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=566, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2022-12-06 04:35:11,948 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 23 predicate places. [2022-12-06 04:35:11,948 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:11,948 INFO L89 Accepts]: Start accepts. Operand has 58 places, 57 transitions, 566 flow [2022-12-06 04:35:11,950 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:11,950 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:11,950 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 57 transitions, 566 flow [2022-12-06 04:35:11,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 57 transitions, 566 flow [2022-12-06 04:35:11,997 INFO L130 PetriNetUnfolder]: 182/392 cut-off events. [2022-12-06 04:35:11,997 INFO L131 PetriNetUnfolder]: For 2022/2048 co-relation queries the response was YES. [2022-12-06 04:35:11,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1985 conditions, 392 events. 182/392 cut-off events. For 2022/2048 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2140 event pairs, 34 based on Foata normal form. 17/399 useless extension candidates. Maximal degree in co-relation 1959. Up to 195 conditions per place. [2022-12-06 04:35:12,002 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 57 transitions, 566 flow [2022-12-06 04:35:12,002 INFO L188 LiptonReduction]: Number of co-enabled transitions 426 [2022-12-06 04:35:12,028 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] L780-->L796: Formula: (let ((.cse1 (= (mod v_~x$r_buff1_thd2~0_70 256) 0)) (.cse7 (= (mod v_~x$r_buff0_thd2~0_76 256) 0))) (let ((.cse8 (not .cse7)) (.cse5 (and (= (mod v_~x$w_buff1_used~0_185 256) 0) .cse7)) (.cse6 (and .cse1 .cse7)) (.cse12 (= (mod v_~x$w_buff0_used~0_204 256) 0))) (let ((.cse9 (or .cse5 .cse6 .cse12)) (.cse10 (and .cse8 (not .cse12)))) (let ((.cse4 (= (mod v_~x$w_buff1_used~0_184 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_203 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_92 256) 0))) (.cse11 (ite .cse9 v_~x~0_154 (ite .cse10 v_~x$w_buff0~0_122 v_~x$w_buff1~0_119)))) (and (= v_~x$w_buff1~0_119 v_~x$w_buff1~0_118) (= (ite .cse0 v_~x$r_buff1_thd2~0_70 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd2~0_75 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~x$r_buff1_thd2~0_70 0)) v_~x$r_buff1_thd2~0_69) (= v_~weak$$choice0~0_17 |v_P1Thread1of1ForFork0_#t~nondet5_1|) (= (ite .cse0 v_~x$w_buff1_used~0_185 (ite (or .cse5 .cse6 .cse3) v_~x$w_buff1_used~0_185 0)) v_~x$w_buff1_used~0_184) (= v_~x$r_buff0_thd2~0_75 (ite .cse0 v_~x$r_buff0_thd2~0_76 (ite (or (and .cse4 .cse7) .cse6 .cse3) v_~x$r_buff0_thd2~0_76 (ite (and .cse8 (not .cse3)) 0 v_~x$r_buff0_thd2~0_76)))) (= v_~weak$$choice2~0_92 |v_P1Thread1of1ForFork0_#t~nondet6_1|) (= (ite .cse0 v_~x$w_buff0_used~0_204 (ite .cse9 v_~x$w_buff0_used~0_204 (ite .cse10 0 v_~x$w_buff0_used~0_204))) v_~x$w_buff0_used~0_203) (= v_~x$w_buff0~0_122 v_~x$w_buff0~0_121) (= (ite .cse0 v_~x$mem_tmp~0_46 .cse11) v_~x~0_153) (= v_~__unbuffered_p1_EAX~0_16 .cse11) (= v_~x$flush_delayed~0_57 0) (= v_~x$mem_tmp~0_46 v_~x~0_154)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_122, P1Thread1of1ForFork0_#t~nondet6=|v_P1Thread1of1ForFork0_#t~nondet6_1|, P1Thread1of1ForFork0_#t~nondet5=|v_P1Thread1of1ForFork0_#t~nondet5_1|, ~x$w_buff1~0=v_~x$w_buff1~0_119, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_70, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_185, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_76, ~x~0=v_~x~0_154, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_204} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$flush_delayed~0=v_~x$flush_delayed~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_118, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_69, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_184, ~x$mem_tmp~0=v_~x$mem_tmp~0_46, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203, ~weak$$choice0~0=v_~weak$$choice0~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~x~0=v_~x~0_153} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, P1Thread1of1ForFork0_#t~nondet6, P1Thread1of1ForFork0_#t~nondet5, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$mem_tmp~0, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p1_EAX~0, ~weak$$choice2~0, ~x~0] and [441] $Ultimate##0-->L822: Formula: (and (= v_~x$r_buff0_thd2~0_109 v_~x$r_buff1_thd2~0_101) (= v_~x$w_buff0_used~0_270 v_~x$w_buff1_used~0_237) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_19| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_19|) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_7| |v_P2Thread1of1ForFork1_~arg#1.offset_7|) (= v_~x$r_buff1_thd0~0_63 v_~x$r_buff0_thd0~0_67) (= v_~x$r_buff0_thd3~0_48 1) (= 2 v_~x$w_buff0~0_183) (= v_~x$r_buff1_thd1~0_59 v_~x$r_buff0_thd1~0_55) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_19| 0)) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_269 256) 0)) (not (= (mod v_~x$w_buff1_used~0_237 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_19|) (= v_~x$w_buff0_used~0_269 1) (= |v_P2Thread1of1ForFork1_#in~arg#1.base_7| |v_P2Thread1of1ForFork1_~arg#1.base_7|) (= v_~x$r_buff1_thd3~0_35 v_~x$r_buff0_thd3~0_49) (= v_~x$w_buff0~0_184 v_~x$w_buff1~0_165)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_184, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_55, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_49, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_109, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_270} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_183, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_55, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_165, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_35, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_101, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_237, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_59, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_48, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_109, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_63, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_269, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_7|, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_19|, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_19|} AuxVars[] AssignedVars[~x$w_buff0~0, P2Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] [2022-12-06 04:35:12,318 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:35:12,319 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 371 [2022-12-06 04:35:12,319 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 571 flow [2022-12-06 04:35:12,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:35:12,319 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:12,319 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:12,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:35:12,320 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:35:12,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:12,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2120652501, now seen corresponding path program 1 times [2022-12-06 04:35:12,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:12,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418435220] [2022-12-06 04:35:12,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:12,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:13,345 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:35:13,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:13,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418435220] [2022-12-06 04:35:13,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418435220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:13,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:13,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:35:13,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272454620] [2022-12-06 04:35:13,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:13,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:35:13,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:13,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:35:13,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:35:13,347 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 04:35:13,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 571 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:35:13,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:13,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 04:35:13,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:13,771 INFO L130 PetriNetUnfolder]: 1310/2045 cut-off events. [2022-12-06 04:35:13,771 INFO L131 PetriNetUnfolder]: For 12017/12029 co-relation queries the response was YES. [2022-12-06 04:35:13,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10371 conditions, 2045 events. 1310/2045 cut-off events. For 12017/12029 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 10004 event pairs, 209 based on Foata normal form. 32/2069 useless extension candidates. Maximal degree in co-relation 10342. Up to 1327 conditions per place. [2022-12-06 04:35:13,788 INFO L137 encePairwiseOnDemand]: 11/22 looper letters, 50 selfloop transitions, 29 changer transitions 0/81 dead transitions. [2022-12-06 04:35:13,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 81 transitions, 887 flow [2022-12-06 04:35:13,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:35:13,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:35:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-12-06 04:35:13,790 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2022-12-06 04:35:13,790 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 571 flow. Second operand 5 states and 60 transitions. [2022-12-06 04:35:13,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 81 transitions, 887 flow [2022-12-06 04:35:13,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 81 transitions, 869 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 04:35:13,804 INFO L231 Difference]: Finished difference. Result has 62 places, 64 transitions, 743 flow [2022-12-06 04:35:13,805 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=743, PETRI_PLACES=62, PETRI_TRANSITIONS=64} [2022-12-06 04:35:13,805 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 27 predicate places. [2022-12-06 04:35:13,805 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:13,805 INFO L89 Accepts]: Start accepts. Operand has 62 places, 64 transitions, 743 flow [2022-12-06 04:35:13,806 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:13,806 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:13,807 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 64 transitions, 743 flow [2022-12-06 04:35:13,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 64 transitions, 743 flow [2022-12-06 04:35:13,878 INFO L130 PetriNetUnfolder]: 204/430 cut-off events. [2022-12-06 04:35:13,878 INFO L131 PetriNetUnfolder]: For 2780/2798 co-relation queries the response was YES. [2022-12-06 04:35:13,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2532 conditions, 430 events. 204/430 cut-off events. For 2780/2798 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2384 event pairs, 27 based on Foata normal form. 9/422 useless extension candidates. Maximal degree in co-relation 2504. Up to 223 conditions per place. [2022-12-06 04:35:13,883 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 64 transitions, 743 flow [2022-12-06 04:35:13,883 INFO L188 LiptonReduction]: Number of co-enabled transitions 484 [2022-12-06 04:35:13,885 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:35:13,886 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 04:35:13,886 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 64 transitions, 743 flow [2022-12-06 04:35:13,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:35:13,886 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:13,886 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:13,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:35:13,887 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:35:13,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:13,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2124602211, now seen corresponding path program 2 times [2022-12-06 04:35:13,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:13,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384421508] [2022-12-06 04:35:13,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:13,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:14,702 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:35:14,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:14,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384421508] [2022-12-06 04:35:14,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384421508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:14,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:14,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:35:14,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608467731] [2022-12-06 04:35:14,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:14,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:35:14,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:14,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:35:14,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:35:14,704 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 04:35:14,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 64 transitions, 743 flow. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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:35:14,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:14,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 04:35:14,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:15,134 INFO L130 PetriNetUnfolder]: 1416/2236 cut-off events. [2022-12-06 04:35:15,134 INFO L131 PetriNetUnfolder]: For 16226/16238 co-relation queries the response was YES. [2022-12-06 04:35:15,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12449 conditions, 2236 events. 1416/2236 cut-off events. For 16226/16238 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 11405 event pairs, 105 based on Foata normal form. 10/2240 useless extension candidates. Maximal degree in co-relation 12418. Up to 1232 conditions per place. [2022-12-06 04:35:15,151 INFO L137 encePairwiseOnDemand]: 11/22 looper letters, 61 selfloop transitions, 59 changer transitions 0/122 dead transitions. [2022-12-06 04:35:15,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 122 transitions, 1541 flow [2022-12-06 04:35:15,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:35:15,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:35:15,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-12-06 04:35:15,153 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5194805194805194 [2022-12-06 04:35:15,153 INFO L175 Difference]: Start difference. First operand has 62 places, 64 transitions, 743 flow. Second operand 7 states and 80 transitions. [2022-12-06 04:35:15,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 122 transitions, 1541 flow [2022-12-06 04:35:15,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 122 transitions, 1510 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-06 04:35:15,182 INFO L231 Difference]: Finished difference. Result has 70 places, 95 transitions, 1390 flow [2022-12-06 04:35:15,182 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1390, PETRI_PLACES=70, PETRI_TRANSITIONS=95} [2022-12-06 04:35:15,182 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 35 predicate places. [2022-12-06 04:35:15,182 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:15,182 INFO L89 Accepts]: Start accepts. Operand has 70 places, 95 transitions, 1390 flow [2022-12-06 04:35:15,184 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:15,184 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:15,184 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 95 transitions, 1390 flow [2022-12-06 04:35:15,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 95 transitions, 1390 flow [2022-12-06 04:35:15,240 INFO L130 PetriNetUnfolder]: 230/486 cut-off events. [2022-12-06 04:35:15,240 INFO L131 PetriNetUnfolder]: For 4289/4326 co-relation queries the response was YES. [2022-12-06 04:35:15,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3356 conditions, 486 events. 230/486 cut-off events. For 4289/4326 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 2770 event pairs, 5 based on Foata normal form. 22/492 useless extension candidates. Maximal degree in co-relation 3324. Up to 259 conditions per place. [2022-12-06 04:35:15,254 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 95 transitions, 1390 flow [2022-12-06 04:35:15,255 INFO L188 LiptonReduction]: Number of co-enabled transitions 646 [2022-12-06 04:35:15,731 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:35:15,732 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 550 [2022-12-06 04:35:15,732 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 96 transitions, 1420 flow [2022-12-06 04:35:15,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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:35:15,733 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:15,733 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:15,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:35:15,733 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:35:15,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:15,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1688095721, now seen corresponding path program 1 times [2022-12-06 04:35:15,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:15,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387412094] [2022-12-06 04:35:15,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:15,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:16,262 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:35:16,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:16,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387412094] [2022-12-06 04:35:16,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387412094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:16,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:16,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:35:16,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630899450] [2022-12-06 04:35:16,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:16,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:35:16,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:16,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:35:16,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:35:16,265 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 04:35:16,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 96 transitions, 1420 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:35:16,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:16,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 04:35:16,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:16,757 INFO L130 PetriNetUnfolder]: 1590/2529 cut-off events. [2022-12-06 04:35:16,757 INFO L131 PetriNetUnfolder]: For 25406/25410 co-relation queries the response was YES. [2022-12-06 04:35:16,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15879 conditions, 2529 events. 1590/2529 cut-off events. For 25406/25410 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 13454 event pairs, 265 based on Foata normal form. 24/2541 useless extension candidates. Maximal degree in co-relation 15844. Up to 1701 conditions per place. [2022-12-06 04:35:16,776 INFO L137 encePairwiseOnDemand]: 14/23 looper letters, 124 selfloop transitions, 42 changer transitions 10/178 dead transitions. [2022-12-06 04:35:16,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 178 transitions, 2764 flow [2022-12-06 04:35:16,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:35:16,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:35:16,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-12-06 04:35:16,777 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2022-12-06 04:35:16,777 INFO L175 Difference]: Start difference. First operand has 71 places, 96 transitions, 1420 flow. Second operand 8 states and 80 transitions. [2022-12-06 04:35:16,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 178 transitions, 2764 flow [2022-12-06 04:35:16,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 178 transitions, 2685 flow, removed 35 selfloop flow, removed 1 redundant places. [2022-12-06 04:35:16,819 INFO L231 Difference]: Finished difference. Result has 82 places, 117 transitions, 1918 flow [2022-12-06 04:35:16,819 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=1371, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1918, PETRI_PLACES=82, PETRI_TRANSITIONS=117} [2022-12-06 04:35:16,819 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 47 predicate places. [2022-12-06 04:35:16,820 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:16,820 INFO L89 Accepts]: Start accepts. Operand has 82 places, 117 transitions, 1918 flow [2022-12-06 04:35:16,820 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:16,820 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:16,821 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 117 transitions, 1918 flow [2022-12-06 04:35:16,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 117 transitions, 1918 flow [2022-12-06 04:35:16,878 INFO L130 PetriNetUnfolder]: 211/473 cut-off events. [2022-12-06 04:35:16,878 INFO L131 PetriNetUnfolder]: For 5220/5251 co-relation queries the response was YES. [2022-12-06 04:35:16,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3480 conditions, 473 events. 211/473 cut-off events. For 5220/5251 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 2782 event pairs, 2 based on Foata normal form. 18/472 useless extension candidates. Maximal degree in co-relation 3442. Up to 261 conditions per place. [2022-12-06 04:35:16,884 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 117 transitions, 1918 flow [2022-12-06 04:35:16,884 INFO L188 LiptonReduction]: Number of co-enabled transitions 714 [2022-12-06 04:35:16,920 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [365] L859-->L865: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_171 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_50 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd0~0_44 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff1_used~0_155 256) 0)) .cse2)) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_172 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_154 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_155)) (= v_~x$r_buff1_thd0~0_43 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_154 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd0~0_49 256) 0)) .cse3)) 0 v_~x$r_buff1_thd0~0_44)) (= (ite .cse4 v_~x$w_buff0~0_95 (ite .cse0 v_~x$w_buff1~0_94 v_~x~0_128)) v_~x~0_127) (= (ite .cse1 0 v_~x$r_buff0_thd0~0_50) v_~x$r_buff0_thd0~0_49) (= v_~x$w_buff0_used~0_171 (ite .cse4 0 v_~x$w_buff0_used~0_172))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_94, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_44, ~x~0=v_~x~0_128, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_94, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_43, ~x~0=v_~x~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_171} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [390] L796-->L803: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd2~0_64 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_163 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd2~0_58 256) 0)))) (let ((.cse3 (and .cse0 (not (= 0 (mod v_~x$w_buff1_used~0_147 256))))) (.cse4 (and .cse5 .cse1)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_164 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_57 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_146 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd2~0_63 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_58)) (= (ite .cse2 v_~x$w_buff0~0_89 (ite .cse3 v_~x$w_buff1~0_88 v_~x~0_118)) v_~x~0_117) (= (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_147) v_~x$w_buff1_used~0_146) (= v_~x$r_buff0_thd2~0_63 (ite .cse4 0 v_~x$r_buff0_thd2~0_64)) (= (ite .cse2 0 v_~x$w_buff0_used~0_164) v_~x$w_buff0_used~0_163)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_89, ~x$w_buff1~0=v_~x$w_buff1~0_88, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_58, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_147, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_64, ~x~0=v_~x~0_118, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_164} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_89, ~x$w_buff1~0=v_~x$w_buff1~0_88, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_146, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_63, ~x~0=v_~x~0_117, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_163} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 04:35:17,043 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [365] L859-->L865: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_171 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_50 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd0~0_44 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff1_used~0_155 256) 0)) .cse2)) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_172 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_154 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_155)) (= v_~x$r_buff1_thd0~0_43 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_154 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd0~0_49 256) 0)) .cse3)) 0 v_~x$r_buff1_thd0~0_44)) (= (ite .cse4 v_~x$w_buff0~0_95 (ite .cse0 v_~x$w_buff1~0_94 v_~x~0_128)) v_~x~0_127) (= (ite .cse1 0 v_~x$r_buff0_thd0~0_50) v_~x$r_buff0_thd0~0_49) (= v_~x$w_buff0_used~0_171 (ite .cse4 0 v_~x$w_buff0_used~0_172))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_94, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_44, ~x~0=v_~x~0_128, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_94, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_43, ~x~0=v_~x~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_171} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [398] L825-->L832: Formula: (let ((.cse1 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse0 (not (= (mod v_~x$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0)))) (let ((.cse2 (and .cse0 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_136 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_121 256) 0))))) (and (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_120 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_20)) (= (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_121) v_~x$w_buff1_used~0_120) (= v_~x$r_buff0_thd3~0_24 (ite .cse2 0 v_~x$r_buff0_thd3~0_25)) (= (ite .cse4 0 v_~x$w_buff0_used~0_136) v_~x$w_buff0_used~0_135) (= v_~x~0_87 (ite .cse4 v_~x$w_buff0~0_65 (ite .cse3 v_~x$w_buff1~0_66 v_~x~0_88)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$w_buff1~0=v_~x$w_buff1~0_66, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_121, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_88, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_136} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$w_buff1~0=v_~x$w_buff1~0_66, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_120, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_87, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_135} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 04:35:17,165 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:35:17,166 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 346 [2022-12-06 04:35:17,166 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 116 transitions, 1921 flow [2022-12-06 04:35:17,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:35:17,166 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:17,166 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:17,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:35:17,166 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:35:17,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:17,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1820203813, now seen corresponding path program 1 times [2022-12-06 04:35:17,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:17,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393956274] [2022-12-06 04:35:17,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:17,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:17,373 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:35:17,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:17,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393956274] [2022-12-06 04:35:17,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393956274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:17,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:17,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:35:17,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660256099] [2022-12-06 04:35:17,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:17,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:35:17,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:17,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:35:17,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:35:17,375 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 04:35:17,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 116 transitions, 1921 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:35:17,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:17,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 04:35:17,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:17,880 INFO L130 PetriNetUnfolder]: 2056/3240 cut-off events. [2022-12-06 04:35:17,880 INFO L131 PetriNetUnfolder]: For 39639/39639 co-relation queries the response was YES. [2022-12-06 04:35:17,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20039 conditions, 3240 events. 2056/3240 cut-off events. For 39639/39639 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 18047 event pairs, 281 based on Foata normal form. 60/3300 useless extension candidates. Maximal degree in co-relation 19998. Up to 1767 conditions per place. [2022-12-06 04:35:17,902 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 148 selfloop transitions, 10 changer transitions 43/201 dead transitions. [2022-12-06 04:35:17,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 201 transitions, 3659 flow [2022-12-06 04:35:17,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:35:17,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:35:17,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-06 04:35:17,904 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.51 [2022-12-06 04:35:17,905 INFO L175 Difference]: Start difference. First operand has 79 places, 116 transitions, 1921 flow. Second operand 4 states and 51 transitions. [2022-12-06 04:35:17,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 201 transitions, 3659 flow [2022-12-06 04:35:17,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 201 transitions, 3512 flow, removed 49 selfloop flow, removed 3 redundant places. [2022-12-06 04:35:17,984 INFO L231 Difference]: Finished difference. Result has 81 places, 104 transitions, 1619 flow [2022-12-06 04:35:17,984 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1842, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1619, PETRI_PLACES=81, PETRI_TRANSITIONS=104} [2022-12-06 04:35:17,985 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 46 predicate places. [2022-12-06 04:35:17,985 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:17,985 INFO L89 Accepts]: Start accepts. Operand has 81 places, 104 transitions, 1619 flow [2022-12-06 04:35:17,986 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:17,986 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:17,986 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 104 transitions, 1619 flow [2022-12-06 04:35:17,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 104 transitions, 1619 flow [2022-12-06 04:35:18,051 INFO L130 PetriNetUnfolder]: 212/522 cut-off events. [2022-12-06 04:35:18,052 INFO L131 PetriNetUnfolder]: For 5895/5984 co-relation queries the response was YES. [2022-12-06 04:35:18,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3697 conditions, 522 events. 212/522 cut-off events. For 5895/5984 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 3357 event pairs, 2 based on Foata normal form. 26/547 useless extension candidates. Maximal degree in co-relation 3658. Up to 296 conditions per place. [2022-12-06 04:35:18,058 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 104 transitions, 1619 flow [2022-12-06 04:35:18,058 INFO L188 LiptonReduction]: Number of co-enabled transitions 540 [2022-12-06 04:35:19,405 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [397] L822-->L825: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0] and [477] $Ultimate##0-->L743: Formula: (and (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|) (= v_~y~0_23 2)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~y~0=v_~y~0_23, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~y~0, P0Thread1of1ForFork2_~arg.base] [2022-12-06 04:35:19,438 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:35:19,439 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1454 [2022-12-06 04:35:19,439 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 106 transitions, 1689 flow [2022-12-06 04:35:19,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:35:19,439 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:19,439 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:19,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:35:19,439 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:35:19,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:19,440 INFO L85 PathProgramCache]: Analyzing trace with hash -407432000, now seen corresponding path program 1 times [2022-12-06 04:35:19,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:19,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254078094] [2022-12-06 04:35:19,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:19,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:19,898 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:35:19,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:19,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254078094] [2022-12-06 04:35:19,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254078094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:19,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:19,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:35:19,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743038572] [2022-12-06 04:35:19,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:19,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:35:19,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:19,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:35:19,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:35:19,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 04:35:19,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 106 transitions, 1689 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:35:19,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:19,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 04:35:19,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:20,421 INFO L130 PetriNetUnfolder]: 1593/2708 cut-off events. [2022-12-06 04:35:20,421 INFO L131 PetriNetUnfolder]: For 28023/28077 co-relation queries the response was YES. [2022-12-06 04:35:20,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16154 conditions, 2708 events. 1593/2708 cut-off events. For 28023/28077 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 16254 event pairs, 170 based on Foata normal form. 52/2760 useless extension candidates. Maximal degree in co-relation 16112. Up to 1686 conditions per place. [2022-12-06 04:35:20,445 INFO L137 encePairwiseOnDemand]: 17/28 looper letters, 74 selfloop transitions, 41 changer transitions 14/130 dead transitions. [2022-12-06 04:35:20,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 130 transitions, 2149 flow [2022-12-06 04:35:20,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:35:20,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:35:20,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-12-06 04:35:20,447 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-06 04:35:20,447 INFO L175 Difference]: Start difference. First operand has 82 places, 106 transitions, 1689 flow. Second operand 6 states and 60 transitions. [2022-12-06 04:35:20,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 130 transitions, 2149 flow [2022-12-06 04:35:20,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 130 transitions, 2054 flow, removed 12 selfloop flow, removed 7 redundant places. [2022-12-06 04:35:20,483 INFO L231 Difference]: Finished difference. Result has 83 places, 102 transitions, 1717 flow [2022-12-06 04:35:20,484 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1534, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1717, PETRI_PLACES=83, PETRI_TRANSITIONS=102} [2022-12-06 04:35:20,484 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 48 predicate places. [2022-12-06 04:35:20,484 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:20,484 INFO L89 Accepts]: Start accepts. Operand has 83 places, 102 transitions, 1717 flow [2022-12-06 04:35:20,485 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:20,485 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:20,485 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 102 transitions, 1717 flow [2022-12-06 04:35:20,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 102 transitions, 1717 flow [2022-12-06 04:35:20,552 INFO L130 PetriNetUnfolder]: 173/489 cut-off events. [2022-12-06 04:35:20,552 INFO L131 PetriNetUnfolder]: For 4812/4823 co-relation queries the response was YES. [2022-12-06 04:35:20,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3610 conditions, 489 events. 173/489 cut-off events. For 4812/4823 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 3328 event pairs, 0 based on Foata normal form. 4/492 useless extension candidates. Maximal degree in co-relation 3571. Up to 288 conditions per place. [2022-12-06 04:35:20,557 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 102 transitions, 1717 flow [2022-12-06 04:35:20,557 INFO L188 LiptonReduction]: Number of co-enabled transitions 468 [2022-12-06 04:35:20,580 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [416] $Ultimate##0-->L773: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= v_~x~0_175 1)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_175} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] and [441] $Ultimate##0-->L822: Formula: (and (= v_~x$r_buff0_thd2~0_109 v_~x$r_buff1_thd2~0_101) (= v_~x$w_buff0_used~0_270 v_~x$w_buff1_used~0_237) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_19| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_19|) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_7| |v_P2Thread1of1ForFork1_~arg#1.offset_7|) (= v_~x$r_buff1_thd0~0_63 v_~x$r_buff0_thd0~0_67) (= v_~x$r_buff0_thd3~0_48 1) (= 2 v_~x$w_buff0~0_183) (= v_~x$r_buff1_thd1~0_59 v_~x$r_buff0_thd1~0_55) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_19| 0)) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_269 256) 0)) (not (= (mod v_~x$w_buff1_used~0_237 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_19|) (= v_~x$w_buff0_used~0_269 1) (= |v_P2Thread1of1ForFork1_#in~arg#1.base_7| |v_P2Thread1of1ForFork1_~arg#1.base_7|) (= v_~x$r_buff1_thd3~0_35 v_~x$r_buff0_thd3~0_49) (= v_~x$w_buff0~0_184 v_~x$w_buff1~0_165)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_184, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_55, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_49, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_109, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_270} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_183, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_55, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_165, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_35, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_101, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_237, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_59, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_48, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_109, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_63, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_269, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_7|, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_19|, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_19|} AuxVars[] AssignedVars[~x$w_buff0~0, P2Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] [2022-12-06 04:35:20,873 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [416] $Ultimate##0-->L773: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= v_~x~0_175 1)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_175} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] and [441] $Ultimate##0-->L822: Formula: (and (= v_~x$r_buff0_thd2~0_109 v_~x$r_buff1_thd2~0_101) (= v_~x$w_buff0_used~0_270 v_~x$w_buff1_used~0_237) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_19| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_19|) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_7| |v_P2Thread1of1ForFork1_~arg#1.offset_7|) (= v_~x$r_buff1_thd0~0_63 v_~x$r_buff0_thd0~0_67) (= v_~x$r_buff0_thd3~0_48 1) (= 2 v_~x$w_buff0~0_183) (= v_~x$r_buff1_thd1~0_59 v_~x$r_buff0_thd1~0_55) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_19| 0)) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_269 256) 0)) (not (= (mod v_~x$w_buff1_used~0_237 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_19|) (= v_~x$w_buff0_used~0_269 1) (= |v_P2Thread1of1ForFork1_#in~arg#1.base_7| |v_P2Thread1of1ForFork1_~arg#1.base_7|) (= v_~x$r_buff1_thd3~0_35 v_~x$r_buff0_thd3~0_49) (= v_~x$w_buff0~0_184 v_~x$w_buff1~0_165)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_184, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_55, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_49, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_109, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_270} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_183, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_55, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_165, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_35, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_101, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_237, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_59, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_48, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_109, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_63, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_269, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_7|, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_19|, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_19|} AuxVars[] AssignedVars[~x$w_buff0~0, P2Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] [2022-12-06 04:35:28,041 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [365] L859-->L865: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_171 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_50 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd0~0_44 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff1_used~0_155 256) 0)) .cse2)) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_172 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_154 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_155)) (= v_~x$r_buff1_thd0~0_43 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_154 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd0~0_49 256) 0)) .cse3)) 0 v_~x$r_buff1_thd0~0_44)) (= (ite .cse4 v_~x$w_buff0~0_95 (ite .cse0 v_~x$w_buff1~0_94 v_~x~0_128)) v_~x~0_127) (= (ite .cse1 0 v_~x$r_buff0_thd0~0_50) v_~x$r_buff0_thd0~0_49) (= v_~x$w_buff0_used~0_171 (ite .cse4 0 v_~x$w_buff0_used~0_172))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_94, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_44, ~x~0=v_~x~0_128, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_94, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_43, ~x~0=v_~x~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_171} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [502] L780-->L822: Formula: (let ((.cse6 (= (mod v_~x$r_buff0_thd2~0_266 256) 0))) (let ((.cse7 (not .cse6)) (.cse10 (= (mod v_~x$w_buff0_used~0_672 256) 0)) (.cse4 (and (= (mod v_~x$w_buff1_used~0_619 256) 0) .cse6)) (.cse5 (and (= (mod v_~x$r_buff1_thd2~0_263 256) 0) .cse6))) (let ((.cse2 (not (= (mod v_~weak$$choice2~0_239 256) 0))) (.cse8 (or .cse10 .cse4 .cse5)) (.cse9 (and .cse7 (not .cse10)))) (let ((.cse1 (ite .cse2 v_~x$w_buff0_used~0_672 (ite .cse8 v_~x$w_buff0_used~0_672 (ite .cse9 0 v_~x$w_buff0_used~0_672)))) (.cse0 (ite .cse8 v_~x~0_573 (ite .cse9 v_~x$w_buff0~0_492 v_~x$w_buff1~0_461)))) (and (= v_~x~0_573 v_~x$mem_tmp~0_195) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_36| |v_P2Thread1of1ForFork1_~arg#1.offset_36|) (= v_~__unbuffered_p1_EAX~0_129 .cse0) (= v_~x$w_buff0~0_492 v_~x$w_buff1~0_459) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_617 256) 0)) (not (= 0 (mod v_~x$w_buff0_used~0_670 256))))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_48|) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_48| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_48|) (= v_~x$r_buff0_thd2~0_265 v_~x$r_buff1_thd2~0_261) (= v_~x$r_buff0_thd3~0_142 1) (= v_~x$r_buff0_thd0~0_279 v_~x$r_buff1_thd0~0_271) (= v_~weak$$choice2~0_239 |v_P1Thread1of1ForFork0_#t~nondet6_62|) (= v_~x$w_buff0_used~0_670 1) (= v_~x$flush_delayed~0_208 0) (= |v_P1Thread1of1ForFork0_#t~nondet5_62| v_~weak$$choice0~0_162) (= .cse1 v_~x$w_buff1_used~0_617) (= v_~x$r_buff0_thd2~0_265 (ite .cse2 v_~x$r_buff0_thd2~0_266 (let ((.cse3 (= (mod .cse1 256) 0))) (ite (or .cse3 (and (= (mod (ite .cse2 v_~x$w_buff1_used~0_619 (ite (or .cse4 .cse3 .cse5) v_~x$w_buff1_used~0_619 0)) 256) 0) .cse6) .cse5) v_~x$r_buff0_thd2~0_266 (ite (and .cse7 (not .cse3)) 0 v_~x$r_buff0_thd2~0_266))))) (= 2 v_~x$w_buff0~0_490) (= |v_P2Thread1of1ForFork1_~arg#1.base_36| |v_P2Thread1of1ForFork1_#in~arg#1.base_36|) (= v_~x$r_buff0_thd1~0_138 v_~x$r_buff1_thd1~0_148) (= v_~x$r_buff0_thd3~0_143 v_~x$r_buff1_thd3~0_124) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_48| 0)) (= (ite .cse2 v_~x$mem_tmp~0_195 .cse0) v_~x~0_572)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_492, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_279, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_138, P1Thread1of1ForFork0_#t~nondet6=|v_P1Thread1of1ForFork0_#t~nondet6_62|, P1Thread1of1ForFork0_#t~nondet5=|v_P1Thread1of1ForFork0_#t~nondet5_62|, ~x$w_buff1~0=v_~x$w_buff1~0_461, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_36|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_263, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_619, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_143, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_266, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_672, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_36|, ~x~0=v_~x~0_573} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_490, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_138, ~x$flush_delayed~0=v_~x$flush_delayed~0_208, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_36|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_124, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_148, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_142, ~x$mem_tmp~0=v_~x$mem_tmp~0_195, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_36|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_129, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_36|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_279, ~x$w_buff1~0=v_~x$w_buff1~0_459, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_261, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_617, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_36|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_265, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_271, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_670, ~weak$$choice0~0=v_~weak$$choice0~0_162, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_48|, ~weak$$choice2~0=v_~weak$$choice2~0_239, ~x~0=v_~x~0_572, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_48|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, P1Thread1of1ForFork0_#t~nondet6, P2Thread1of1ForFork1_~arg#1.offset, P1Thread1of1ForFork0_#t~nondet5, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p1_EAX~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~weak$$choice2~0, ~x~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] [2022-12-06 04:35:28,359 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [365] L859-->L865: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_171 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_50 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd0~0_44 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff1_used~0_155 256) 0)) .cse2)) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_172 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_154 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_155)) (= v_~x$r_buff1_thd0~0_43 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_154 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd0~0_49 256) 0)) .cse3)) 0 v_~x$r_buff1_thd0~0_44)) (= (ite .cse4 v_~x$w_buff0~0_95 (ite .cse0 v_~x$w_buff1~0_94 v_~x~0_128)) v_~x~0_127) (= (ite .cse1 0 v_~x$r_buff0_thd0~0_50) v_~x$r_buff0_thd0~0_49) (= v_~x$w_buff0_used~0_171 (ite .cse4 0 v_~x$w_buff0_used~0_172))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_94, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_44, ~x~0=v_~x~0_128, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_94, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_43, ~x~0=v_~x~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_171} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [441] $Ultimate##0-->L822: Formula: (and (= v_~x$r_buff0_thd2~0_109 v_~x$r_buff1_thd2~0_101) (= v_~x$w_buff0_used~0_270 v_~x$w_buff1_used~0_237) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_19| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_19|) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_7| |v_P2Thread1of1ForFork1_~arg#1.offset_7|) (= v_~x$r_buff1_thd0~0_63 v_~x$r_buff0_thd0~0_67) (= v_~x$r_buff0_thd3~0_48 1) (= 2 v_~x$w_buff0~0_183) (= v_~x$r_buff1_thd1~0_59 v_~x$r_buff0_thd1~0_55) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_19| 0)) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_269 256) 0)) (not (= (mod v_~x$w_buff1_used~0_237 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_19|) (= v_~x$w_buff0_used~0_269 1) (= |v_P2Thread1of1ForFork1_#in~arg#1.base_7| |v_P2Thread1of1ForFork1_~arg#1.base_7|) (= v_~x$r_buff1_thd3~0_35 v_~x$r_buff0_thd3~0_49) (= v_~x$w_buff0~0_184 v_~x$w_buff1~0_165)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_184, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_55, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_49, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_109, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_270} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_183, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_55, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_165, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_35, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_101, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_237, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_59, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_48, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_109, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_63, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_269, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_7|, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_19|, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_19|} AuxVars[] AssignedVars[~x$w_buff0~0, P2Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] [2022-12-06 04:35:28,510 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [365] L859-->L865: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_171 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_50 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd0~0_44 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff1_used~0_155 256) 0)) .cse2)) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_172 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_154 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_155)) (= v_~x$r_buff1_thd0~0_43 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_154 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd0~0_49 256) 0)) .cse3)) 0 v_~x$r_buff1_thd0~0_44)) (= (ite .cse4 v_~x$w_buff0~0_95 (ite .cse0 v_~x$w_buff1~0_94 v_~x~0_128)) v_~x~0_127) (= (ite .cse1 0 v_~x$r_buff0_thd0~0_50) v_~x$r_buff0_thd0~0_49) (= v_~x$w_buff0_used~0_171 (ite .cse4 0 v_~x$w_buff0_used~0_172))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_94, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_44, ~x~0=v_~x~0_128, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_94, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_43, ~x~0=v_~x~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_171} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [441] $Ultimate##0-->L822: Formula: (and (= v_~x$r_buff0_thd2~0_109 v_~x$r_buff1_thd2~0_101) (= v_~x$w_buff0_used~0_270 v_~x$w_buff1_used~0_237) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_19| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_19|) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_7| |v_P2Thread1of1ForFork1_~arg#1.offset_7|) (= v_~x$r_buff1_thd0~0_63 v_~x$r_buff0_thd0~0_67) (= v_~x$r_buff0_thd3~0_48 1) (= 2 v_~x$w_buff0~0_183) (= v_~x$r_buff1_thd1~0_59 v_~x$r_buff0_thd1~0_55) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_19| 0)) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_269 256) 0)) (not (= (mod v_~x$w_buff1_used~0_237 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_19|) (= v_~x$w_buff0_used~0_269 1) (= |v_P2Thread1of1ForFork1_#in~arg#1.base_7| |v_P2Thread1of1ForFork1_~arg#1.base_7|) (= v_~x$r_buff1_thd3~0_35 v_~x$r_buff0_thd3~0_49) (= v_~x$w_buff0~0_184 v_~x$w_buff1~0_165)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_184, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_55, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_49, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_109, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_270} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_183, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_55, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_165, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_35, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_101, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_237, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_59, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_48, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_109, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_63, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_269, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_7|, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_19|, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_19|} AuxVars[] AssignedVars[~x$w_buff0~0, P2Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] [2022-12-06 04:35:28,653 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [365] L859-->L865: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_171 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_50 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd0~0_44 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff1_used~0_155 256) 0)) .cse2)) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_172 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_154 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_155)) (= v_~x$r_buff1_thd0~0_43 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_154 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd0~0_49 256) 0)) .cse3)) 0 v_~x$r_buff1_thd0~0_44)) (= (ite .cse4 v_~x$w_buff0~0_95 (ite .cse0 v_~x$w_buff1~0_94 v_~x~0_128)) v_~x~0_127) (= (ite .cse1 0 v_~x$r_buff0_thd0~0_50) v_~x$r_buff0_thd0~0_49) (= v_~x$w_buff0_used~0_171 (ite .cse4 0 v_~x$w_buff0_used~0_172))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_94, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_44, ~x~0=v_~x~0_128, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_94, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_43, ~x~0=v_~x~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_171} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [389] L780-->L796: Formula: (let ((.cse1 (= (mod v_~x$r_buff1_thd2~0_70 256) 0)) (.cse7 (= (mod v_~x$r_buff0_thd2~0_76 256) 0))) (let ((.cse8 (not .cse7)) (.cse5 (and (= (mod v_~x$w_buff1_used~0_185 256) 0) .cse7)) (.cse6 (and .cse1 .cse7)) (.cse12 (= (mod v_~x$w_buff0_used~0_204 256) 0))) (let ((.cse9 (or .cse5 .cse6 .cse12)) (.cse10 (and .cse8 (not .cse12)))) (let ((.cse4 (= (mod v_~x$w_buff1_used~0_184 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_203 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_92 256) 0))) (.cse11 (ite .cse9 v_~x~0_154 (ite .cse10 v_~x$w_buff0~0_122 v_~x$w_buff1~0_119)))) (and (= v_~x$w_buff1~0_119 v_~x$w_buff1~0_118) (= (ite .cse0 v_~x$r_buff1_thd2~0_70 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd2~0_75 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~x$r_buff1_thd2~0_70 0)) v_~x$r_buff1_thd2~0_69) (= v_~weak$$choice0~0_17 |v_P1Thread1of1ForFork0_#t~nondet5_1|) (= (ite .cse0 v_~x$w_buff1_used~0_185 (ite (or .cse5 .cse6 .cse3) v_~x$w_buff1_used~0_185 0)) v_~x$w_buff1_used~0_184) (= v_~x$r_buff0_thd2~0_75 (ite .cse0 v_~x$r_buff0_thd2~0_76 (ite (or (and .cse4 .cse7) .cse6 .cse3) v_~x$r_buff0_thd2~0_76 (ite (and .cse8 (not .cse3)) 0 v_~x$r_buff0_thd2~0_76)))) (= v_~weak$$choice2~0_92 |v_P1Thread1of1ForFork0_#t~nondet6_1|) (= (ite .cse0 v_~x$w_buff0_used~0_204 (ite .cse9 v_~x$w_buff0_used~0_204 (ite .cse10 0 v_~x$w_buff0_used~0_204))) v_~x$w_buff0_used~0_203) (= v_~x$w_buff0~0_122 v_~x$w_buff0~0_121) (= (ite .cse0 v_~x$mem_tmp~0_46 .cse11) v_~x~0_153) (= v_~__unbuffered_p1_EAX~0_16 .cse11) (= v_~x$flush_delayed~0_57 0) (= v_~x$mem_tmp~0_46 v_~x~0_154)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_122, P1Thread1of1ForFork0_#t~nondet6=|v_P1Thread1of1ForFork0_#t~nondet6_1|, P1Thread1of1ForFork0_#t~nondet5=|v_P1Thread1of1ForFork0_#t~nondet5_1|, ~x$w_buff1~0=v_~x$w_buff1~0_119, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_70, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_185, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_76, ~x~0=v_~x~0_154, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_204} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$flush_delayed~0=v_~x$flush_delayed~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_118, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_69, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_184, ~x$mem_tmp~0=v_~x$mem_tmp~0_46, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203, ~weak$$choice0~0=v_~weak$$choice0~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~x~0=v_~x~0_153} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, P1Thread1of1ForFork0_#t~nondet6, P1Thread1of1ForFork0_#t~nondet5, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$mem_tmp~0, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p1_EAX~0, ~weak$$choice2~0, ~x~0] [2022-12-06 04:35:28,874 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:35:28,875 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8391 [2022-12-06 04:35:28,875 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 100 transitions, 1742 flow [2022-12-06 04:35:28,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:35:28,875 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:28,875 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:28,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 04:35:28,875 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:35:28,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:28,876 INFO L85 PathProgramCache]: Analyzing trace with hash -419337686, now seen corresponding path program 1 times [2022-12-06 04:35:28,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:28,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635693260] [2022-12-06 04:35:28,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:28,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:28,971 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:35:28,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:28,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635693260] [2022-12-06 04:35:28,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635693260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:28,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:28,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:35:28,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335461746] [2022-12-06 04:35:28,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:28,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:35:28,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:28,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:35:28,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:35:28,973 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 04:35:28,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 100 transitions, 1742 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:35:28,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:28,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 04:35:28,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:29,135 INFO L130 PetriNetUnfolder]: 609/1096 cut-off events. [2022-12-06 04:35:29,136 INFO L131 PetriNetUnfolder]: For 16441/16477 co-relation queries the response was YES. [2022-12-06 04:35:29,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6782 conditions, 1096 events. 609/1096 cut-off events. For 16441/16477 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5802 event pairs, 93 based on Foata normal form. 106/1202 useless extension candidates. Maximal degree in co-relation 6740. Up to 864 conditions per place. [2022-12-06 04:35:29,143 INFO L137 encePairwiseOnDemand]: 29/34 looper letters, 105 selfloop transitions, 4 changer transitions 1/111 dead transitions. [2022-12-06 04:35:29,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 111 transitions, 2019 flow [2022-12-06 04:35:29,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:35:29,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:35:29,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-06 04:35:29,144 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-06 04:35:29,144 INFO L175 Difference]: Start difference. First operand has 80 places, 100 transitions, 1742 flow. Second operand 3 states and 46 transitions. [2022-12-06 04:35:29,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 111 transitions, 2019 flow [2022-12-06 04:35:29,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 111 transitions, 1802 flow, removed 66 selfloop flow, removed 9 redundant places. [2022-12-06 04:35:29,159 INFO L231 Difference]: Finished difference. Result has 74 places, 82 transitions, 1179 flow [2022-12-06 04:35:29,159 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1179, PETRI_PLACES=74, PETRI_TRANSITIONS=82} [2022-12-06 04:35:29,160 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 39 predicate places. [2022-12-06 04:35:29,160 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:29,160 INFO L89 Accepts]: Start accepts. Operand has 74 places, 82 transitions, 1179 flow [2022-12-06 04:35:29,160 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:29,160 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:29,161 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 82 transitions, 1179 flow [2022-12-06 04:35:29,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 82 transitions, 1179 flow [2022-12-06 04:35:29,210 INFO L130 PetriNetUnfolder]: 203/535 cut-off events. [2022-12-06 04:35:29,211 INFO L131 PetriNetUnfolder]: For 4579/4707 co-relation queries the response was YES. [2022-12-06 04:35:29,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2697 conditions, 535 events. 203/535 cut-off events. For 4579/4707 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 3636 event pairs, 48 based on Foata normal form. 19/537 useless extension candidates. Maximal degree in co-relation 2662. Up to 302 conditions per place. [2022-12-06 04:35:29,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 82 transitions, 1179 flow [2022-12-06 04:35:29,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 348 [2022-12-06 04:35:29,217 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] L780-->L822: Formula: (let ((.cse6 (= (mod v_~x$r_buff0_thd2~0_266 256) 0))) (let ((.cse7 (not .cse6)) (.cse10 (= (mod v_~x$w_buff0_used~0_672 256) 0)) (.cse4 (and (= (mod v_~x$w_buff1_used~0_619 256) 0) .cse6)) (.cse5 (and (= (mod v_~x$r_buff1_thd2~0_263 256) 0) .cse6))) (let ((.cse2 (not (= (mod v_~weak$$choice2~0_239 256) 0))) (.cse8 (or .cse10 .cse4 .cse5)) (.cse9 (and .cse7 (not .cse10)))) (let ((.cse1 (ite .cse2 v_~x$w_buff0_used~0_672 (ite .cse8 v_~x$w_buff0_used~0_672 (ite .cse9 0 v_~x$w_buff0_used~0_672)))) (.cse0 (ite .cse8 v_~x~0_573 (ite .cse9 v_~x$w_buff0~0_492 v_~x$w_buff1~0_461)))) (and (= v_~x~0_573 v_~x$mem_tmp~0_195) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_36| |v_P2Thread1of1ForFork1_~arg#1.offset_36|) (= v_~__unbuffered_p1_EAX~0_129 .cse0) (= v_~x$w_buff0~0_492 v_~x$w_buff1~0_459) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_617 256) 0)) (not (= 0 (mod v_~x$w_buff0_used~0_670 256))))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_48|) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_48| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_48|) (= v_~x$r_buff0_thd2~0_265 v_~x$r_buff1_thd2~0_261) (= v_~x$r_buff0_thd3~0_142 1) (= v_~x$r_buff0_thd0~0_279 v_~x$r_buff1_thd0~0_271) (= v_~weak$$choice2~0_239 |v_P1Thread1of1ForFork0_#t~nondet6_62|) (= v_~x$w_buff0_used~0_670 1) (= v_~x$flush_delayed~0_208 0) (= |v_P1Thread1of1ForFork0_#t~nondet5_62| v_~weak$$choice0~0_162) (= .cse1 v_~x$w_buff1_used~0_617) (= v_~x$r_buff0_thd2~0_265 (ite .cse2 v_~x$r_buff0_thd2~0_266 (let ((.cse3 (= (mod .cse1 256) 0))) (ite (or .cse3 (and (= (mod (ite .cse2 v_~x$w_buff1_used~0_619 (ite (or .cse4 .cse3 .cse5) v_~x$w_buff1_used~0_619 0)) 256) 0) .cse6) .cse5) v_~x$r_buff0_thd2~0_266 (ite (and .cse7 (not .cse3)) 0 v_~x$r_buff0_thd2~0_266))))) (= 2 v_~x$w_buff0~0_490) (= |v_P2Thread1of1ForFork1_~arg#1.base_36| |v_P2Thread1of1ForFork1_#in~arg#1.base_36|) (= v_~x$r_buff0_thd1~0_138 v_~x$r_buff1_thd1~0_148) (= v_~x$r_buff0_thd3~0_143 v_~x$r_buff1_thd3~0_124) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_48| 0)) (= (ite .cse2 v_~x$mem_tmp~0_195 .cse0) v_~x~0_572)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_492, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_279, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_138, P1Thread1of1ForFork0_#t~nondet6=|v_P1Thread1of1ForFork0_#t~nondet6_62|, P1Thread1of1ForFork0_#t~nondet5=|v_P1Thread1of1ForFork0_#t~nondet5_62|, ~x$w_buff1~0=v_~x$w_buff1~0_461, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_36|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_263, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_619, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_143, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_266, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_672, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_36|, ~x~0=v_~x~0_573} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_490, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_138, ~x$flush_delayed~0=v_~x$flush_delayed~0_208, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_36|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_124, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_148, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_142, ~x$mem_tmp~0=v_~x$mem_tmp~0_195, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_36|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_129, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_36|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_279, ~x$w_buff1~0=v_~x$w_buff1~0_459, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_261, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_617, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_36|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_265, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_271, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_670, ~weak$$choice0~0=v_~weak$$choice0~0_162, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_48|, ~weak$$choice2~0=v_~weak$$choice2~0_239, ~x~0=v_~x~0_572, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_48|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, P1Thread1of1ForFork0_#t~nondet6, P2Thread1of1ForFork1_~arg#1.offset, P1Thread1of1ForFork0_#t~nondet5, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p1_EAX~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~weak$$choice2~0, ~x~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [390] L796-->L803: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd2~0_64 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_163 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd2~0_58 256) 0)))) (let ((.cse3 (and .cse0 (not (= 0 (mod v_~x$w_buff1_used~0_147 256))))) (.cse4 (and .cse5 .cse1)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_164 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_57 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_146 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd2~0_63 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_58)) (= (ite .cse2 v_~x$w_buff0~0_89 (ite .cse3 v_~x$w_buff1~0_88 v_~x~0_118)) v_~x~0_117) (= (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_147) v_~x$w_buff1_used~0_146) (= v_~x$r_buff0_thd2~0_63 (ite .cse4 0 v_~x$r_buff0_thd2~0_64)) (= (ite .cse2 0 v_~x$w_buff0_used~0_164) v_~x$w_buff0_used~0_163)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_89, ~x$w_buff1~0=v_~x$w_buff1~0_88, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_58, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_147, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_64, ~x~0=v_~x~0_118, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_164} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_89, ~x$w_buff1~0=v_~x$w_buff1~0_88, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_146, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_63, ~x~0=v_~x~0_117, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_163} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 04:35:29,993 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:35:29,994 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 834 [2022-12-06 04:35:29,994 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 82 transitions, 1198 flow [2022-12-06 04:35:29,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:35:29,994 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:29,994 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:29,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 04:35:29,994 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:35:29,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:29,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1441998742, now seen corresponding path program 1 times [2022-12-06 04:35:29,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:29,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128363293] [2022-12-06 04:35:29,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:29,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:30,097 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:35:30,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:30,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128363293] [2022-12-06 04:35:30,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128363293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:30,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:30,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:35:30,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202750674] [2022-12-06 04:35:30,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:30,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:35:30,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:30,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:35:30,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:35:30,101 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32 [2022-12-06 04:35:30,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 82 transitions, 1198 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:35:30,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:30,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32 [2022-12-06 04:35:30,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:30,275 INFO L130 PetriNetUnfolder]: 349/675 cut-off events. [2022-12-06 04:35:30,275 INFO L131 PetriNetUnfolder]: For 7713/7728 co-relation queries the response was YES. [2022-12-06 04:35:30,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4395 conditions, 675 events. 349/675 cut-off events. For 7713/7728 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3408 event pairs, 26 based on Foata normal form. 117/792 useless extension candidates. Maximal degree in co-relation 4357. Up to 285 conditions per place. [2022-12-06 04:35:30,278 INFO L137 encePairwiseOnDemand]: 23/32 looper letters, 108 selfloop transitions, 7 changer transitions 1/117 dead transitions. [2022-12-06 04:35:30,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 117 transitions, 1907 flow [2022-12-06 04:35:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:35:30,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:35:30,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 04:35:30,280 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.453125 [2022-12-06 04:35:30,280 INFO L175 Difference]: Start difference. First operand has 74 places, 82 transitions, 1198 flow. Second operand 4 states and 58 transitions. [2022-12-06 04:35:30,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 117 transitions, 1907 flow [2022-12-06 04:35:30,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 117 transitions, 1647 flow, removed 99 selfloop flow, removed 7 redundant places. [2022-12-06 04:35:30,288 INFO L231 Difference]: Finished difference. Result has 70 places, 75 transitions, 917 flow [2022-12-06 04:35:30,289 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=917, PETRI_PLACES=70, PETRI_TRANSITIONS=75} [2022-12-06 04:35:30,290 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 35 predicate places. [2022-12-06 04:35:30,290 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:30,290 INFO L89 Accepts]: Start accepts. Operand has 70 places, 75 transitions, 917 flow [2022-12-06 04:35:30,290 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:30,290 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:30,291 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 75 transitions, 917 flow [2022-12-06 04:35:30,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 75 transitions, 917 flow [2022-12-06 04:35:30,322 INFO L130 PetriNetUnfolder]: 117/349 cut-off events. [2022-12-06 04:35:30,323 INFO L131 PetriNetUnfolder]: For 1669/1731 co-relation queries the response was YES. [2022-12-06 04:35:30,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1835 conditions, 349 events. 117/349 cut-off events. For 1669/1731 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2165 event pairs, 4 based on Foata normal form. 25/367 useless extension candidates. Maximal degree in co-relation 1803. Up to 169 conditions per place. [2022-12-06 04:35:30,326 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 75 transitions, 917 flow [2022-12-06 04:35:30,326 INFO L188 LiptonReduction]: Number of co-enabled transitions 288 [2022-12-06 04:35:30,451 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [416] $Ultimate##0-->L773: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= v_~x~0_175 1)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_175} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] and [382] L743-->L761: Formula: (let ((.cse5 (= (mod v_~x$r_buff1_thd1~0_46 256) 0)) (.cse6 (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (let ((.cse8 (not .cse6)) (.cse9 (and .cse6 (= (mod v_~x$w_buff1_used~0_197 256) 0))) (.cse12 (= (mod v_~x$w_buff0_used~0_216 256) 0)) (.cse7 (and .cse6 .cse5))) (let ((.cse10 (or .cse9 .cse12 .cse7)) (.cse11 (and .cse8 (not .cse12)))) (let ((.cse3 (= (mod v_~x$w_buff1_used~0_196 256) 0)) (.cse0 (ite .cse10 v_~x~0_168 (ite .cse11 v_~x$w_buff0~0_134 v_~x$w_buff1~0_131))) (.cse2 (= (mod v_~x$w_buff0_used~0_215 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_98 256) 0)))) (and (= v_~x$w_buff1~0_131 v_~x$w_buff1~0_130) (= .cse0 v_~__unbuffered_p0_EAX~0_22) (= v_~x$r_buff1_thd1~0_45 (ite .cse1 v_~x$r_buff1_thd1~0_46 (ite (let ((.cse4 (= (mod v_~x$r_buff0_thd1~0_43 256) 0))) (or .cse2 (and .cse3 .cse4) (and .cse4 .cse5))) v_~x$r_buff1_thd1~0_46 0))) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_23) (= v_~x$flush_delayed~0_65 0) (= (ite .cse1 v_~x$r_buff0_thd1~0_44 (ite (or (and .cse6 .cse3) .cse2 .cse7) v_~x$r_buff0_thd1~0_44 (ite (and (not .cse2) .cse8) 0 v_~x$r_buff0_thd1~0_44))) v_~x$r_buff0_thd1~0_43) (= (ite .cse1 v_~x$mem_tmp~0_52 .cse0) v_~x~0_167) (= v_~x$mem_tmp~0_52 v_~x~0_168) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_98) (= v_~x$w_buff1_used~0_196 (ite .cse1 v_~x$w_buff1_used~0_197 (ite (or .cse9 .cse2 .cse7) v_~x$w_buff1_used~0_197 0))) (= v_~x$w_buff0~0_134 v_~x$w_buff0~0_133) (= v_~x$w_buff0_used~0_215 (ite .cse1 v_~x$w_buff0_used~0_216 (ite .cse10 v_~x$w_buff0_used~0_216 (ite .cse11 0 v_~x$w_buff0_used~0_216))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_134, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_131, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_197, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_46, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_168, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_216} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_133, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~x$flush_delayed~0=v_~x$flush_delayed~0_65, ~x$w_buff1~0=v_~x$w_buff1~0_130, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_196, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_45, ~x$mem_tmp~0=v_~x$mem_tmp~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_215, ~weak$$choice0~0=v_~weak$$choice0~0_23, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ~weak$$choice2~0=v_~weak$$choice2~0_98, ~x~0=v_~x~0_167} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3] [2022-12-06 04:35:30,579 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [416] $Ultimate##0-->L773: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= v_~x~0_175 1)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_175} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] and [398] L825-->L832: Formula: (let ((.cse1 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse0 (not (= (mod v_~x$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0)))) (let ((.cse2 (and .cse0 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_136 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_121 256) 0))))) (and (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_120 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_20)) (= (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_121) v_~x$w_buff1_used~0_120) (= v_~x$r_buff0_thd3~0_24 (ite .cse2 0 v_~x$r_buff0_thd3~0_25)) (= (ite .cse4 0 v_~x$w_buff0_used~0_136) v_~x$w_buff0_used~0_135) (= v_~x~0_87 (ite .cse4 v_~x$w_buff0~0_65 (ite .cse3 v_~x$w_buff1~0_66 v_~x~0_88)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$w_buff1~0=v_~x$w_buff1~0_66, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_121, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_88, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_136} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$w_buff1~0=v_~x$w_buff1~0_66, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_120, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_87, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_135} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 04:35:30,730 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:35:30,731 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 441 [2022-12-06 04:35:30,731 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 74 transitions, 921 flow [2022-12-06 04:35:30,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:35:30,731 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:30,731 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:30,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 04:35:30,731 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:35:30,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:30,732 INFO L85 PathProgramCache]: Analyzing trace with hash -2116431615, now seen corresponding path program 1 times [2022-12-06 04:35:30,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:30,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63659141] [2022-12-06 04:35:30,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:30,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:30,853 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:35:30,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:30,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63659141] [2022-12-06 04:35:30,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63659141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:30,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:30,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:35:30,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049132414] [2022-12-06 04:35:30,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:30,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:35:30,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:30,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:35:30,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:35:30,856 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 04:35:30,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 74 transitions, 921 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:35:30,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:30,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 04:35:30,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:30,989 INFO L130 PetriNetUnfolder]: 304/577 cut-off events. [2022-12-06 04:35:30,990 INFO L131 PetriNetUnfolder]: For 4937/5003 co-relation queries the response was YES. [2022-12-06 04:35:30,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3617 conditions, 577 events. 304/577 cut-off events. For 4937/5003 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2844 event pairs, 20 based on Foata normal form. 47/623 useless extension candidates. Maximal degree in co-relation 3582. Up to 234 conditions per place. [2022-12-06 04:35:30,993 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 88 selfloop transitions, 10 changer transitions 18/116 dead transitions. [2022-12-06 04:35:30,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 116 transitions, 1677 flow [2022-12-06 04:35:30,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:35:30,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:35:30,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-06 04:35:30,994 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38666666666666666 [2022-12-06 04:35:30,995 INFO L175 Difference]: Start difference. First operand has 69 places, 74 transitions, 921 flow. Second operand 5 states and 58 transitions. [2022-12-06 04:35:30,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 116 transitions, 1677 flow [2022-12-06 04:35:31,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 116 transitions, 1622 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-06 04:35:31,002 INFO L231 Difference]: Finished difference. Result has 71 places, 64 transitions, 794 flow [2022-12-06 04:35:31,002 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=879, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=794, PETRI_PLACES=71, PETRI_TRANSITIONS=64} [2022-12-06 04:35:31,003 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 36 predicate places. [2022-12-06 04:35:31,003 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:31,003 INFO L89 Accepts]: Start accepts. Operand has 71 places, 64 transitions, 794 flow [2022-12-06 04:35:31,003 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:31,004 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:31,004 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 64 transitions, 794 flow [2022-12-06 04:35:31,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 64 transitions, 794 flow [2022-12-06 04:35:31,018 INFO L130 PetriNetUnfolder]: 49/141 cut-off events. [2022-12-06 04:35:31,019 INFO L131 PetriNetUnfolder]: For 694/698 co-relation queries the response was YES. [2022-12-06 04:35:31,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 141 events. 49/141 cut-off events. For 694/698 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 650 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 749. Up to 49 conditions per place. [2022-12-06 04:35:31,020 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 64 transitions, 794 flow [2022-12-06 04:35:31,020 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 Received shutdown request... [2022-12-06 04:49:26,751 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 04:49:26,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 04:49:26,752 WARN L619 AbstractCegarLoop]: Verification canceled: while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-3-2-1 context. [2022-12-06 04:49:26,753 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 04:49:26,753 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 04:49:26,753 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 04:49:26,754 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 04:49:26,754 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 04:49:26,754 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:49:26,757 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:49:26,757 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:49:26,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:49:26 BasicIcfg [2022-12-06 04:49:26,759 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:49:26,759 INFO L158 Benchmark]: Toolchain (without parser) took 868809.78ms. Allocated memory was 200.3MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 176.3MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-12-06 04:49:26,759 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 200.3MB. Free memory was 177.6MB in the beginning and 177.5MB in the end (delta: 86.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:49:26,760 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.19ms. Allocated memory is still 200.3MB. Free memory was 175.9MB in the beginning and 147.0MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-06 04:49:26,760 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.85ms. Allocated memory is still 200.3MB. Free memory was 147.0MB in the beginning and 143.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:49:26,760 INFO L158 Benchmark]: Boogie Preprocessor took 24.35ms. Allocated memory is still 200.3MB. Free memory was 143.8MB in the beginning and 141.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:49:26,760 INFO L158 Benchmark]: RCFGBuilder took 666.28ms. Allocated memory is still 200.3MB. Free memory was 141.7MB in the beginning and 171.3MB in the end (delta: -29.6MB). Peak memory consumption was 46.4MB. Max. memory is 8.0GB. [2022-12-06 04:49:26,760 INFO L158 Benchmark]: TraceAbstraction took 867627.92ms. Allocated memory was 200.3MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 170.8MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-12-06 04:49:26,761 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 200.3MB. Free memory was 177.6MB in the beginning and 177.5MB in the end (delta: 86.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 448.19ms. Allocated memory is still 200.3MB. Free memory was 175.9MB in the beginning and 147.0MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.85ms. Allocated memory is still 200.3MB. Free memory was 147.0MB in the beginning and 143.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.35ms. Allocated memory is still 200.3MB. Free memory was 143.8MB in the beginning and 141.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 666.28ms. Allocated memory is still 200.3MB. Free memory was 141.7MB in the beginning and 171.3MB in the end (delta: -29.6MB). Peak memory consumption was 46.4MB. Max. memory is 8.0GB. * TraceAbstraction took 867627.92ms. Allocated memory was 200.3MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 170.8MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 112 PlacesBefore, 35 PlacesAfterwards, 104 TransitionsBefore, 26 TransitionsAfterwards, 1876 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1363, independent: 1306, independent conditional: 1306, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1363, independent: 1306, independent conditional: 0, independent unconditional: 1306, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1363, independent: 1306, independent conditional: 0, independent unconditional: 1306, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1363, independent: 1306, independent conditional: 0, independent unconditional: 1306, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1203, independent: 1156, independent conditional: 0, independent unconditional: 1156, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1203, independent: 1145, independent conditional: 0, independent unconditional: 1145, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 58, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 341, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 318, dependent conditional: 0, dependent unconditional: 318, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1363, independent: 150, independent conditional: 0, independent unconditional: 150, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 1203, unknown conditional: 0, unknown unconditional: 1203] , Statistics on independence cache: Total cache size (in pairs): 1788, Positive cache size: 1741, Positive conditional cache size: 0, Positive unconditional cache size: 1741, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 30 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, independent: 61, independent conditional: 61, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 83, independent: 61, independent conditional: 2, independent unconditional: 59, dependent: 22, dependent conditional: 1, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 83, independent: 61, independent conditional: 2, independent unconditional: 59, dependent: 22, dependent conditional: 1, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 83, independent: 61, independent conditional: 2, independent unconditional: 59, dependent: 22, dependent conditional: 1, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 78, independent: 57, independent conditional: 2, independent unconditional: 55, dependent: 21, dependent conditional: 1, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 78, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 21, dependent conditional: 1, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 153, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 145, dependent conditional: 7, dependent unconditional: 138, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 83, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 78, unknown conditional: 3, unknown unconditional: 75] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 57, Positive conditional cache size: 2, Positive unconditional cache size: 55, Negative cache size: 21, Negative conditional cache size: 1, Negative unconditional cache size: 20, 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.1s, 31 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78, independent: 58, independent conditional: 58, 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: 78, independent: 58, independent conditional: 4, independent unconditional: 54, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 78, independent: 58, independent conditional: 0, independent unconditional: 58, 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: 78, independent: 58, independent conditional: 0, independent unconditional: 58, 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: 12, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 78, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 62, Positive conditional cache size: 2, Positive unconditional cache size: 60, Negative cache size: 28, Negative conditional cache size: 1, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 32 PlacesBefore, 32 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 48, independent conditional: 48, 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: 66, independent: 48, independent conditional: 10, independent unconditional: 38, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 48, independent conditional: 0, independent unconditional: 48, 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: 66, independent: 48, independent conditional: 0, independent unconditional: 48, 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: 15, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 106, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 69, Positive conditional cache size: 2, Positive unconditional cache size: 67, Negative cache size: 36, Negative conditional cache size: 1, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 36, independent conditional: 11, independent unconditional: 25, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 36, independent conditional: 5, independent unconditional: 31, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 36, independent conditional: 5, independent unconditional: 31, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 33, independent conditional: 3, independent unconditional: 30, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 72, Positive conditional cache size: 4, Positive unconditional cache size: 68, Negative cache size: 36, Negative conditional cache size: 1, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 338 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 47, independent: 41, independent conditional: 16, independent unconditional: 25, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 41, independent conditional: 10, independent unconditional: 31, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 41, independent conditional: 10, independent unconditional: 31, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, independent: 40, independent conditional: 9, independent unconditional: 31, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 73, Positive conditional cache size: 5, Positive unconditional cache size: 68, Negative cache size: 36, Negative conditional cache size: 1, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 330 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 53, independent: 45, independent conditional: 20, independent unconditional: 25, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 53, independent: 45, independent conditional: 12, independent unconditional: 33, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 53, independent: 45, independent conditional: 12, independent unconditional: 33, dependent: 8, dependent conditional: 0, dependent unconditional: 8, 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: 53, independent: 45, independent conditional: 12, independent unconditional: 33, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 73, Positive conditional cache size: 5, Positive unconditional cache size: 68, Negative cache size: 36, Negative conditional cache size: 1, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 330 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42, independent: 34, independent conditional: 17, independent unconditional: 17, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, independent: 34, independent conditional: 9, independent unconditional: 25, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 34, independent conditional: 9, independent unconditional: 25, dependent: 8, dependent conditional: 0, dependent unconditional: 8, 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: 42, independent: 34, independent conditional: 9, independent unconditional: 25, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 73, Positive conditional cache size: 5, Positive unconditional cache size: 68, Negative cache size: 36, Negative conditional cache size: 1, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 370 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 62, independent: 52, independent conditional: 20, independent unconditional: 32, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 62, independent: 52, independent conditional: 12, independent unconditional: 40, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 62, independent: 52, independent conditional: 12, independent unconditional: 40, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 62, independent: 52, independent conditional: 12, independent unconditional: 40, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 73, Positive conditional cache size: 5, Positive unconditional cache size: 68, Negative cache size: 36, Negative conditional cache size: 1, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 58 PlacesBefore, 58 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 426 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 166, independent: 138, independent conditional: 138, 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: 166, independent: 138, independent conditional: 74, independent unconditional: 64, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 167, independent: 138, independent conditional: 46, independent unconditional: 92, dependent: 29, dependent conditional: 1, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 167, independent: 138, independent conditional: 46, independent unconditional: 92, dependent: 29, dependent conditional: 1, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 167, independent: 133, independent conditional: 41, independent unconditional: 92, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 79, Positive conditional cache size: 10, Positive unconditional cache size: 69, Negative cache size: 37, Negative conditional cache size: 2, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 58, independent conditional: 26, independent unconditional: 32, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, independent: 58, independent conditional: 12, independent unconditional: 46, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 58, independent conditional: 12, independent unconditional: 46, dependent: 14, dependent conditional: 0, dependent unconditional: 14, 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: 72, independent: 58, independent conditional: 12, independent unconditional: 46, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 79, Positive conditional cache size: 10, Positive unconditional cache size: 69, Negative cache size: 37, Negative conditional cache size: 2, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 70 PlacesBefore, 71 PlacesAfterwards, 95 TransitionsBefore, 96 TransitionsAfterwards, 646 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 437, independent: 373, independent conditional: 373, independent unconditional: 0, dependent: 64, dependent conditional: 64, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 437, independent: 373, independent conditional: 182, independent unconditional: 191, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 437, independent: 373, independent conditional: 124, independent unconditional: 249, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 437, independent: 373, independent conditional: 124, independent unconditional: 249, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 437, independent: 372, independent conditional: 124, independent unconditional: 248, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 84, Positive conditional cache size: 10, Positive unconditional cache size: 74, Negative cache size: 37, Negative conditional cache size: 2, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 58, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks [2022-12-06 04:49:26,769 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end Lipton Reduction Statistics: ReductionTime: 0.3s, 80 PlacesBefore, 79 PlacesAfterwards, 117 TransitionsBefore, 116 TransitionsAfterwards, 714 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 504, independent: 428, independent conditional: 428, independent unconditional: 0, dependent: 76, dependent conditional: 76, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 504, independent: 428, independent conditional: 192, independent unconditional: 236, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 504, independent: 428, independent conditional: 96, independent unconditional: 332, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 504, independent: 428, independent conditional: 96, independent unconditional: 332, dependent: 76, dependent conditional: 0, dependent unconditional: 76, 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: 504, independent: 428, independent conditional: 96, independent unconditional: 332, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 93, Positive conditional cache size: 10, Positive unconditional cache size: 83, Negative cache size: 37, Negative conditional cache size: 2, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 96, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 81 PlacesBefore, 82 PlacesAfterwards, 104 TransitionsBefore, 106 TransitionsAfterwards, 540 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 608, independent: 528, independent conditional: 528, independent unconditional: 0, dependent: 80, dependent conditional: 80, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 608, independent: 528, independent conditional: 306, independent unconditional: 222, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 608, independent: 528, independent conditional: 143, independent unconditional: 385, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 608, independent: 528, independent conditional: 143, independent unconditional: 385, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 1, independent unconditional: 8, 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: 9, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 608, independent: 519, independent conditional: 142, independent unconditional: 377, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 9, unknown conditional: 1, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 124, Positive conditional cache size: 11, Positive unconditional cache size: 113, Negative cache size: 37, Negative conditional cache size: 2, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 163, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.3s, 82 PlacesBefore, 80 PlacesAfterwards, 102 TransitionsBefore, 100 TransitionsAfterwards, 468 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 796, independent: 700, independent conditional: 700, independent unconditional: 0, dependent: 96, dependent conditional: 96, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 796, independent: 700, independent conditional: 484, independent unconditional: 216, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 796, independent: 700, independent conditional: 394, independent unconditional: 306, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 796, independent: 700, independent conditional: 394, independent unconditional: 306, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 10, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 796, independent: 686, independent conditional: 384, independent unconditional: 302, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 14, unknown conditional: 10, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 169, Positive conditional cache size: 21, Positive unconditional cache size: 148, Negative cache size: 37, Negative conditional cache size: 2, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 90, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 74 PlacesBefore, 74 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 348 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 115, independent: 115, independent conditional: 115, 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: 115, independent: 115, independent conditional: 91, independent unconditional: 24, 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: 115, independent: 115, independent conditional: 75, independent unconditional: 40, 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: 115, independent: 115, independent conditional: 75, independent unconditional: 40, 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: 9, independent: 9, independent conditional: 5, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 115, independent: 106, independent conditional: 70, independent unconditional: 36, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 5, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 193, Positive conditional cache size: 26, Positive unconditional cache size: 167, Negative cache size: 37, Negative conditional cache size: 2, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 70 PlacesBefore, 69 PlacesAfterwards, 75 TransitionsBefore, 74 TransitionsAfterwards, 288 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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): 243, Positive cache size: 206, Positive conditional cache size: 26, Positive unconditional cache size: 180, Negative cache size: 37, Negative conditional cache size: 2, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-3-2-1 context. - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-3-2-1 context. - TimeoutResultAtElement [Line: 850]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-3-2-1 context. - TimeoutResultAtElement [Line: 852]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-3-2-1 context. - TimeoutResultAtElement [Line: 854]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-3-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 867.5s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 444 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 444 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 232 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1452 IncrementalHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 232 mSolverCounterUnsat, 2 mSDtfsCounter, 1452 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1921occurred in iteration=12, InterpolantAutomatonStates: 83, 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, 7.3s InterpolantComputationTime, 219 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 202 ConstructedInterpolants, 0 QuantifiedInterpolants, 2514 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 could not prove your program: Timeout Completed graceful shutdown