/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:29:58,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:29:58,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:29:58,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:29:58,367 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:29:58,370 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:29:58,372 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:29:58,373 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:29:58,374 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:29:58,375 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:29:58,376 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:29:58,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:29:58,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:29:58,377 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:29:58,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:29:58,381 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:29:58,382 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:29:58,383 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:29:58,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:29:58,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:29:58,389 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:29:58,392 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:29:58,392 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:29:58,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:29:58,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:29:58,395 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:29:58,395 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:29:58,396 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:29:58,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:29:58,397 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:29:58,397 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:29:58,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:29:58,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:29:58,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:29:58,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:29:58,400 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:29:58,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:29:58,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:29:58,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:29:58,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:29:58,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:29:58,408 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:29:58,430 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:29:58,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:29:58,431 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:29:58,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:29:58,431 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:29:58,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:29:58,432 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:29:58,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:29:58,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:29:58,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:29:58,432 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:29:58,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:29:58,432 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:29:58,432 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:29:58,432 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:29:58,432 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:29:58,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:29:58,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:29:58,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:29:58,433 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:29:58,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:29:58,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:29:58,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:29:58,433 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:29:58,433 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:29:58,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:29:58,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:29:58,434 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:29:58,434 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 06:29:58,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:29:58,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:29:58,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:29:58,772 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:29:58,773 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:29:58,774 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i [2022-12-06 06:29:59,929 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:30:00,224 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:30:00,224 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i [2022-12-06 06:30:00,241 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/118e4254a/42e9e2fd9ce94f3c96807edd9a2e8f66/FLAGd37d0a991 [2022-12-06 06:30:00,252 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/118e4254a/42e9e2fd9ce94f3c96807edd9a2e8f66 [2022-12-06 06:30:00,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:30:00,254 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:30:00,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:30:00,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:30:00,261 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:30:00,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:30:00" (1/1) ... [2022-12-06 06:30:00,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a06c767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:00, skipping insertion in model container [2022-12-06 06:30:00,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:30:00" (1/1) ... [2022-12-06 06:30:00,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:30:00,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:30:00,445 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i[949,962] [2022-12-06 06:30:00,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:30:00,655 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:30:00,664 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i[949,962] [2022-12-06 06:30:00,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:00,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:00,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:30:00,755 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:30:00,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:00 WrapperNode [2022-12-06 06:30:00,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:30:00,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:30:00,757 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:30:00,757 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:30:00,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:00" (1/1) ... [2022-12-06 06:30:00,786 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:00" (1/1) ... [2022-12-06 06:30:00,817 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 158 [2022-12-06 06:30:00,818 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:30:00,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:30:00,819 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:30:00,819 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:30:00,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:00" (1/1) ... [2022-12-06 06:30:00,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:00" (1/1) ... [2022-12-06 06:30:00,838 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:00" (1/1) ... [2022-12-06 06:30:00,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:00" (1/1) ... [2022-12-06 06:30:00,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:00" (1/1) ... [2022-12-06 06:30:00,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:00" (1/1) ... [2022-12-06 06:30:00,849 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:00" (1/1) ... [2022-12-06 06:30:00,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:00" (1/1) ... [2022-12-06 06:30:00,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:30:00,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:30:00,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:30:00,853 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:30:00,854 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:00" (1/1) ... [2022-12-06 06:30:00,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:30:00,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:30:00,889 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 06:30:00,907 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 06:30:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:30:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:30:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:30:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:30:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:30:00,922 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:30:00,922 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:30:00,922 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:30:00,922 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:30:00,922 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:30:00,922 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:30:00,922 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 06:30:00,922 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 06:30:00,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:30:00,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:30:00,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:30:00,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:30:00,924 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 06:30:01,099 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:30:01,101 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:30:01,342 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:30:01,429 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:30:01,430 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:30:01,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:30:01 BoogieIcfgContainer [2022-12-06 06:30:01,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:30:01,435 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:30:01,435 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:30:01,437 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:30:01,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:30:00" (1/3) ... [2022-12-06 06:30:01,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6bce64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:30:01, skipping insertion in model container [2022-12-06 06:30:01,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:00" (2/3) ... [2022-12-06 06:30:01,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6bce64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:30:01, skipping insertion in model container [2022-12-06 06:30:01,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:30:01" (3/3) ... [2022-12-06 06:30:01,440 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053_tso.oepc.i [2022-12-06 06:30:01,456 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:30:01,457 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:30:01,457 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:30:01,516 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:30:01,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 274 flow [2022-12-06 06:30:01,632 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-12-06 06:30:01,632 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:30:01,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-06 06:30:01,639 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 127 transitions, 274 flow [2022-12-06 06:30:01,645 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 123 transitions, 258 flow [2022-12-06 06:30:01,647 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:01,666 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 123 transitions, 258 flow [2022-12-06 06:30:01,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 123 transitions, 258 flow [2022-12-06 06:30:01,692 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-12-06 06:30:01,692 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:30:01,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-06 06:30:01,695 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 123 transitions, 258 flow [2022-12-06 06:30:01,695 INFO L188 LiptonReduction]: Number of co-enabled transitions 2882 [2022-12-06 06:30:06,872 INFO L203 LiptonReduction]: Total number of compositions: 96 [2022-12-06 06:30:06,887 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:30:06,893 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;@74456149, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:30:06,893 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 06:30:06,896 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-06 06:30:06,896 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:30:06,896 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:06,897 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:06,897 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:06,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:06,900 INFO L85 PathProgramCache]: Analyzing trace with hash 2080070179, now seen corresponding path program 1 times [2022-12-06 06:30:06,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:06,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350952314] [2022-12-06 06:30:06,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:06,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:07,289 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 06:30:07,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:07,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350952314] [2022-12-06 06:30:07,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350952314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:07,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:07,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:30:07,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215146081] [2022-12-06 06:30:07,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:07,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:30:07,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:07,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:30:07,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:30:07,316 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2022-12-06 06:30:07,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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 06:30:07,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:07,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2022-12-06 06:30:07,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:07,957 INFO L130 PetriNetUnfolder]: 3519/5189 cut-off events. [2022-12-06 06:30:07,957 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-12-06 06:30:07,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10169 conditions, 5189 events. 3519/5189 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 29802 event pairs, 666 based on Foata normal form. 0/4729 useless extension candidates. Maximal degree in co-relation 10157. Up to 3826 conditions per place. [2022-12-06 06:30:07,977 INFO L137 encePairwiseOnDemand]: 27/32 looper letters, 33 selfloop transitions, 2 changer transitions 6/45 dead transitions. [2022-12-06 06:30:07,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 187 flow [2022-12-06 06:30:07,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:30:07,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:30:07,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-12-06 06:30:07,986 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2022-12-06 06:30:07,987 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 58 transitions. [2022-12-06 06:30:07,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 187 flow [2022-12-06 06:30:07,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 182 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:30:07,991 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 64 flow [2022-12-06 06:30:07,992 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2022-12-06 06:30:07,994 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2022-12-06 06:30:07,994 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:07,995 INFO L89 Accepts]: Start accepts. Operand has 40 places, 26 transitions, 64 flow [2022-12-06 06:30:07,997 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:07,997 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:07,997 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 26 transitions, 64 flow [2022-12-06 06:30:08,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 26 transitions, 64 flow [2022-12-06 06:30:08,005 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-12-06 06:30:08,005 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:30:08,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 26 events. 0/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:30:08,006 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 26 transitions, 64 flow [2022-12-06 06:30:08,006 INFO L188 LiptonReduction]: Number of co-enabled transitions 342 [2022-12-06 06:30:08,052 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:08,055 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-06 06:30:08,055 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 64 flow [2022-12-06 06:30:08,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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 06:30:08,056 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:08,056 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:08,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:30:08,059 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:08,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:08,060 INFO L85 PathProgramCache]: Analyzing trace with hash 28434343, now seen corresponding path program 1 times [2022-12-06 06:30:08,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:08,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951352645] [2022-12-06 06:30:08,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:08,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:08,310 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 06:30:08,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:08,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951352645] [2022-12-06 06:30:08,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951352645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:08,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:08,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:30:08,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115899794] [2022-12-06 06:30:08,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:08,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:30:08,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:08,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:30:08,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:30:08,313 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-06 06:30:08,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:08,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:08,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-06 06:30:08,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:08,756 INFO L130 PetriNetUnfolder]: 3047/4290 cut-off events. [2022-12-06 06:30:08,756 INFO L131 PetriNetUnfolder]: For 278/278 co-relation queries the response was YES. [2022-12-06 06:30:08,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8952 conditions, 4290 events. 3047/4290 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 20025 event pairs, 1415 based on Foata normal form. 32/4310 useless extension candidates. Maximal degree in co-relation 8942. Up to 3903 conditions per place. [2022-12-06 06:30:08,785 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 37 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2022-12-06 06:30:08,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 186 flow [2022-12-06 06:30:08,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:30:08,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:30:08,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-06 06:30:08,788 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6410256410256411 [2022-12-06 06:30:08,788 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 64 flow. Second operand 3 states and 50 transitions. [2022-12-06 06:30:08,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 186 flow [2022-12-06 06:30:08,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:30:08,790 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 79 flow [2022-12-06 06:30:08,790 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2022-12-06 06:30:08,791 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, -6 predicate places. [2022-12-06 06:30:08,791 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:08,791 INFO L89 Accepts]: Start accepts. Operand has 38 places, 28 transitions, 79 flow [2022-12-06 06:30:08,792 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:08,792 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:08,792 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 28 transitions, 79 flow [2022-12-06 06:30:08,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 28 transitions, 79 flow [2022-12-06 06:30:08,798 INFO L130 PetriNetUnfolder]: 3/38 cut-off events. [2022-12-06 06:30:08,798 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:30:08,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 38 events. 3/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 77 event pairs, 1 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 53. Up to 10 conditions per place. [2022-12-06 06:30:08,799 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 28 transitions, 79 flow [2022-12-06 06:30:08,799 INFO L188 LiptonReduction]: Number of co-enabled transitions 392 [2022-12-06 06:30:08,809 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:08,810 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 06:30:08,810 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 79 flow [2022-12-06 06:30:08,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:08,811 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:08,811 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:08,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:30:08,811 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:08,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:08,812 INFO L85 PathProgramCache]: Analyzing trace with hash 881463687, now seen corresponding path program 1 times [2022-12-06 06:30:08,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:08,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583795400] [2022-12-06 06:30:08,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:08,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:09,172 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 06:30:09,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:09,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583795400] [2022-12-06 06:30:09,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583795400] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:09,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:09,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:30:09,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051185342] [2022-12-06 06:30:09,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:09,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:30:09,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:09,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:30:09,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:30:09,174 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-06 06:30:09,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 79 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:09,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:09,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-06 06:30:09,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:09,740 INFO L130 PetriNetUnfolder]: 3459/4992 cut-off events. [2022-12-06 06:30:09,740 INFO L131 PetriNetUnfolder]: For 504/504 co-relation queries the response was YES. [2022-12-06 06:30:09,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10665 conditions, 4992 events. 3459/4992 cut-off events. For 504/504 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 24978 event pairs, 1304 based on Foata normal form. 24/5004 useless extension candidates. Maximal degree in co-relation 10654. Up to 4500 conditions per place. [2022-12-06 06:30:09,763 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 36 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2022-12-06 06:30:09,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 196 flow [2022-12-06 06:30:09,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:30:09,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:30:09,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 06:30:09,764 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6025641025641025 [2022-12-06 06:30:09,764 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 79 flow. Second operand 3 states and 47 transitions. [2022-12-06 06:30:09,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 196 flow [2022-12-06 06:30:09,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 192 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:30:09,766 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 95 flow [2022-12-06 06:30:09,766 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2022-12-06 06:30:09,766 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2022-12-06 06:30:09,767 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:09,767 INFO L89 Accepts]: Start accepts. Operand has 40 places, 30 transitions, 95 flow [2022-12-06 06:30:09,767 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:09,767 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:09,768 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 30 transitions, 95 flow [2022-12-06 06:30:09,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 30 transitions, 95 flow [2022-12-06 06:30:09,774 INFO L130 PetriNetUnfolder]: 10/60 cut-off events. [2022-12-06 06:30:09,774 INFO L131 PetriNetUnfolder]: For 7/13 co-relation queries the response was YES. [2022-12-06 06:30:09,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 60 events. 10/60 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 180 event pairs, 3 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 99. Up to 19 conditions per place. [2022-12-06 06:30:09,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 30 transitions, 95 flow [2022-12-06 06:30:09,775 INFO L188 LiptonReduction]: Number of co-enabled transitions 430 [2022-12-06 06:30:09,803 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:09,804 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-06 06:30:09,804 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 95 flow [2022-12-06 06:30:09,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:09,804 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:09,804 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:09,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:30:09,804 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:09,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:09,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1775925, now seen corresponding path program 1 times [2022-12-06 06:30:09,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:09,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679569062] [2022-12-06 06:30:09,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:09,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:09,968 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 06:30:09,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:09,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679569062] [2022-12-06 06:30:09,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679569062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:09,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:09,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:30:09,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820924818] [2022-12-06 06:30:09,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:09,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:30:09,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:09,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:30:09,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:30:09,970 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-06 06:30:09,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:09,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:09,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-06 06:30:09,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:10,429 INFO L130 PetriNetUnfolder]: 3546/5119 cut-off events. [2022-12-06 06:30:10,430 INFO L131 PetriNetUnfolder]: For 1335/1335 co-relation queries the response was YES. [2022-12-06 06:30:10,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11848 conditions, 5119 events. 3546/5119 cut-off events. For 1335/1335 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 25712 event pairs, 988 based on Foata normal form. 16/5119 useless extension candidates. Maximal degree in co-relation 11835. Up to 3852 conditions per place. [2022-12-06 06:30:10,455 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 45 selfloop transitions, 8 changer transitions 0/57 dead transitions. [2022-12-06 06:30:10,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 57 transitions, 271 flow [2022-12-06 06:30:10,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:30:10,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:30:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-06 06:30:10,457 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6057692307692307 [2022-12-06 06:30:10,457 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 95 flow. Second operand 4 states and 63 transitions. [2022-12-06 06:30:10,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 57 transitions, 271 flow [2022-12-06 06:30:10,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:30:10,459 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 131 flow [2022-12-06 06:30:10,459 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2022-12-06 06:30:10,460 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, -1 predicate places. [2022-12-06 06:30:10,460 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:10,460 INFO L89 Accepts]: Start accepts. Operand has 43 places, 34 transitions, 131 flow [2022-12-06 06:30:10,461 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:10,461 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:10,461 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 34 transitions, 131 flow [2022-12-06 06:30:10,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 131 flow [2022-12-06 06:30:10,487 INFO L130 PetriNetUnfolder]: 87/223 cut-off events. [2022-12-06 06:30:10,487 INFO L131 PetriNetUnfolder]: For 79/80 co-relation queries the response was YES. [2022-12-06 06:30:10,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 223 events. 87/223 cut-off events. For 79/80 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1086 event pairs, 35 based on Foata normal form. 1/206 useless extension candidates. Maximal degree in co-relation 490. Up to 105 conditions per place. [2022-12-06 06:30:10,489 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 131 flow [2022-12-06 06:30:10,489 INFO L188 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-06 06:30:10,606 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [368] L764-->L767: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [423] $Ultimate##0-->L794: Formula: (and (= v_~y$r_buff0_thd3~0_48 1) (= v_~y$r_buff0_thd4~0_41 v_~y$r_buff1_thd4~0_39) (= v_~y$w_buff0_used~0_156 v_~y$w_buff1_used~0_134) (= 2 v_~y$w_buff0~0_83) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~y$r_buff0_thd3~0_49 v_~y$r_buff1_thd3~0_31) (= v_~y$w_buff0_used~0_155 1) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|) (= v_~y$r_buff0_thd2~0_31 v_~y$r_buff1_thd2~0_31) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_155 256) 0)) (not (= (mod v_~y$w_buff1_used~0_134 256) 0)))) 1 0)) (= v_~y$w_buff0~0_84 v_~y$w_buff1~0_74) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_7| |v_P2Thread1of1ForFork1_~arg#1.offset_7|) (= v_~y$r_buff0_thd1~0_13 v_~y$r_buff1_thd1~0_11) (= |v_P2Thread1of1ForFork1_#in~arg#1.base_7| |v_P2Thread1of1ForFork1_~arg#1.base_7|) (= v_~y$r_buff0_thd0~0_67 v_~y$r_buff1_thd0~0_57)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_41, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_156, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_49, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_67, ~y$w_buff0~0=v_~y$w_buff0~0_84, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_31, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_13, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_155, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_7|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_31, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_41, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_31, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff1~0=v_~y$w_buff1~0_74, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_48, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_67, ~y$w_buff0~0=v_~y$w_buff0~0_83, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_31, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_13, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_57, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_134} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-06 06:30:10,699 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [368] L764-->L767: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [283] L853-->L859: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd0~0_50 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_127 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd0~0_44 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_111 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_128 256) 0)) .cse5))) (and (= v_~y~0_89 (ite .cse0 v_~y$w_buff0~0_59 (ite .cse1 v_~y$w_buff1~0_54 v_~y~0_90))) (= v_~y$w_buff1_used~0_110 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_111)) (= v_~y$r_buff1_thd0~0_43 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_49 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_110 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_44)) (= (ite .cse2 0 v_~y$r_buff0_thd0~0_50) v_~y$r_buff0_thd0~0_49) (= (ite .cse0 0 v_~y$w_buff0_used~0_128) v_~y$w_buff0_used~0_127)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_128, ~y$w_buff1~0=v_~y$w_buff1~0_54, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_59, ~y~0=v_~y~0_90, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_44, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_111} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_127, ~y$w_buff1~0=v_~y$w_buff1~0_54, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_49, ~y$w_buff0~0=v_~y$w_buff0~0_59, ~y~0=v_~y~0_89, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_43, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_110} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 06:30:10,805 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [368] L764-->L767: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [384] L817-->L824: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_95 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_85 256) 0)) .cse3)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_96 256) 0))))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_24) v_~y$r_buff0_thd4~0_23) (= v_~y$w_buff1_used~0_84 (ite (or .cse1 .cse0) 0 v_~y$w_buff1_used~0_85)) (= v_~y~0_69 (ite .cse2 v_~y$w_buff0~0_39 (ite .cse1 v_~y$w_buff1~0_38 v_~y~0_70))) (= (ite .cse2 0 v_~y$w_buff0_used~0_96) v_~y$w_buff0_used~0_95) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~y$r_buff0_thd4~0_23 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_24, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_96, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_70, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_85} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_23, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_95, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_69, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:30:10,864 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:30:10,865 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 405 [2022-12-06 06:30:10,865 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 140 flow [2022-12-06 06:30:10,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:10,865 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:10,865 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:10,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:30:10,865 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:10,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:10,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1523956170, now seen corresponding path program 1 times [2022-12-06 06:30:10,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:10,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31004847] [2022-12-06 06:30:10,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:10,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:11,127 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 06:30:11,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:11,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31004847] [2022-12-06 06:30:11,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31004847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:11,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:11,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:30:11,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256691631] [2022-12-06 06:30:11,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:11,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:30:11,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:11,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:30:11,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:30:11,129 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-06 06:30:11,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:11,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:11,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-06 06:30:11,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:11,612 INFO L130 PetriNetUnfolder]: 3306/4767 cut-off events. [2022-12-06 06:30:11,612 INFO L131 PetriNetUnfolder]: For 3677/3709 co-relation queries the response was YES. [2022-12-06 06:30:11,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12508 conditions, 4767 events. 3306/4767 cut-off events. For 3677/3709 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 23836 event pairs, 916 based on Foata normal form. 52/4795 useless extension candidates. Maximal degree in co-relation 12493. Up to 3804 conditions per place. [2022-12-06 06:30:11,660 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 38 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2022-12-06 06:30:11,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 46 transitions, 262 flow [2022-12-06 06:30:11,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:30:11,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:30:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-06 06:30:11,665 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5444444444444444 [2022-12-06 06:30:11,665 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 140 flow. Second operand 3 states and 49 transitions. [2022-12-06 06:30:11,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 46 transitions, 262 flow [2022-12-06 06:30:11,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 252 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 06:30:11,670 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 144 flow [2022-12-06 06:30:11,671 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2022-12-06 06:30:11,672 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2022-12-06 06:30:11,673 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:11,673 INFO L89 Accepts]: Start accepts. Operand has 44 places, 33 transitions, 144 flow [2022-12-06 06:30:11,674 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:11,674 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:11,674 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 33 transitions, 144 flow [2022-12-06 06:30:11,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 144 flow [2022-12-06 06:30:11,697 INFO L130 PetriNetUnfolder]: 66/180 cut-off events. [2022-12-06 06:30:11,697 INFO L131 PetriNetUnfolder]: For 189/206 co-relation queries the response was YES. [2022-12-06 06:30:11,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 180 events. 66/180 cut-off events. For 189/206 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 845 event pairs, 27 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 427. Up to 89 conditions per place. [2022-12-06 06:30:11,699 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 144 flow [2022-12-06 06:30:11,700 INFO L188 LiptonReduction]: Number of co-enabled transitions 450 [2022-12-06 06:30:11,707 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:11,709 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 06:30:11,710 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 144 flow [2022-12-06 06:30:11,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:11,710 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:11,710 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:11,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:30:11,710 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:11,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:11,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1777630, now seen corresponding path program 1 times [2022-12-06 06:30:11,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:11,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713259749] [2022-12-06 06:30:11,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:11,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:12,218 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 06:30:12,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:12,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713259749] [2022-12-06 06:30:12,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713259749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:12,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:12,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:30:12,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671836544] [2022-12-06 06:30:12,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:12,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:30:12,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:12,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:30:12,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:30:12,222 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-06 06:30:12,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 06:30:12,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:12,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-06 06:30:12,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:12,858 INFO L130 PetriNetUnfolder]: 3394/4991 cut-off events. [2022-12-06 06:30:12,858 INFO L131 PetriNetUnfolder]: For 4888/4956 co-relation queries the response was YES. [2022-12-06 06:30:12,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13270 conditions, 4991 events. 3394/4991 cut-off events. For 4888/4956 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 26764 event pairs, 510 based on Foata normal form. 32/5007 useless extension candidates. Maximal degree in co-relation 13253. Up to 4063 conditions per place. [2022-12-06 06:30:12,890 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 46 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2022-12-06 06:30:12,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 59 transitions, 330 flow [2022-12-06 06:30:12,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:30:12,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:30:12,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-12-06 06:30:12,892 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-06 06:30:12,892 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 144 flow. Second operand 4 states and 65 transitions. [2022-12-06 06:30:12,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 59 transitions, 330 flow [2022-12-06 06:30:12,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 318 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:30:12,896 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 172 flow [2022-12-06 06:30:12,896 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2022-12-06 06:30:12,897 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2022-12-06 06:30:12,897 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:12,897 INFO L89 Accepts]: Start accepts. Operand has 45 places, 36 transitions, 172 flow [2022-12-06 06:30:12,898 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:12,898 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:12,898 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 36 transitions, 172 flow [2022-12-06 06:30:12,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 172 flow [2022-12-06 06:30:12,930 INFO L130 PetriNetUnfolder]: 120/262 cut-off events. [2022-12-06 06:30:12,930 INFO L131 PetriNetUnfolder]: For 416/452 co-relation queries the response was YES. [2022-12-06 06:30:12,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 262 events. 120/262 cut-off events. For 416/452 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1258 event pairs, 53 based on Foata normal form. 1/225 useless extension candidates. Maximal degree in co-relation 760. Up to 132 conditions per place. [2022-12-06 06:30:12,933 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 36 transitions, 172 flow [2022-12-06 06:30:12,933 INFO L188 LiptonReduction]: Number of co-enabled transitions 504 [2022-12-06 06:30:12,939 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:12,940 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-06 06:30:12,940 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 172 flow [2022-12-06 06:30:12,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 06:30:12,940 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:12,940 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:12,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:30:12,941 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:12,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:12,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1780358, now seen corresponding path program 1 times [2022-12-06 06:30:12,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:12,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785440578] [2022-12-06 06:30:12,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:12,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:13,228 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 06:30:13,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:13,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785440578] [2022-12-06 06:30:13,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785440578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:13,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:13,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:30:13,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522208024] [2022-12-06 06:30:13,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:13,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:30:13,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:13,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:30:13,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:30:13,230 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-06 06:30:13,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:13,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:13,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-06 06:30:13,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:13,809 INFO L130 PetriNetUnfolder]: 3551/5212 cut-off events. [2022-12-06 06:30:13,809 INFO L131 PetriNetUnfolder]: For 5739/5796 co-relation queries the response was YES. [2022-12-06 06:30:13,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15059 conditions, 5212 events. 3551/5212 cut-off events. For 5739/5796 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 27808 event pairs, 598 based on Foata normal form. 42/5234 useless extension candidates. Maximal degree in co-relation 15042. Up to 3997 conditions per place. [2022-12-06 06:30:13,861 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 48 selfloop transitions, 8 changer transitions 0/60 dead transitions. [2022-12-06 06:30:13,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 60 transitions, 358 flow [2022-12-06 06:30:13,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:30:13,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:30:13,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-06 06:30:13,864 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-12-06 06:30:13,864 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 172 flow. Second operand 4 states and 63 transitions. [2022-12-06 06:30:13,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 60 transitions, 358 flow [2022-12-06 06:30:13,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 342 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:30:13,873 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 205 flow [2022-12-06 06:30:13,873 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=205, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2022-12-06 06:30:13,874 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2022-12-06 06:30:13,874 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:13,874 INFO L89 Accepts]: Start accepts. Operand has 47 places, 40 transitions, 205 flow [2022-12-06 06:30:13,875 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:13,875 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:13,875 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 40 transitions, 205 flow [2022-12-06 06:30:13,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 40 transitions, 205 flow [2022-12-06 06:30:13,930 INFO L130 PetriNetUnfolder]: 157/307 cut-off events. [2022-12-06 06:30:13,930 INFO L131 PetriNetUnfolder]: For 517/593 co-relation queries the response was YES. [2022-12-06 06:30:13,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 307 events. 157/307 cut-off events. For 517/593 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1482 event pairs, 51 based on Foata normal form. 2/271 useless extension candidates. Maximal degree in co-relation 1021. Up to 174 conditions per place. [2022-12-06 06:30:13,936 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 40 transitions, 205 flow [2022-12-06 06:30:13,936 INFO L188 LiptonReduction]: Number of co-enabled transitions 562 [2022-12-06 06:30:13,941 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [511] L764-->L794: Formula: (and (= v_~y~0_495 1) (= 2 v_~y$w_buff0~0_411) (= v_~y$r_buff0_thd3~0_166 1) (= v_~y$r_buff0_thd2~0_113 v_~y$r_buff1_thd2~0_114) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_59| 0)) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_59| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_59|) (= v_~y$w_buff0_used~0_581 1) (= |v_P2Thread1of1ForFork1_~arg#1.base_57| |v_P2Thread1of1ForFork1_#in~arg#1.base_57|) (= v_~y$r_buff0_thd3~0_167 v_~y$r_buff1_thd3~0_117) (= v_~y$r_buff0_thd1~0_51 v_~y$r_buff1_thd1~0_49) (= v_~y$w_buff0_used~0_582 v_~y$w_buff1_used~0_530) (= v_~y$w_buff1~0_374 v_~y$w_buff0~0_412) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_57| |v_P2Thread1of1ForFork1_~arg#1.offset_57|) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_581 256) 0)) (not (= (mod v_~y$w_buff1_used~0_530 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_59|) (= v_~y$r_buff0_thd0~0_307 v_~y$r_buff1_thd0~0_313) (= v_~y$r_buff0_thd4~0_151 v_~y$r_buff1_thd4~0_148)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_151, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_57|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_582, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_167, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_307, ~y$w_buff0~0=v_~y$w_buff0~0_412, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_113, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_51, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_57|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_581, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_57|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_57|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_114, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_151, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_49, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_148, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_117, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_57|, ~y$w_buff1~0=v_~y$w_buff1~0_374, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_166, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_307, ~y$w_buff0~0=v_~y$w_buff0~0_411, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_57|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_113, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_51, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_59|, ~y~0=v_~y~0_495, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_313, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_59|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_530} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [369] L767-->L774: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_115 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0)))) (let ((.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_116 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_99 256) 0)) .cse2)) (.cse1 (and .cse5 .cse3))) (and (= v_~y$w_buff1_used~0_98 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_99)) (= (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_98 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0)) .cse3)) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= v_~y$w_buff0_used~0_115 (ite .cse4 0 v_~y$w_buff0_used~0_116)) (= (ite .cse4 v_~y$w_buff0~0_51 (ite .cse0 v_~y$w_buff1~0_46 v_~y~0_78)) v_~y~0_77) (= v_~y$r_buff0_thd2~0_21 (ite .cse1 0 v_~y$r_buff0_thd2~0_22))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_116, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_99} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_115, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_98} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:30:14,174 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:30:14,175 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 301 [2022-12-06 06:30:14,175 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 211 flow [2022-12-06 06:30:14,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:14,175 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:14,175 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:14,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:30:14,176 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:14,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:14,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1992398, now seen corresponding path program 2 times [2022-12-06 06:30:14,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:14,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796938187] [2022-12-06 06:30:14,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:14,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:14,630 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 06:30:14,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:14,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796938187] [2022-12-06 06:30:14,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796938187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:14,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:14,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:30:14,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953982700] [2022-12-06 06:30:14,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:14,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:30:14,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:14,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:30:14,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:30:14,633 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-06 06:30:14,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 06:30:14,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:14,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-06 06:30:14,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:15,264 INFO L130 PetriNetUnfolder]: 3851/5712 cut-off events. [2022-12-06 06:30:15,264 INFO L131 PetriNetUnfolder]: For 9499/9632 co-relation queries the response was YES. [2022-12-06 06:30:15,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18030 conditions, 5712 events. 3851/5712 cut-off events. For 9499/9632 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 32035 event pairs, 710 based on Foata normal form. 82/5718 useless extension candidates. Maximal degree in co-relation 18012. Up to 3555 conditions per place. [2022-12-06 06:30:15,301 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 51 selfloop transitions, 12 changer transitions 0/67 dead transitions. [2022-12-06 06:30:15,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 67 transitions, 435 flow [2022-12-06 06:30:15,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:30:15,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:30:15,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-06 06:30:15,302 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5403225806451613 [2022-12-06 06:30:15,302 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 211 flow. Second operand 4 states and 67 transitions. [2022-12-06 06:30:15,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 67 transitions, 435 flow [2022-12-06 06:30:15,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 415 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 06:30:15,311 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 253 flow [2022-12-06 06:30:15,311 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2022-12-06 06:30:15,311 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2022-12-06 06:30:15,312 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:15,312 INFO L89 Accepts]: Start accepts. Operand has 49 places, 43 transitions, 253 flow [2022-12-06 06:30:15,312 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:15,312 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:15,312 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 43 transitions, 253 flow [2022-12-06 06:30:15,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 43 transitions, 253 flow [2022-12-06 06:30:15,343 INFO L130 PetriNetUnfolder]: 166/340 cut-off events. [2022-12-06 06:30:15,343 INFO L131 PetriNetUnfolder]: For 891/1083 co-relation queries the response was YES. [2022-12-06 06:30:15,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1301 conditions, 340 events. 166/340 cut-off events. For 891/1083 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1782 event pairs, 51 based on Foata normal form. 13/310 useless extension candidates. Maximal degree in co-relation 1285. Up to 192 conditions per place. [2022-12-06 06:30:15,347 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 43 transitions, 253 flow [2022-12-06 06:30:15,347 INFO L188 LiptonReduction]: Number of co-enabled transitions 608 [2022-12-06 06:30:15,351 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:15,352 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 06:30:15,352 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 253 flow [2022-12-06 06:30:15,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 06:30:15,352 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:15,352 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:15,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:30:15,352 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:15,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:15,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1780482, now seen corresponding path program 1 times [2022-12-06 06:30:15,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:15,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477681389] [2022-12-06 06:30:15,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:15,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:15,577 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 06:30:15,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:15,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477681389] [2022-12-06 06:30:15,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477681389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:15,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:15,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:30:15,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553181981] [2022-12-06 06:30:15,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:15,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:30:15,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:15,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:30:15,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:30:15,579 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-06 06:30:15,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:15,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:15,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-06 06:30:15,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:16,176 INFO L130 PetriNetUnfolder]: 4117/6090 cut-off events. [2022-12-06 06:30:16,176 INFO L131 PetriNetUnfolder]: For 14462/14696 co-relation queries the response was YES. [2022-12-06 06:30:16,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20934 conditions, 6090 events. 4117/6090 cut-off events. For 14462/14696 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 33918 event pairs, 534 based on Foata normal form. 80/6150 useless extension candidates. Maximal degree in co-relation 20915. Up to 3635 conditions per place. [2022-12-06 06:30:16,227 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 51 selfloop transitions, 14 changer transitions 0/69 dead transitions. [2022-12-06 06:30:16,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 69 transitions, 483 flow [2022-12-06 06:30:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:30:16,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:30:16,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-06 06:30:16,229 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5403225806451613 [2022-12-06 06:30:16,229 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 253 flow. Second operand 4 states and 67 transitions. [2022-12-06 06:30:16,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 69 transitions, 483 flow [2022-12-06 06:30:16,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 69 transitions, 469 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:30:16,238 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 304 flow [2022-12-06 06:30:16,238 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=304, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2022-12-06 06:30:16,239 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2022-12-06 06:30:16,239 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:16,239 INFO L89 Accepts]: Start accepts. Operand has 51 places, 45 transitions, 304 flow [2022-12-06 06:30:16,240 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:16,240 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:16,240 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 45 transitions, 304 flow [2022-12-06 06:30:16,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 45 transitions, 304 flow [2022-12-06 06:30:16,282 INFO L130 PetriNetUnfolder]: 174/364 cut-off events. [2022-12-06 06:30:16,282 INFO L131 PetriNetUnfolder]: For 1333/1728 co-relation queries the response was YES. [2022-12-06 06:30:16,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1554 conditions, 364 events. 174/364 cut-off events. For 1333/1728 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1961 event pairs, 45 based on Foata normal form. 20/341 useless extension candidates. Maximal degree in co-relation 1537. Up to 208 conditions per place. [2022-12-06 06:30:16,287 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 45 transitions, 304 flow [2022-12-06 06:30:16,288 INFO L188 LiptonReduction]: Number of co-enabled transitions 640 [2022-12-06 06:30:16,293 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:16,294 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-06 06:30:16,294 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 304 flow [2022-12-06 06:30:16,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:16,295 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:16,295 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:16,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:30:16,295 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:16,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:16,296 INFO L85 PathProgramCache]: Analyzing trace with hash 61761377, now seen corresponding path program 1 times [2022-12-06 06:30:16,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:16,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698548360] [2022-12-06 06:30:16,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:16,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:16,625 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 06:30:16,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:16,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698548360] [2022-12-06 06:30:16,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698548360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:16,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:16,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:30:16,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678880164] [2022-12-06 06:30:16,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:16,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:30:16,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:16,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:30:16,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:30:16,627 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-06 06:30:16,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 304 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:16,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:16,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-06 06:30:16,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:17,222 INFO L130 PetriNetUnfolder]: 4209/6246 cut-off events. [2022-12-06 06:30:17,222 INFO L131 PetriNetUnfolder]: For 20530/20885 co-relation queries the response was YES. [2022-12-06 06:30:17,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23257 conditions, 6246 events. 4209/6246 cut-off events. For 20530/20885 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 35232 event pairs, 534 based on Foata normal form. 134/6360 useless extension candidates. Maximal degree in co-relation 23237. Up to 3695 conditions per place. [2022-12-06 06:30:17,258 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 60 selfloop transitions, 19 changer transitions 0/83 dead transitions. [2022-12-06 06:30:17,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 83 transitions, 627 flow [2022-12-06 06:30:17,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:30:17,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:30:17,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-12-06 06:30:17,259 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5290322580645161 [2022-12-06 06:30:17,259 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 304 flow. Second operand 5 states and 82 transitions. [2022-12-06 06:30:17,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 83 transitions, 627 flow [2022-12-06 06:30:17,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 83 transitions, 609 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:30:17,265 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 397 flow [2022-12-06 06:30:17,266 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=397, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2022-12-06 06:30:17,267 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places. [2022-12-06 06:30:17,267 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:17,267 INFO L89 Accepts]: Start accepts. Operand has 54 places, 50 transitions, 397 flow [2022-12-06 06:30:17,269 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:17,269 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:17,269 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 50 transitions, 397 flow [2022-12-06 06:30:17,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 50 transitions, 397 flow [2022-12-06 06:30:17,305 INFO L130 PetriNetUnfolder]: 180/382 cut-off events. [2022-12-06 06:30:17,306 INFO L131 PetriNetUnfolder]: For 2006/2572 co-relation queries the response was YES. [2022-12-06 06:30:17,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1791 conditions, 382 events. 180/382 cut-off events. For 2006/2572 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2076 event pairs, 47 based on Foata normal form. 22/361 useless extension candidates. Maximal degree in co-relation 1773. Up to 220 conditions per place. [2022-12-06 06:30:17,309 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 50 transitions, 397 flow [2022-12-06 06:30:17,309 INFO L188 LiptonReduction]: Number of co-enabled transitions 698 [2022-12-06 06:30:17,315 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:17,316 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 06:30:17,316 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 397 flow [2022-12-06 06:30:17,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:17,316 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:17,316 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:17,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:30:17,316 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:17,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:17,317 INFO L85 PathProgramCache]: Analyzing trace with hash 61925708, now seen corresponding path program 1 times [2022-12-06 06:30:17,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:17,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263710185] [2022-12-06 06:30:17,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:17,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:17,697 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 06:30:17,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:17,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263710185] [2022-12-06 06:30:17,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263710185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:17,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:17,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:30:17,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971103900] [2022-12-06 06:30:17,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:17,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:30:17,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:17,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:30:17,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:30:17,698 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-06 06:30:17,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 397 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:17,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:17,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-06 06:30:17,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:18,423 INFO L130 PetriNetUnfolder]: 4317/6410 cut-off events. [2022-12-06 06:30:18,424 INFO L131 PetriNetUnfolder]: For 26586/27085 co-relation queries the response was YES. [2022-12-06 06:30:18,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25548 conditions, 6410 events. 4317/6410 cut-off events. For 26586/27085 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 35847 event pairs, 400 based on Foata normal form. 154/6552 useless extension candidates. Maximal degree in co-relation 25527. Up to 4334 conditions per place. [2022-12-06 06:30:18,456 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 78 selfloop transitions, 35 changer transitions 0/117 dead transitions. [2022-12-06 06:30:18,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 117 transitions, 1006 flow [2022-12-06 06:30:18,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:30:18,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:30:18,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-12-06 06:30:18,457 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.511520737327189 [2022-12-06 06:30:18,457 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 397 flow. Second operand 7 states and 111 transitions. [2022-12-06 06:30:18,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 117 transitions, 1006 flow [2022-12-06 06:30:18,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 117 transitions, 941 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 06:30:18,471 INFO L231 Difference]: Finished difference. Result has 60 places, 69 transitions, 688 flow [2022-12-06 06:30:18,471 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=688, PETRI_PLACES=60, PETRI_TRANSITIONS=69} [2022-12-06 06:30:18,471 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 16 predicate places. [2022-12-06 06:30:18,471 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:18,472 INFO L89 Accepts]: Start accepts. Operand has 60 places, 69 transitions, 688 flow [2022-12-06 06:30:18,472 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:18,472 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:18,472 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 69 transitions, 688 flow [2022-12-06 06:30:18,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 69 transitions, 688 flow [2022-12-06 06:30:18,510 INFO L130 PetriNetUnfolder]: 186/406 cut-off events. [2022-12-06 06:30:18,511 INFO L131 PetriNetUnfolder]: For 2390/2981 co-relation queries the response was YES. [2022-12-06 06:30:18,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2070 conditions, 406 events. 186/406 cut-off events. For 2390/2981 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2275 event pairs, 29 based on Foata normal form. 25/392 useless extension candidates. Maximal degree in co-relation 2049. Up to 232 conditions per place. [2022-12-06 06:30:18,515 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 69 transitions, 688 flow [2022-12-06 06:30:18,515 INFO L188 LiptonReduction]: Number of co-enabled transitions 908 [2022-12-06 06:30:18,519 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:18,520 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 06:30:18,520 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 69 transitions, 688 flow [2022-12-06 06:30:18,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:18,520 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:18,520 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:18,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:30:18,520 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:18,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:18,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1708214653, now seen corresponding path program 1 times [2022-12-06 06:30:18,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:18,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747827359] [2022-12-06 06:30:18,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:18,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:18,616 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 06:30:18,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:18,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747827359] [2022-12-06 06:30:18,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747827359] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:18,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:18,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:30:18,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694742172] [2022-12-06 06:30:18,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:18,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:30:18,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:18,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:30:18,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:30:18,618 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-06 06:30:18,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 69 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:18,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:18,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-06 06:30:18,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:19,035 INFO L130 PetriNetUnfolder]: 2834/4268 cut-off events. [2022-12-06 06:30:19,036 INFO L131 PetriNetUnfolder]: For 23775/23775 co-relation queries the response was YES. [2022-12-06 06:30:19,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18515 conditions, 4268 events. 2834/4268 cut-off events. For 23775/23775 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 23066 event pairs, 557 based on Foata normal form. 122/4361 useless extension candidates. Maximal degree in co-relation 18491. Up to 3560 conditions per place. [2022-12-06 06:30:19,062 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 100 selfloop transitions, 5 changer transitions 0/111 dead transitions. [2022-12-06 06:30:19,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 111 transitions, 1309 flow [2022-12-06 06:30:19,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:30:19,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:30:19,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-06 06:30:19,064 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6559139784946236 [2022-12-06 06:30:19,064 INFO L175 Difference]: Start difference. First operand has 60 places, 69 transitions, 688 flow. Second operand 3 states and 61 transitions. [2022-12-06 06:30:19,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 111 transitions, 1309 flow [2022-12-06 06:30:19,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 111 transitions, 1257 flow, removed 26 selfloop flow, removed 0 redundant places. [2022-12-06 06:30:19,080 INFO L231 Difference]: Finished difference. Result has 63 places, 73 transitions, 683 flow [2022-12-06 06:30:19,081 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=683, PETRI_PLACES=63, PETRI_TRANSITIONS=73} [2022-12-06 06:30:19,081 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2022-12-06 06:30:19,081 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:19,082 INFO L89 Accepts]: Start accepts. Operand has 63 places, 73 transitions, 683 flow [2022-12-06 06:30:19,082 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:19,082 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:19,082 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 73 transitions, 683 flow [2022-12-06 06:30:19,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 73 transitions, 683 flow [2022-12-06 06:30:19,191 INFO L130 PetriNetUnfolder]: 488/960 cut-off events. [2022-12-06 06:30:19,191 INFO L131 PetriNetUnfolder]: For 4201/4787 co-relation queries the response was YES. [2022-12-06 06:30:19,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4137 conditions, 960 events. 488/960 cut-off events. For 4201/4787 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 6197 event pairs, 167 based on Foata normal form. 52/893 useless extension candidates. Maximal degree in co-relation 4113. Up to 438 conditions per place. [2022-12-06 06:30:19,202 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 73 transitions, 683 flow [2022-12-06 06:30:19,203 INFO L188 LiptonReduction]: Number of co-enabled transitions 1002 [2022-12-06 06:30:19,207 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [508] L848-3-->L853: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_8| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_8|) (= v_~main$tmp_guard0~0_Out_8 (ite (= (ite (= v_~__unbuffered_cnt~0_In_2 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (mod v_~main$tmp_guard0~0_Out_8 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_2} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_18|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_Out_22|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_2, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_Out_8, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [512] L764-->L859: Formula: (let ((.cse2 (not (= 0 (mod v_~y$r_buff1_thd0~0_316 256)))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_585 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_310 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_586 256) 0)))) (.cse1 (and .cse3 .cse5)) (.cse4 (and .cse2 (not (= (mod v_~y$w_buff1_used~0_533 256) 0))))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_586) v_~y$w_buff0_used~0_585) (= v_~y$r_buff0_thd0~0_309 (ite .cse1 0 v_~y$r_buff0_thd0~0_310)) (= v_~y$r_buff1_thd0~0_315 (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_532 256) 0))) (and .cse3 (not (= (mod v_~y$r_buff0_thd0~0_309 256) 0)))) 0 v_~y$r_buff1_thd0~0_316)) (= v_~y~0_497 (ite .cse0 v_~y$w_buff0~0_415 (ite .cse4 v_~y$w_buff1~0_376 1))) (= v_~y$w_buff1_used~0_532 (ite (or .cse1 .cse4) 0 v_~y$w_buff1_used~0_533))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_586, ~y$w_buff1~0=v_~y$w_buff1~0_376, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_310, ~y$w_buff0~0=v_~y$w_buff0~0_415, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_316, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_533} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_585, ~y$w_buff1~0=v_~y$w_buff1~0_376, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_309, ~y$w_buff0~0=v_~y$w_buff0~0_415, ~y~0=v_~y~0_497, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_315, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_532} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 06:30:19,353 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:30:19,354 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 273 [2022-12-06 06:30:19,354 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 73 transitions, 685 flow [2022-12-06 06:30:19,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:19,354 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:19,354 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:19,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:30:19,355 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:19,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:19,355 INFO L85 PathProgramCache]: Analyzing trace with hash 2128587899, now seen corresponding path program 1 times [2022-12-06 06:30:19,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:19,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912897897] [2022-12-06 06:30:19,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:19,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:19,695 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 06:30:19,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:19,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912897897] [2022-12-06 06:30:19,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912897897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:19,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:19,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:30:19,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510908027] [2022-12-06 06:30:19,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:19,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:30:19,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:19,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:30:19,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:30:19,697 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2022-12-06 06:30:19,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 73 transitions, 685 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 06:30:19,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:19,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2022-12-06 06:30:19,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:20,475 INFO L130 PetriNetUnfolder]: 3817/5949 cut-off events. [2022-12-06 06:30:20,476 INFO L131 PetriNetUnfolder]: For 31652/32022 co-relation queries the response was YES. [2022-12-06 06:30:20,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26308 conditions, 5949 events. 3817/5949 cut-off events. For 31652/32022 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 34850 event pairs, 470 based on Foata normal form. 286/6233 useless extension candidates. Maximal degree in co-relation 26281. Up to 2717 conditions per place. [2022-12-06 06:30:20,530 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 83 selfloop transitions, 44 changer transitions 0/131 dead transitions. [2022-12-06 06:30:20,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 131 transitions, 1296 flow [2022-12-06 06:30:20,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:30:20,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:30:20,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-12-06 06:30:20,532 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4635416666666667 [2022-12-06 06:30:20,533 INFO L175 Difference]: Start difference. First operand has 63 places, 73 transitions, 685 flow. Second operand 6 states and 89 transitions. [2022-12-06 06:30:20,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 131 transitions, 1296 flow [2022-12-06 06:30:20,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 131 transitions, 1280 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:30:20,578 INFO L231 Difference]: Finished difference. Result has 69 places, 86 transitions, 1001 flow [2022-12-06 06:30:20,578 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1001, PETRI_PLACES=69, PETRI_TRANSITIONS=86} [2022-12-06 06:30:20,579 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 25 predicate places. [2022-12-06 06:30:20,579 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:20,579 INFO L89 Accepts]: Start accepts. Operand has 69 places, 86 transitions, 1001 flow [2022-12-06 06:30:20,580 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:20,580 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:20,580 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 86 transitions, 1001 flow [2022-12-06 06:30:20,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 86 transitions, 1001 flow [2022-12-06 06:30:20,685 INFO L130 PetriNetUnfolder]: 640/1288 cut-off events. [2022-12-06 06:30:20,685 INFO L131 PetriNetUnfolder]: For 7261/8087 co-relation queries the response was YES. [2022-12-06 06:30:20,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6042 conditions, 1288 events. 640/1288 cut-off events. For 7261/8087 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 9002 event pairs, 182 based on Foata normal form. 55/1171 useless extension candidates. Maximal degree in co-relation 6015. Up to 566 conditions per place. [2022-12-06 06:30:20,698 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 86 transitions, 1001 flow [2022-12-06 06:30:20,698 INFO L188 LiptonReduction]: Number of co-enabled transitions 1174 [2022-12-06 06:30:20,703 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:20,704 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-06 06:30:20,704 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 86 transitions, 1001 flow [2022-12-06 06:30:20,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 06:30:20,704 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:20,704 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:20,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:30:20,704 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:20,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:20,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1614806279, now seen corresponding path program 1 times [2022-12-06 06:30:20,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:20,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463784316] [2022-12-06 06:30:20,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:20,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:20,785 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 06:30:20,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:20,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463784316] [2022-12-06 06:30:20,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463784316] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:20,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:20,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:30:20,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161829922] [2022-12-06 06:30:20,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:20,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:30:20,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:20,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:30:20,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:30:20,787 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2022-12-06 06:30:20,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 86 transitions, 1001 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 06:30:20,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:20,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2022-12-06 06:30:20,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:21,144 INFO L130 PetriNetUnfolder]: 1947/3144 cut-off events. [2022-12-06 06:30:21,144 INFO L131 PetriNetUnfolder]: For 25450/25559 co-relation queries the response was YES. [2022-12-06 06:30:21,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15839 conditions, 3144 events. 1947/3144 cut-off events. For 25450/25559 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 17439 event pairs, 317 based on Foata normal form. 283/3388 useless extension candidates. Maximal degree in co-relation 15809. Up to 1525 conditions per place. [2022-12-06 06:30:21,161 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 142 selfloop transitions, 9 changer transitions 0/157 dead transitions. [2022-12-06 06:30:21,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 157 transitions, 2132 flow [2022-12-06 06:30:21,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:30:21,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:30:21,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-12-06 06:30:21,162 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.65625 [2022-12-06 06:30:21,162 INFO L175 Difference]: Start difference. First operand has 69 places, 86 transitions, 1001 flow. Second operand 4 states and 84 transitions. [2022-12-06 06:30:21,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 157 transitions, 2132 flow [2022-12-06 06:30:21,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 157 transitions, 1991 flow, removed 60 selfloop flow, removed 2 redundant places. [2022-12-06 06:30:21,185 INFO L231 Difference]: Finished difference. Result has 71 places, 81 transitions, 847 flow [2022-12-06 06:30:21,185 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=847, PETRI_PLACES=71, PETRI_TRANSITIONS=81} [2022-12-06 06:30:21,185 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 27 predicate places. [2022-12-06 06:30:21,186 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:21,186 INFO L89 Accepts]: Start accepts. Operand has 71 places, 81 transitions, 847 flow [2022-12-06 06:30:21,187 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:21,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:21,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 81 transitions, 847 flow [2022-12-06 06:30:21,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 81 transitions, 847 flow [2022-12-06 06:30:21,265 INFO L130 PetriNetUnfolder]: 318/731 cut-off events. [2022-12-06 06:30:21,266 INFO L131 PetriNetUnfolder]: For 4327/5055 co-relation queries the response was YES. [2022-12-06 06:30:21,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3728 conditions, 731 events. 318/731 cut-off events. For 4327/5055 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4707 event pairs, 57 based on Foata normal form. 40/708 useless extension candidates. Maximal degree in co-relation 3700. Up to 320 conditions per place. [2022-12-06 06:30:21,277 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 81 transitions, 847 flow [2022-12-06 06:30:21,277 INFO L188 LiptonReduction]: Number of co-enabled transitions 1102 [2022-12-06 06:30:21,313 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [512] L764-->L859: Formula: (let ((.cse2 (not (= 0 (mod v_~y$r_buff1_thd0~0_316 256)))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_585 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_310 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_586 256) 0)))) (.cse1 (and .cse3 .cse5)) (.cse4 (and .cse2 (not (= (mod v_~y$w_buff1_used~0_533 256) 0))))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_586) v_~y$w_buff0_used~0_585) (= v_~y$r_buff0_thd0~0_309 (ite .cse1 0 v_~y$r_buff0_thd0~0_310)) (= v_~y$r_buff1_thd0~0_315 (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_532 256) 0))) (and .cse3 (not (= (mod v_~y$r_buff0_thd0~0_309 256) 0)))) 0 v_~y$r_buff1_thd0~0_316)) (= v_~y~0_497 (ite .cse0 v_~y$w_buff0~0_415 (ite .cse4 v_~y$w_buff1~0_376 1))) (= v_~y$w_buff1_used~0_532 (ite (or .cse1 .cse4) 0 v_~y$w_buff1_used~0_533))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_586, ~y$w_buff1~0=v_~y$w_buff1~0_376, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_310, ~y$w_buff0~0=v_~y$w_buff0~0_415, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_316, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_533} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_585, ~y$w_buff1~0=v_~y$w_buff1~0_376, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_309, ~y$w_buff0~0=v_~y$w_buff0~0_415, ~y~0=v_~y~0_497, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_315, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_532} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [369] L767-->L774: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_115 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0)))) (let ((.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_116 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_99 256) 0)) .cse2)) (.cse1 (and .cse5 .cse3))) (and (= v_~y$w_buff1_used~0_98 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_99)) (= (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_98 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0)) .cse3)) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= v_~y$w_buff0_used~0_115 (ite .cse4 0 v_~y$w_buff0_used~0_116)) (= (ite .cse4 v_~y$w_buff0~0_51 (ite .cse0 v_~y$w_buff1~0_46 v_~y~0_78)) v_~y~0_77) (= v_~y$r_buff0_thd2~0_21 (ite .cse1 0 v_~y$r_buff0_thd2~0_22))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_116, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_99} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_115, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_98} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:30:21,448 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [512] L764-->L859: Formula: (let ((.cse2 (not (= 0 (mod v_~y$r_buff1_thd0~0_316 256)))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_585 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_310 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_586 256) 0)))) (.cse1 (and .cse3 .cse5)) (.cse4 (and .cse2 (not (= (mod v_~y$w_buff1_used~0_533 256) 0))))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_586) v_~y$w_buff0_used~0_585) (= v_~y$r_buff0_thd0~0_309 (ite .cse1 0 v_~y$r_buff0_thd0~0_310)) (= v_~y$r_buff1_thd0~0_315 (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_532 256) 0))) (and .cse3 (not (= (mod v_~y$r_buff0_thd0~0_309 256) 0)))) 0 v_~y$r_buff1_thd0~0_316)) (= v_~y~0_497 (ite .cse0 v_~y$w_buff0~0_415 (ite .cse4 v_~y$w_buff1~0_376 1))) (= v_~y$w_buff1_used~0_532 (ite (or .cse1 .cse4) 0 v_~y$w_buff1_used~0_533))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_586, ~y$w_buff1~0=v_~y$w_buff1~0_376, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_310, ~y$w_buff0~0=v_~y$w_buff0~0_415, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_316, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_533} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_585, ~y$w_buff1~0=v_~y$w_buff1~0_376, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_309, ~y$w_buff0~0=v_~y$w_buff0~0_415, ~y~0=v_~y~0_497, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_315, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_532} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [423] $Ultimate##0-->L794: Formula: (and (= v_~y$r_buff0_thd3~0_48 1) (= v_~y$r_buff0_thd4~0_41 v_~y$r_buff1_thd4~0_39) (= v_~y$w_buff0_used~0_156 v_~y$w_buff1_used~0_134) (= 2 v_~y$w_buff0~0_83) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~y$r_buff0_thd3~0_49 v_~y$r_buff1_thd3~0_31) (= v_~y$w_buff0_used~0_155 1) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|) (= v_~y$r_buff0_thd2~0_31 v_~y$r_buff1_thd2~0_31) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_155 256) 0)) (not (= (mod v_~y$w_buff1_used~0_134 256) 0)))) 1 0)) (= v_~y$w_buff0~0_84 v_~y$w_buff1~0_74) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_7| |v_P2Thread1of1ForFork1_~arg#1.offset_7|) (= v_~y$r_buff0_thd1~0_13 v_~y$r_buff1_thd1~0_11) (= |v_P2Thread1of1ForFork1_#in~arg#1.base_7| |v_P2Thread1of1ForFork1_~arg#1.base_7|) (= v_~y$r_buff0_thd0~0_67 v_~y$r_buff1_thd0~0_57)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_41, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_156, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_49, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_67, ~y$w_buff0~0=v_~y$w_buff0~0_84, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_31, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_13, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_155, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_7|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_31, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_41, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_31, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff1~0=v_~y$w_buff1~0_74, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_48, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_67, ~y$w_buff0~0=v_~y$w_buff0~0_83, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_31, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_13, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_57, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_134} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-06 06:30:21,618 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [508] L848-3-->L853: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_8| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_8|) (= v_~main$tmp_guard0~0_Out_8 (ite (= (ite (= v_~__unbuffered_cnt~0_In_2 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (mod v_~main$tmp_guard0~0_Out_8 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_2} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_18|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_Out_22|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_2, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_Out_8, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [517] L764-->L774: Formula: (let ((.cse14 (not (= (mod v_~y$r_buff0_thd0~0_324 256) 0)))) (let ((.cse11 (and .cse14 (not (= (mod v_~y$w_buff0_used~0_613 256) 0))))) (let ((.cse6 (ite .cse11 0 v_~y$w_buff0_used~0_613))) (let ((.cse2 (not (= (mod v_~y$r_buff1_thd0~0_330 256) 0))) (.cse0 (not (= (mod .cse6 256) 0)))) (let ((.cse10 (and .cse0 .cse14)) (.cse12 (and (not (= (mod v_~y$w_buff1_used~0_558 256) 0)) .cse2))) (let ((.cse9 (ite (or .cse10 .cse12) 0 v_~y$w_buff1_used~0_558))) (let ((.cse4 (not (= (mod v_~y$r_buff1_thd2~0_125 256) 0))) (.cse1 (not (= (mod .cse9 256) 0))) (.cse13 (not (= (mod v_~y$r_buff0_thd2~0_124 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_611 256) 0)))) (let ((.cse8 (and .cse13 .cse3)) (.cse5 (and .cse0 .cse13)) (.cse7 (and .cse4 .cse1))) (and (= v_~y$r_buff1_thd0~0_329 (ite (or (and .cse0 (not (= (mod v_~y$r_buff0_thd0~0_323 256) 0))) (and .cse1 .cse2)) 0 v_~y$r_buff1_thd0~0_330)) (= v_~y$r_buff1_thd2~0_124 (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_123 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_556 256) 0)))) 0 v_~y$r_buff1_thd2~0_125)) (= v_~y$w_buff0_used~0_611 (ite .cse5 0 .cse6)) (= v_~y$w_buff1_used~0_556 (ite (or .cse7 .cse8) 0 .cse9)) (= v_~y$r_buff0_thd2~0_123 (ite .cse8 0 v_~y$r_buff0_thd2~0_124)) (= v_~y$r_buff0_thd0~0_323 (ite .cse10 0 v_~y$r_buff0_thd0~0_324)) (= v_~y~0_519 (ite .cse5 v_~y$w_buff0~0_431 (ite .cse7 v_~y$w_buff1~0_390 (ite .cse11 v_~y$w_buff0~0_431 (ite .cse12 v_~y$w_buff1~0_390 1)))))))))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_125, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_613, ~y$w_buff1~0=v_~y$w_buff1~0_390, ~y$w_buff0~0=v_~y$w_buff0~0_431, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_324, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_330, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_558} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_124, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_611, ~y$w_buff1~0=v_~y$w_buff1~0_390, ~y$w_buff0~0=v_~y$w_buff0~0_431, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_323, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_123, ~y~0=v_~y~0_519, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_329, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_556} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 06:30:21,903 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [508] L848-3-->L853: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_8| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_8|) (= v_~main$tmp_guard0~0_Out_8 (ite (= (ite (= v_~__unbuffered_cnt~0_In_2 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (mod v_~main$tmp_guard0~0_Out_8 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_2} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_18|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_Out_22|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_2, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_Out_8, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [518] L764-->L794: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff0_thd0~0_328 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff0_used~0_619 256) 0)) .cse1))) (let ((.cse0 (ite .cse2 0 v_~y$w_buff0_used~0_619))) (and (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_617 256) 0)) (not (= (mod v_~y$w_buff1_used~0_562 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_63|) (= v_~y$r_buff0_thd1~0_55 v_~y$r_buff1_thd1~0_53) (= v_~y$r_buff0_thd0~0_327 (ite (and (not (= (mod .cse0 256) 0)) .cse1) 0 v_~y$r_buff0_thd0~0_328)) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_63| 0)) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_61| |v_P2Thread1of1ForFork1_~arg#1.offset_61|) (= v_~y$r_buff0_thd3~0_175 v_~y$r_buff1_thd3~0_121) (= v_~y$w_buff1_used~0_562 .cse0) (= 2 v_~y$w_buff0~0_433) (= v_~y$r_buff0_thd2~0_127 v_~y$r_buff1_thd2~0_128) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_63| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_63|) (= v_~y~0_523 (ite .cse2 v_~y$w_buff0~0_434 (ite (and (not (= (mod v_~y$r_buff1_thd0~0_335 256) 0)) (not (= (mod v_~y$w_buff1_used~0_564 256) 0))) v_~y$w_buff1~0_393 1))) (= |v_P2Thread1of1ForFork1_~arg#1.base_61| |v_P2Thread1of1ForFork1_#in~arg#1.base_61|) (= v_~y$r_buff0_thd4~0_159 v_~y$r_buff1_thd4~0_156) (= v_~y$r_buff0_thd3~0_174 1) (= v_~y$w_buff0_used~0_617 1) (= v_~y$w_buff1~0_392 v_~y$w_buff0~0_434) (= v_~y$r_buff0_thd0~0_327 v_~y$r_buff1_thd0~0_333))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_159, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_61|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_619, ~y$w_buff1~0=v_~y$w_buff1~0_393, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_175, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_328, ~y$w_buff0~0=v_~y$w_buff0~0_434, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_127, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_55, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_61|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_335, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_564} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_617, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_61|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_61|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_128, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_159, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_53, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_156, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_121, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_61|, ~y$w_buff1~0=v_~y$w_buff1~0_392, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_174, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_327, ~y$w_buff0~0=v_~y$w_buff0~0_433, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_61|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_127, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_55, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_63|, ~y~0=v_~y~0_523, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_333, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_63|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_562} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd0~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-06 06:30:22,325 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:30:22,326 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1140 [2022-12-06 06:30:22,326 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 80 transitions, 864 flow [2022-12-06 06:30:22,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 06:30:22,326 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:22,326 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:22,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:30:22,326 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:22,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:22,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1727468399, now seen corresponding path program 1 times [2022-12-06 06:30:22,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:22,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809361506] [2022-12-06 06:30:22,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:22,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:22,416 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 06:30:22,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:22,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809361506] [2022-12-06 06:30:22,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809361506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:22,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:22,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:30:22,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005499572] [2022-12-06 06:30:22,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:22,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:30:22,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:22,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:30:22,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:30:22,418 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-06 06:30:22,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 80 transitions, 864 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:22,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:22,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-06 06:30:22,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:22,717 INFO L130 PetriNetUnfolder]: 1415/2309 cut-off events. [2022-12-06 06:30:22,718 INFO L131 PetriNetUnfolder]: For 16386/16435 co-relation queries the response was YES. [2022-12-06 06:30:22,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11920 conditions, 2309 events. 1415/2309 cut-off events. For 16386/16435 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 12479 event pairs, 247 based on Foata normal form. 147/2419 useless extension candidates. Maximal degree in co-relation 11889. Up to 900 conditions per place. [2022-12-06 06:30:22,732 INFO L137 encePairwiseOnDemand]: 24/33 looper letters, 145 selfloop transitions, 13 changer transitions 0/164 dead transitions. [2022-12-06 06:30:22,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 164 transitions, 2072 flow [2022-12-06 06:30:22,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:30:22,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:30:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-12-06 06:30:22,733 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2022-12-06 06:30:22,733 INFO L175 Difference]: Start difference. First operand has 70 places, 80 transitions, 864 flow. Second operand 5 states and 102 transitions. [2022-12-06 06:30:22,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 164 transitions, 2072 flow [2022-12-06 06:30:22,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 164 transitions, 1843 flow, removed 55 selfloop flow, removed 6 redundant places. [2022-12-06 06:30:22,750 INFO L231 Difference]: Finished difference. Result has 69 places, 74 transitions, 684 flow [2022-12-06 06:30:22,750 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=684, PETRI_PLACES=69, PETRI_TRANSITIONS=74} [2022-12-06 06:30:22,751 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 25 predicate places. [2022-12-06 06:30:22,751 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:22,751 INFO L89 Accepts]: Start accepts. Operand has 69 places, 74 transitions, 684 flow [2022-12-06 06:30:22,751 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:22,751 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:22,752 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 74 transitions, 684 flow [2022-12-06 06:30:22,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 74 transitions, 684 flow [2022-12-06 06:30:22,785 INFO L130 PetriNetUnfolder]: 155/390 cut-off events. [2022-12-06 06:30:22,785 INFO L131 PetriNetUnfolder]: For 1444/1912 co-relation queries the response was YES. [2022-12-06 06:30:22,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1811 conditions, 390 events. 155/390 cut-off events. For 1444/1912 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2040 event pairs, 7 based on Foata normal form. 33/388 useless extension candidates. Maximal degree in co-relation 1784. Up to 170 conditions per place. [2022-12-06 06:30:22,790 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 74 transitions, 684 flow [2022-12-06 06:30:22,790 INFO L188 LiptonReduction]: Number of co-enabled transitions 1018 [2022-12-06 06:30:22,987 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:30:22,988 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 237 [2022-12-06 06:30:22,988 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 74 transitions, 690 flow [2022-12-06 06:30:22,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:22,989 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:22,989 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:22,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 06:30:22,989 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:22,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:22,989 INFO L85 PathProgramCache]: Analyzing trace with hash -942564401, now seen corresponding path program 1 times [2022-12-06 06:30:22,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:22,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987279329] [2022-12-06 06:30:22,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:22,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:23,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:23,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:23,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987279329] [2022-12-06 06:30:23,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987279329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:23,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:23,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:30:23,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390961815] [2022-12-06 06:30:23,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:23,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:30:23,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:23,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:30:23,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:30:23,151 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-06 06:30:23,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 74 transitions, 690 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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 06:30:23,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:23,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-06 06:30:23,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:23,425 INFO L130 PetriNetUnfolder]: 1359/2181 cut-off events. [2022-12-06 06:30:23,425 INFO L131 PetriNetUnfolder]: For 11858/11917 co-relation queries the response was YES. [2022-12-06 06:30:23,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10702 conditions, 2181 events. 1359/2181 cut-off events. For 11858/11917 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 11500 event pairs, 242 based on Foata normal form. 73/2224 useless extension candidates. Maximal degree in co-relation 10672. Up to 900 conditions per place. [2022-12-06 06:30:23,438 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 136 selfloop transitions, 17 changer transitions 3/162 dead transitions. [2022-12-06 06:30:23,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 162 transitions, 1863 flow [2022-12-06 06:30:23,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:30:23,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:30:23,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-12-06 06:30:23,440 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5591397849462365 [2022-12-06 06:30:23,440 INFO L175 Difference]: Start difference. First operand has 69 places, 74 transitions, 690 flow. Second operand 6 states and 104 transitions. [2022-12-06 06:30:23,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 162 transitions, 1863 flow [2022-12-06 06:30:23,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 162 transitions, 1711 flow, removed 57 selfloop flow, removed 5 redundant places. [2022-12-06 06:30:23,462 INFO L231 Difference]: Finished difference. Result has 70 places, 72 transitions, 620 flow [2022-12-06 06:30:23,462 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=620, PETRI_PLACES=70, PETRI_TRANSITIONS=72} [2022-12-06 06:30:23,462 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 26 predicate places. [2022-12-06 06:30:23,462 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:23,462 INFO L89 Accepts]: Start accepts. Operand has 70 places, 72 transitions, 620 flow [2022-12-06 06:30:23,463 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:23,463 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:23,463 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 72 transitions, 620 flow [2022-12-06 06:30:23,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 72 transitions, 620 flow [2022-12-06 06:30:23,485 INFO L130 PetriNetUnfolder]: 131/317 cut-off events. [2022-12-06 06:30:23,485 INFO L131 PetriNetUnfolder]: For 976/1284 co-relation queries the response was YES. [2022-12-06 06:30:23,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1360 conditions, 317 events. 131/317 cut-off events. For 976/1284 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1593 event pairs, 0 based on Foata normal form. 5/290 useless extension candidates. Maximal degree in co-relation 1334. Up to 95 conditions per place. [2022-12-06 06:30:23,488 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 72 transitions, 620 flow [2022-12-06 06:30:23,488 INFO L188 LiptonReduction]: Number of co-enabled transitions 946 [2022-12-06 06:31:51,880 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:31:51,881 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88419 [2022-12-06 06:31:51,881 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 70 transitions, 616 flow [2022-12-06 06:31:51,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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 06:31:51,881 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:31:51,882 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:31:51,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 06:31:51,882 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:31:51,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:31:51,882 INFO L85 PathProgramCache]: Analyzing trace with hash 91003802, now seen corresponding path program 1 times [2022-12-06 06:31:51,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:31:51,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100841162] [2022-12-06 06:31:51,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:31:51,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:31:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:31:52,030 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 06:31:52,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:31:52,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100841162] [2022-12-06 06:31:52,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100841162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:31:52,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:31:52,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:31:52,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955733301] [2022-12-06 06:31:52,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:31:52,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:31:52,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:31:52,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:31:52,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:31:52,032 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 06:31:52,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 70 transitions, 616 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:31:52,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:31:52,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 06:31:52,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:31:52,364 INFO L130 PetriNetUnfolder]: 2276/3687 cut-off events. [2022-12-06 06:31:52,364 INFO L131 PetriNetUnfolder]: For 16074/16169 co-relation queries the response was YES. [2022-12-06 06:31:52,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16940 conditions, 3687 events. 2276/3687 cut-off events. For 16074/16169 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 21582 event pairs, 667 based on Foata normal form. 64/3733 useless extension candidates. Maximal degree in co-relation 16911. Up to 1276 conditions per place. [2022-12-06 06:31:52,385 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 122 selfloop transitions, 2 changer transitions 8/137 dead transitions. [2022-12-06 06:31:52,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 137 transitions, 1513 flow [2022-12-06 06:31:52,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:31:52,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:31:52,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-06 06:31:52,386 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5267857142857143 [2022-12-06 06:31:52,386 INFO L175 Difference]: Start difference. First operand has 68 places, 70 transitions, 616 flow. Second operand 4 states and 59 transitions. [2022-12-06 06:31:52,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 137 transitions, 1513 flow [2022-12-06 06:31:52,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 137 transitions, 1322 flow, removed 59 selfloop flow, removed 5 redundant places. [2022-12-06 06:31:52,421 INFO L231 Difference]: Finished difference. Result has 68 places, 71 transitions, 541 flow [2022-12-06 06:31:52,421 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=541, PETRI_PLACES=68, PETRI_TRANSITIONS=71} [2022-12-06 06:31:52,421 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 24 predicate places. [2022-12-06 06:31:52,421 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:31:52,421 INFO L89 Accepts]: Start accepts. Operand has 68 places, 71 transitions, 541 flow [2022-12-06 06:31:52,423 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:31:52,423 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:31:52,424 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 71 transitions, 541 flow [2022-12-06 06:31:52,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 71 transitions, 541 flow [2022-12-06 06:31:52,464 INFO L130 PetriNetUnfolder]: 227/525 cut-off events. [2022-12-06 06:31:52,464 INFO L131 PetriNetUnfolder]: For 911/1137 co-relation queries the response was YES. [2022-12-06 06:31:52,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1857 conditions, 525 events. 227/525 cut-off events. For 911/1137 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3159 event pairs, 0 based on Foata normal form. 22/489 useless extension candidates. Maximal degree in co-relation 1831. Up to 148 conditions per place. [2022-12-06 06:31:52,470 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 71 transitions, 541 flow [2022-12-06 06:31:52,470 INFO L188 LiptonReduction]: Number of co-enabled transitions 966 [2022-12-06 06:31:52,471 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:31:52,472 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-06 06:31:52,472 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 71 transitions, 541 flow [2022-12-06 06:31:52,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:31:52,472 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:31:52,472 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:31:52,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 06:31:52,472 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:31:52,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:31:52,473 INFO L85 PathProgramCache]: Analyzing trace with hash 932222902, now seen corresponding path program 2 times [2022-12-06 06:31:52,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:31:52,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920680516] [2022-12-06 06:31:52,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:31:52,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:31:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:31:52,621 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 06:31:52,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:31:52,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920680516] [2022-12-06 06:31:52,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920680516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:31:52,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:31:52,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:31:52,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243372400] [2022-12-06 06:31:52,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:31:52,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:31:52,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:31:52,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:31:52,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:31:52,624 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 06:31:52,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 71 transitions, 541 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:31:52,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:31:52,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 06:31:52,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:31:53,159 INFO L130 PetriNetUnfolder]: 3060/4897 cut-off events. [2022-12-06 06:31:53,160 INFO L131 PetriNetUnfolder]: For 15730/15820 co-relation queries the response was YES. [2022-12-06 06:31:53,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21097 conditions, 4897 events. 3060/4897 cut-off events. For 15730/15820 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 30186 event pairs, 542 based on Foata normal form. 85/4911 useless extension candidates. Maximal degree in co-relation 21068. Up to 2504 conditions per place. [2022-12-06 06:31:53,193 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 82 selfloop transitions, 1 changer transitions 89/177 dead transitions. [2022-12-06 06:31:53,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 177 transitions, 1778 flow [2022-12-06 06:31:53,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:31:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:31:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-06 06:31:53,195 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6339285714285714 [2022-12-06 06:31:53,195 INFO L175 Difference]: Start difference. First operand has 68 places, 71 transitions, 541 flow. Second operand 4 states and 71 transitions. [2022-12-06 06:31:53,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 177 transitions, 1778 flow [2022-12-06 06:31:53,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 177 transitions, 1764 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-06 06:31:53,282 INFO L231 Difference]: Finished difference. Result has 72 places, 59 transitions, 432 flow [2022-12-06 06:31:53,282 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=432, PETRI_PLACES=72, PETRI_TRANSITIONS=59} [2022-12-06 06:31:53,283 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 28 predicate places. [2022-12-06 06:31:53,283 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:31:53,283 INFO L89 Accepts]: Start accepts. Operand has 72 places, 59 transitions, 432 flow [2022-12-06 06:31:53,284 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:31:53,284 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:31:53,284 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 59 transitions, 432 flow [2022-12-06 06:31:53,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 59 transitions, 432 flow [2022-12-06 06:31:53,311 INFO L130 PetriNetUnfolder]: 156/384 cut-off events. [2022-12-06 06:31:53,311 INFO L131 PetriNetUnfolder]: For 558/659 co-relation queries the response was YES. [2022-12-06 06:31:53,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1310 conditions, 384 events. 156/384 cut-off events. For 558/659 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2109 event pairs, 1 based on Foata normal form. 11/367 useless extension candidates. Maximal degree in co-relation 1282. Up to 122 conditions per place. [2022-12-06 06:31:53,314 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 59 transitions, 432 flow [2022-12-06 06:31:53,314 INFO L188 LiptonReduction]: Number of co-enabled transitions 712 [2022-12-06 06:31:53,379 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:31:53,383 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 06:31:53,383 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 431 flow [2022-12-06 06:31:53,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:31:53,383 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:31:53,384 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:31:53,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 06:31:53,384 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:31:53,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:31:53,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1279793834, now seen corresponding path program 1 times [2022-12-06 06:31:53,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:31:53,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246610513] [2022-12-06 06:31:53,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:31:53,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:31:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:31:53,491 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 06:31:53,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:31:53,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246610513] [2022-12-06 06:31:53,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246610513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:31:53,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:31:53,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:31:53,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189433767] [2022-12-06 06:31:53,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:31:53,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:31:53,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:31:53,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:31:53,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:31:53,493 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 06:31:53,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 431 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:31:53,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:31:53,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 06:31:53,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:31:53,713 INFO L130 PetriNetUnfolder]: 1420/2343 cut-off events. [2022-12-06 06:31:53,713 INFO L131 PetriNetUnfolder]: For 8128/8164 co-relation queries the response was YES. [2022-12-06 06:31:53,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10523 conditions, 2343 events. 1420/2343 cut-off events. For 8128/8164 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 12887 event pairs, 359 based on Foata normal form. 37/2346 useless extension candidates. Maximal degree in co-relation 10493. Up to 1212 conditions per place. [2022-12-06 06:31:53,723 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 48 selfloop transitions, 2 changer transitions 50/103 dead transitions. [2022-12-06 06:31:53,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 103 transitions, 986 flow [2022-12-06 06:31:53,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:31:53,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:31:53,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-06 06:31:53,725 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6282051282051282 [2022-12-06 06:31:53,725 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 431 flow. Second operand 3 states and 49 transitions. [2022-12-06 06:31:53,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 103 transitions, 986 flow [2022-12-06 06:31:53,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 103 transitions, 922 flow, removed 8 selfloop flow, removed 8 redundant places. [2022-12-06 06:31:53,746 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 299 flow [2022-12-06 06:31:53,746 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=299, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2022-12-06 06:31:53,746 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2022-12-06 06:31:53,746 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:31:53,746 INFO L89 Accepts]: Start accepts. Operand has 63 places, 45 transitions, 299 flow [2022-12-06 06:31:53,747 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:31:53,747 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:31:53,747 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 45 transitions, 299 flow [2022-12-06 06:31:53,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 45 transitions, 299 flow [2022-12-06 06:31:53,763 INFO L130 PetriNetUnfolder]: 87/216 cut-off events. [2022-12-06 06:31:53,763 INFO L131 PetriNetUnfolder]: For 255/280 co-relation queries the response was YES. [2022-12-06 06:31:53,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 216 events. 87/216 cut-off events. For 255/280 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 982 event pairs, 1 based on Foata normal form. 11/209 useless extension candidates. Maximal degree in co-relation 689. Up to 76 conditions per place. [2022-12-06 06:31:53,764 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 45 transitions, 299 flow [2022-12-06 06:31:53,765 INFO L188 LiptonReduction]: Number of co-enabled transitions 328 [2022-12-06 06:31:53,798 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:31:53,799 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-06 06:31:53,799 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 302 flow [2022-12-06 06:31:53,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:31:53,799 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:31:53,799 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:31:53,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 06:31:53,800 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:31:53,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:31:53,800 INFO L85 PathProgramCache]: Analyzing trace with hash 660761466, now seen corresponding path program 1 times [2022-12-06 06:31:53,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:31:53,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916371723] [2022-12-06 06:31:53,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:31:53,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:31:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:31:53,835 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:31:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:31:53,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:31:53,921 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:31:53,922 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 06:31:53,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 06:31:53,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 06:31:53,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 06:31:53,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 06:31:53,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 06:31:53,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 06:31:53,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 06:31:53,924 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:31:53,931 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:31:53,931 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:31:54,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:31:54 BasicIcfg [2022-12-06 06:31:54,011 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:31:54,012 INFO L158 Benchmark]: Toolchain (without parser) took 113757.27ms. Allocated memory was 200.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 175.4MB in the beginning and 1.2GB in the end (delta: -986.2MB). Peak memory consumption was 740.3MB. Max. memory is 8.0GB. [2022-12-06 06:31:54,012 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 200.3MB. Free memory is still 177.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:31:54,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.78ms. Allocated memory is still 200.3MB. Free memory was 174.9MB in the beginning and 147.6MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 06:31:54,012 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.95ms. Allocated memory is still 200.3MB. Free memory was 147.6MB in the beginning and 145.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:31:54,013 INFO L158 Benchmark]: Boogie Preprocessor took 34.21ms. Allocated memory is still 200.3MB. Free memory was 145.0MB in the beginning and 142.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:31:54,013 INFO L158 Benchmark]: RCFGBuilder took 579.65ms. Allocated memory is still 200.3MB. Free memory was 142.9MB in the beginning and 106.7MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-06 06:31:54,013 INFO L158 Benchmark]: TraceAbstraction took 112576.67ms. Allocated memory was 200.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 106.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 671.1MB. Max. memory is 8.0GB. [2022-12-06 06:31:54,015 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 is still 177.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 500.78ms. Allocated memory is still 200.3MB. Free memory was 174.9MB in the beginning and 147.6MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.95ms. Allocated memory is still 200.3MB. Free memory was 147.6MB in the beginning and 145.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.21ms. Allocated memory is still 200.3MB. Free memory was 145.0MB in the beginning and 142.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 579.65ms. Allocated memory is still 200.3MB. Free memory was 142.9MB in the beginning and 106.7MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 112576.67ms. Allocated memory was 200.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 106.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 671.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 134 PlacesBefore, 44 PlacesAfterwards, 123 TransitionsBefore, 32 TransitionsAfterwards, 2882 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2734, independent: 2630, independent conditional: 2630, independent unconditional: 0, dependent: 104, dependent conditional: 104, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2734, independent: 2630, independent conditional: 0, independent unconditional: 2630, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2734, independent: 2630, independent conditional: 0, independent unconditional: 2630, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2734, independent: 2630, independent conditional: 0, independent unconditional: 2630, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1979, independent: 1932, independent conditional: 0, independent unconditional: 1932, 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: 1979, independent: 1879, independent conditional: 0, independent unconditional: 1879, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 100, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 190, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 141, dependent conditional: 0, dependent unconditional: 141, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2734, independent: 698, independent conditional: 0, independent unconditional: 698, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 1979, unknown conditional: 0, unknown unconditional: 1979] , Statistics on independence cache: Total cache size (in pairs): 3262, Positive cache size: 3215, Positive conditional cache size: 0, Positive unconditional cache size: 3215, 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.0s, 37 PlacesBefore, 37 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182, independent: 156, independent conditional: 156, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 182, independent: 156, independent conditional: 13, independent unconditional: 143, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 182, independent: 156, independent conditional: 13, independent unconditional: 143, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 182, independent: 156, independent conditional: 13, independent unconditional: 143, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 159, independent: 140, independent conditional: 11, independent unconditional: 129, dependent: 19, dependent conditional: 2, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 159, independent: 133, independent conditional: 0, independent unconditional: 133, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 19, dependent conditional: 2, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 42, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 35, dependent conditional: 8, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 182, independent: 16, independent conditional: 2, independent unconditional: 14, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 159, unknown conditional: 13, unknown unconditional: 146] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 140, Positive conditional cache size: 11, Positive unconditional cache size: 129, Negative cache size: 19, Negative conditional cache size: 2, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 213, independent: 190, independent conditional: 190, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 213, independent: 190, independent conditional: 27, independent unconditional: 163, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 213, independent: 190, independent conditional: 0, independent unconditional: 190, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 213, independent: 190, independent conditional: 0, independent unconditional: 190, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 213, independent: 175, independent conditional: 0, independent unconditional: 175, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 155, Positive conditional cache size: 11, Positive unconditional cache size: 144, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 27, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 430 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 196, independent: 175, independent conditional: 175, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 196, independent: 175, independent conditional: 35, independent unconditional: 140, dependent: 21, dependent conditional: 4, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 196, independent: 175, independent conditional: 6, independent unconditional: 169, dependent: 21, dependent conditional: 4, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 196, independent: 175, independent conditional: 6, independent unconditional: 169, dependent: 21, dependent conditional: 4, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 196, independent: 175, independent conditional: 6, independent unconditional: 169, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 155, Positive conditional cache size: 11, Positive unconditional cache size: 144, Negative cache size: 25, Negative conditional cache size: 6, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 29, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 43 PlacesBefore, 42 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 472 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 365, independent: 333, independent conditional: 333, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 365, independent: 333, independent conditional: 116, independent unconditional: 217, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 365, independent: 333, independent conditional: 48, independent unconditional: 285, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 365, independent: 333, independent conditional: 48, independent unconditional: 285, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 10, independent conditional: 2, independent unconditional: 8, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 365, independent: 323, independent conditional: 46, independent unconditional: 277, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 15, unknown conditional: 2, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 231, Positive cache size: 201, Positive conditional cache size: 13, Positive unconditional cache size: 188, Negative cache size: 30, Negative conditional cache size: 6, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 68, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 450 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 162, independent: 144, independent conditional: 144, 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: 162, independent: 144, independent conditional: 40, independent unconditional: 104, 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: 162, independent: 144, independent conditional: 28, independent unconditional: 116, 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: 162, independent: 144, independent conditional: 28, independent unconditional: 116, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 162, independent: 144, independent conditional: 28, independent unconditional: 116, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 232, Positive cache size: 201, Positive conditional cache size: 13, Positive unconditional cache size: 188, Negative cache size: 31, Negative conditional cache size: 6, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 504 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, independent: 156, independent conditional: 156, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 173, independent: 156, independent conditional: 43, independent unconditional: 113, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 173, independent: 156, independent conditional: 29, independent unconditional: 127, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 173, independent: 156, independent conditional: 29, independent unconditional: 127, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 173, independent: 150, independent conditional: 28, independent unconditional: 122, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 207, Positive conditional cache size: 14, Positive unconditional cache size: 193, Negative cache size: 31, Negative conditional cache size: 6, Negative unconditional cache size: 25, 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.2s, 47 PlacesBefore, 47 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 562 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 402, independent: 361, independent conditional: 361, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 402, independent: 361, independent conditional: 142, independent unconditional: 219, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 402, independent: 361, independent conditional: 96, independent unconditional: 265, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 402, independent: 361, independent conditional: 96, independent unconditional: 265, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 402, independent: 357, independent conditional: 92, independent unconditional: 265, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 249, Positive cache size: 218, Positive conditional cache size: 18, Positive unconditional cache size: 200, Negative cache size: 31, Negative conditional cache size: 6, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 46, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 608 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 249, independent: 226, independent conditional: 226, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 249, independent: 226, independent conditional: 100, independent unconditional: 126, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 249, independent: 226, independent conditional: 72, independent unconditional: 154, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 249, independent: 226, independent conditional: 72, independent unconditional: 154, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 249, independent: 224, independent conditional: 72, independent unconditional: 152, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 251, Positive cache size: 220, Positive conditional cache size: 18, Positive unconditional cache size: 202, Negative cache size: 31, Negative conditional cache size: 6, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 640 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 219, independent: 195, independent conditional: 195, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 219, independent: 195, independent conditional: 77, independent unconditional: 118, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 219, independent: 195, independent conditional: 42, independent unconditional: 153, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 219, independent: 195, independent conditional: 42, independent unconditional: 153, dependent: 24, dependent conditional: 0, dependent unconditional: 24, 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: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 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: 219, independent: 194, independent conditional: 42, independent unconditional: 152, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 252, Positive cache size: 221, Positive conditional cache size: 18, Positive unconditional cache size: 203, Negative cache size: 31, Negative conditional cache size: 6, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 698 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 366, independent: 331, independent conditional: 331, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 366, independent: 331, independent conditional: 124, independent unconditional: 207, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 366, independent: 331, independent conditional: 68, independent unconditional: 263, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 366, independent: 331, independent conditional: 68, independent unconditional: 263, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 366, independent: 329, independent conditional: 68, independent unconditional: 261, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 254, Positive cache size: 223, Positive conditional cache size: 18, Positive unconditional cache size: 205, Negative cache size: 31, Negative conditional cache size: 6, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 56, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 908 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 608, independent: 545, independent conditional: 545, independent unconditional: 0, dependent: 63, dependent conditional: 63, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 608, independent: 545, independent conditional: 245, independent unconditional: 300, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 608, independent: 545, independent conditional: 195, independent unconditional: 350, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 608, independent: 545, independent conditional: 195, independent unconditional: 350, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 4, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 608, independent: 540, independent conditional: 191, independent unconditional: 349, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 259, Positive cache size: 228, Positive conditional cache size: 22, Positive unconditional cache size: 206, Negative cache size: 31, Negative conditional cache size: 6, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 50, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 63 PlacesBefore, 63 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 1002 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 302, independent: 234, independent conditional: 234, independent unconditional: 0, dependent: 68, dependent conditional: 68, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 302, independent: 234, independent conditional: 172, independent unconditional: 62, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 302, independent: 234, independent conditional: 157, independent unconditional: 77, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 302, independent: 234, independent conditional: 157, independent unconditional: 77, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 23, independent conditional: 16, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, independent: 23, independent conditional: 0, independent unconditional: 23, 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: 302, independent: 211, independent conditional: 141, independent unconditional: 70, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 23, unknown conditional: 16, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 285, Positive cache size: 254, Positive conditional cache size: 38, Positive unconditional cache size: 216, Negative cache size: 31, Negative conditional cache size: 6, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 1174 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 458, independent: 413, independent conditional: 413, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 458, independent: 413, independent conditional: 276, independent unconditional: 137, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 458, independent: 413, independent conditional: 224, independent unconditional: 189, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 458, independent: 413, independent conditional: 224, independent unconditional: 189, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 458, independent: 410, independent conditional: 221, independent unconditional: 189, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 288, Positive cache size: 257, Positive conditional cache size: 41, Positive unconditional cache size: 216, Negative cache size: 31, Negative conditional cache size: 6, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 52, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 71 PlacesBefore, 70 PlacesAfterwards, 81 TransitionsBefore, 80 TransitionsAfterwards, 1102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 535, independent: 455, independent conditional: 455, 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: 535, independent: 455, independent conditional: 296, independent unconditional: 159, 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: 535, independent: 455, independent conditional: 226, independent unconditional: 229, 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: 535, independent: 455, independent conditional: 226, independent unconditional: 229, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 535, independent: 453, independent conditional: 226, independent unconditional: 227, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 310, Positive cache size: 279, Positive conditional cache size: 41, Positive unconditional cache size: 238, Negative cache size: 31, Negative conditional cache size: 6, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 70, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 69 PlacesBefore, 69 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 1018 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 486, independent: 420, independent conditional: 420, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 486, independent: 420, independent conditional: 261, independent unconditional: 159, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 486, independent: 420, independent conditional: 176, independent unconditional: 244, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 486, independent: 420, independent conditional: 176, independent unconditional: 244, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 486, independent: 418, independent conditional: 176, independent unconditional: 242, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 318, Positive cache size: 287, Positive conditional cache size: 41, Positive unconditional cache size: 246, Negative cache size: 31, Negative conditional cache size: 6, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 85, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 88.4s, 70 PlacesBefore, 68 PlacesAfterwards, 72 TransitionsBefore, 70 TransitionsAfterwards, 946 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 552, independent: 488, independent conditional: 488, 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: 552, independent: 488, independent conditional: 280, independent unconditional: 208, 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: 552, independent: 488, independent conditional: 166, independent unconditional: 322, 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: 552, independent: 488, independent conditional: 166, independent unconditional: 322, 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: 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: 552, independent: 488, independent conditional: 166, independent unconditional: 322, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 326, Positive cache size: 295, Positive conditional cache size: 41, Positive unconditional cache size: 254, Negative cache size: 31, Negative conditional cache size: 6, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 114, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 68 PlacesBefore, 68 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 966 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, independent: 48, independent conditional: 48, 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: 62, independent: 48, independent conditional: 32, independent unconditional: 16, 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: 62, independent: 48, independent conditional: 28, independent unconditional: 20, 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: 62, independent: 48, independent conditional: 28, independent unconditional: 20, 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: 62, independent: 48, independent conditional: 28, independent unconditional: 20, 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): 326, Positive cache size: 295, Positive conditional cache size: 41, Positive unconditional cache size: 254, Negative cache size: 31, Negative conditional cache size: 6, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 70 PlacesBefore, 68 PlacesAfterwards, 59 TransitionsBefore, 57 TransitionsAfterwards, 712 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 117, independent: 117, independent conditional: 117, 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: 117, independent: 117, independent conditional: 96, independent unconditional: 21, 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: 117, independent: 117, independent conditional: 86, independent unconditional: 31, 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: 117, independent: 117, independent conditional: 86, independent unconditional: 31, 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 117, independent: 115, independent conditional: 84, independent unconditional: 31, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 381, Positive conditional cache size: 46, Positive unconditional cache size: 335, Negative cache size: 31, Negative conditional cache size: 6, Negative unconditional cache size: 25, 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, 60 PlacesBefore, 59 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 38, independent conditional: 38, 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: 38, independent: 38, independent conditional: 38, 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: 38, independent: 38, independent conditional: 8, independent unconditional: 30, 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: 38, independent: 38, independent conditional: 8, independent unconditional: 30, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 38, independent: 33, independent conditional: 8, independent unconditional: 25, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 449, Positive cache size: 418, Positive conditional cache size: 48, Positive unconditional cache size: 370, Negative cache size: 31, Negative conditional cache size: 6, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff0_thd4; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$r_buff1_thd4; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L841] 0 pthread_t t1433; [L842] FCALL, FORK 0 pthread_create(&t1433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1433, ((void *)0), P0, ((void *)0))=-3, t1433={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L843] 0 pthread_t t1434; [L844] FCALL, FORK 0 pthread_create(&t1434, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1434, ((void *)0), P1, ((void *)0))=-2, t1433={5:0}, t1434={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] 0 pthread_t t1435; [L846] FCALL, FORK 0 pthread_create(&t1435, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1435, ((void *)0), P2, ((void *)0))=-1, t1433={5:0}, t1434={6:0}, t1435={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L787] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L787] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] 0 pthread_t t1436; [L848] FCALL, FORK 0 pthread_create(&t1436, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1436, ((void *)0), P3, ((void *)0))=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 4 z = 1 [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 a = 1 [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L763] 2 x = 2 [L766] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 2 return 0; [L819] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L820] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L821] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L822] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L823] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L826] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 4 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 y$flush_delayed = weak$$choice2 [L864] 0 y$mem_tmp = y [L865] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L873] 0 y = y$flush_delayed ? y$mem_tmp : y [L874] 0 y$flush_delayed = (_Bool)0 [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 162 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 112.4s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 616 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 616 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 176 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1576 IncrementalHoareTripleChecker+Invalid, 1752 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 176 mSolverCounterUnsat, 13 mSDtfsCounter, 1576 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1001occurred in iteration=13, InterpolantAutomatonStates: 79, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 264 ConstructedInterpolants, 0 QuantifiedInterpolants, 1745 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:31:54,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...