/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix006.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 22:53:45,641 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 22:53:45,643 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 22:53:45,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 22:53:45,675 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 22:53:45,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 22:53:45,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 22:53:45,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 22:53:45,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 22:53:45,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 22:53:45,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 22:53:45,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 22:53:45,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 22:53:45,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 22:53:45,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 22:53:45,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 22:53:45,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 22:53:45,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 22:53:45,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 22:53:45,704 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 22:53:45,705 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 22:53:45,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 22:53:45,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 22:53:45,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 22:53:45,713 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 22:53:45,713 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 22:53:45,713 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 22:53:45,715 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 22:53:45,715 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 22:53:45,715 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 22:53:45,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 22:53:45,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 22:53:45,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 22:53:45,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 22:53:45,722 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 22:53:45,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 22:53:45,723 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 22:53:45,723 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 22:53:45,723 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 22:53:45,724 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 22:53:45,724 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 22:53:45,725 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-RepeatedSemanticLbe.epf [2022-12-05 22:53:45,752 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 22:53:45,752 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 22:53:45,754 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 22:53:45,754 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 22:53:45,754 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 22:53:45,755 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 22:53:45,755 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 22:53:45,755 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 22:53:45,755 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 22:53:45,755 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 22:53:45,756 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 22:53:45,756 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 22:53:45,756 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 22:53:45,756 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 22:53:45,756 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 22:53:45,756 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 22:53:45,756 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 22:53:45,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 22:53:45,756 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 22:53:45,757 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 22:53:45,757 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 22:53:45,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:53:45,757 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 22:53:45,757 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 22:53:45,757 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 22:53:45,757 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 22:53:45,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 22:53:45,757 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 22:53:45,757 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-05 22:53:46,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 22:53:46,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 22:53:46,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 22:53:46,029 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 22:53:46,029 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 22:53:46,030 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006.opt.i [2022-12-05 22:53:46,939 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 22:53:47,194 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 22:53:47,195 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006.opt.i [2022-12-05 22:53:47,205 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/104939577/b643ea1970774d0f9e48c427ac0ddcf6/FLAGa85ef1cbe [2022-12-05 22:53:47,214 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/104939577/b643ea1970774d0f9e48c427ac0ddcf6 [2022-12-05 22:53:47,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 22:53:47,220 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 22:53:47,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 22:53:47,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 22:53:47,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 22:53:47,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:53:47" (1/1) ... [2022-12-05 22:53:47,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77eb7f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:47, skipping insertion in model container [2022-12-05 22:53:47,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:53:47" (1/1) ... [2022-12-05 22:53:47,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 22:53:47,271 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 22:53:47,378 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/mix006.opt.i[944,957] [2022-12-05 22:53:47,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:53:47,558 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 22:53:47,568 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/mix006.opt.i[944,957] [2022-12-05 22:53:47,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,607 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,607 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,607 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,607 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:47,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:47,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:53:47,664 INFO L208 MainTranslator]: Completed translation [2022-12-05 22:53:47,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:47 WrapperNode [2022-12-05 22:53:47,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 22:53:47,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 22:53:47,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 22:53:47,666 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 22:53:47,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:47" (1/1) ... [2022-12-05 22:53:47,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:47" (1/1) ... [2022-12-05 22:53:47,725 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 148 [2022-12-05 22:53:47,725 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 22:53:47,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 22:53:47,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 22:53:47,726 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 22:53:47,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:47" (1/1) ... [2022-12-05 22:53:47,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:47" (1/1) ... [2022-12-05 22:53:47,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:47" (1/1) ... [2022-12-05 22:53:47,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:47" (1/1) ... [2022-12-05 22:53:47,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:47" (1/1) ... [2022-12-05 22:53:47,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:47" (1/1) ... [2022-12-05 22:53:47,759 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:47" (1/1) ... [2022-12-05 22:53:47,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:47" (1/1) ... [2022-12-05 22:53:47,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 22:53:47,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 22:53:47,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 22:53:47,764 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 22:53:47,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:47" (1/1) ... [2022-12-05 22:53:47,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:53:47,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:53:47,821 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-05 22:53:47,838 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-05 22:53:47,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 22:53:47,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 22:53:47,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 22:53:47,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 22:53:47,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 22:53:47,852 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 22:53:47,852 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 22:53:47,852 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 22:53:47,852 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 22:53:47,852 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 22:53:47,852 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 22:53:47,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 22:53:47,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 22:53:47,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 22:53:47,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 22:53:47,854 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 22:53:48,025 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 22:53:48,026 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 22:53:48,314 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 22:53:48,392 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 22:53:48,392 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 22:53:48,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:53:48 BoogieIcfgContainer [2022-12-05 22:53:48,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 22:53:48,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 22:53:48,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 22:53:48,398 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 22:53:48,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 10:53:47" (1/3) ... [2022-12-05 22:53:48,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43049204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:53:48, skipping insertion in model container [2022-12-05 22:53:48,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:47" (2/3) ... [2022-12-05 22:53:48,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43049204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:53:48, skipping insertion in model container [2022-12-05 22:53:48,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:53:48" (3/3) ... [2022-12-05 22:53:48,402 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006.opt.i [2022-12-05 22:53:48,416 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 22:53:48,416 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 22:53:48,416 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 22:53:48,450 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 22:53:48,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2022-12-05 22:53:48,505 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-05 22:53:48,505 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:53:48,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-05 22:53:48,509 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 235 flow [2022-12-05 22:53:48,512 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2022-12-05 22:53:48,513 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:48,525 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-05 22:53:48,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 223 flow [2022-12-05 22:53:48,544 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-05 22:53:48,544 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:53:48,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-05 22:53:48,547 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-05 22:53:48,547 INFO L188 LiptonReduction]: Number of co-enabled transitions 1860 [2022-12-05 22:53:51,985 INFO L203 LiptonReduction]: Total number of compositions: 84 [2022-12-05 22:53:52,005 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 22:53:52,011 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;@530309c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 22:53:52,011 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 22:53:52,016 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-05 22:53:52,017 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:53:52,017 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:52,018 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:52,018 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:53:52,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:52,023 INFO L85 PathProgramCache]: Analyzing trace with hash 816697366, now seen corresponding path program 1 times [2022-12-05 22:53:52,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:52,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727753248] [2022-12-05 22:53:52,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:52,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:52,391 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-05 22:53:52,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:52,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727753248] [2022-12-05 22:53:52,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727753248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:52,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:52,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:53:52,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370505241] [2022-12-05 22:53:52,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:52,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:53:52,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:52,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:53:52,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:53:52,416 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-05 22:53:52,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:52,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:52,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-05 22:53:52,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:52,646 INFO L130 PetriNetUnfolder]: 777/1245 cut-off events. [2022-12-05 22:53:52,646 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-05 22:53:52,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2450 conditions, 1245 events. 777/1245 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6132 event pairs, 129 based on Foata normal form. 0/1121 useless extension candidates. Maximal degree in co-relation 2439. Up to 937 conditions per place. [2022-12-05 22:53:52,655 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 24 selfloop transitions, 2 changer transitions 4/33 dead transitions. [2022-12-05 22:53:52,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 135 flow [2022-12-05 22:53:52,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:53:52,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:53:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-05 22:53:52,663 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2022-12-05 22:53:52,665 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 44 transitions. [2022-12-05 22:53:52,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 135 flow [2022-12-05 22:53:52,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 22:53:52,668 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2022-12-05 22:53:52,670 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-12-05 22:53:52,672 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-05 22:53:52,673 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:52,673 INFO L89 Accepts]: Start accepts. Operand has 32 places, 21 transitions, 52 flow [2022-12-05 22:53:52,675 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:52,675 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:52,678 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 52 flow [2022-12-05 22:53:52,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 52 flow [2022-12-05 22:53:52,682 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-05 22:53:52,683 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:53:52,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 22:53:52,683 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 52 flow [2022-12-05 22:53:52,683 INFO L188 LiptonReduction]: Number of co-enabled transitions 206 [2022-12-05 22:53:52,755 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:53:52,757 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-05 22:53:52,757 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 52 flow [2022-12-05 22:53:52,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:52,758 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:52,758 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:52,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 22:53:52,761 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:53:52,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:52,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1132799054, now seen corresponding path program 1 times [2022-12-05 22:53:52,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:52,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962824654] [2022-12-05 22:53:52,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:52,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:52,890 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-05 22:53:52,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:52,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962824654] [2022-12-05 22:53:52,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962824654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:52,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:52,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:53:52,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725966607] [2022-12-05 22:53:52,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:52,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:53:52,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:52,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:53:52,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:53:52,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 22:53:52,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 52 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-05 22:53:52,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:52,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 22:53:52,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:53,128 INFO L130 PetriNetUnfolder]: 1451/2212 cut-off events. [2022-12-05 22:53:53,128 INFO L131 PetriNetUnfolder]: For 96/96 co-relation queries the response was YES. [2022-12-05 22:53:53,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4602 conditions, 2212 events. 1451/2212 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10288 event pairs, 487 based on Foata normal form. 64/2276 useless extension candidates. Maximal degree in co-relation 4592. Up to 1605 conditions per place. [2022-12-05 22:53:53,137 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 30 selfloop transitions, 7 changer transitions 0/37 dead transitions. [2022-12-05 22:53:53,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 37 transitions, 162 flow [2022-12-05 22:53:53,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:53:53,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:53:53,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-05 22:53:53,138 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2022-12-05 22:53:53,139 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 52 flow. Second operand 3 states and 38 transitions. [2022-12-05 22:53:53,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 37 transitions, 162 flow [2022-12-05 22:53:53,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 37 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:53:53,140 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 102 flow [2022-12-05 22:53:53,140 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2022-12-05 22:53:53,141 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-05 22:53:53,141 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:53,141 INFO L89 Accepts]: Start accepts. Operand has 32 places, 27 transitions, 102 flow [2022-12-05 22:53:53,141 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:53,142 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:53,142 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 27 transitions, 102 flow [2022-12-05 22:53:53,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 27 transitions, 102 flow [2022-12-05 22:53:53,157 INFO L130 PetriNetUnfolder]: 72/204 cut-off events. [2022-12-05 22:53:53,157 INFO L131 PetriNetUnfolder]: For 25/28 co-relation queries the response was YES. [2022-12-05 22:53:53,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 204 events. 72/204 cut-off events. For 25/28 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1041 event pairs, 38 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 401. Up to 117 conditions per place. [2022-12-05 22:53:53,158 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 27 transitions, 102 flow [2022-12-05 22:53:53,158 INFO L188 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-05 22:53:53,182 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:53:53,183 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-05 22:53:53,183 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 102 flow [2022-12-05 22:53:53,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-05 22:53:53,184 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:53,184 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:53,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 22:53:53,184 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:53:53,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:53,184 INFO L85 PathProgramCache]: Analyzing trace with hash -757032658, now seen corresponding path program 1 times [2022-12-05 22:53:53,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:53,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115921550] [2022-12-05 22:53:53,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:53,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:53,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:53,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:53,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115921550] [2022-12-05 22:53:53,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115921550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:53,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:53,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:53:53,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293728334] [2022-12-05 22:53:53,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:53,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:53:53,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:53,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:53:53,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:53:53,270 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-05 22:53:53,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 102 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-05 22:53:53,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:53,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-05 22:53:53,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:53,461 INFO L130 PetriNetUnfolder]: 966/1579 cut-off events. [2022-12-05 22:53:53,461 INFO L131 PetriNetUnfolder]: For 592/634 co-relation queries the response was YES. [2022-12-05 22:53:53,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3872 conditions, 1579 events. 966/1579 cut-off events. For 592/634 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7931 event pairs, 360 based on Foata normal form. 25/1563 useless extension candidates. Maximal degree in co-relation 3860. Up to 981 conditions per place. [2022-12-05 22:53:53,470 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 26 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2022-12-05 22:53:53,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 186 flow [2022-12-05 22:53:53,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:53:53,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:53:53,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-05 22:53:53,472 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-05 22:53:53,472 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 102 flow. Second operand 3 states and 35 transitions. [2022-12-05 22:53:53,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 186 flow [2022-12-05 22:53:53,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:53:53,475 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 99 flow [2022-12-05 22:53:53,475 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2022-12-05 22:53:53,476 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2022-12-05 22:53:53,476 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:53,476 INFO L89 Accepts]: Start accepts. Operand has 33 places, 27 transitions, 99 flow [2022-12-05 22:53:53,477 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:53,477 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:53,477 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 27 transitions, 99 flow [2022-12-05 22:53:53,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 99 flow [2022-12-05 22:53:53,491 INFO L130 PetriNetUnfolder]: 57/165 cut-off events. [2022-12-05 22:53:53,491 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-05 22:53:53,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 165 events. 57/165 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 764 event pairs, 24 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 320. Up to 96 conditions per place. [2022-12-05 22:53:53,492 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 99 flow [2022-12-05 22:53:53,492 INFO L188 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-05 22:53:53,498 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:53:53,499 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-05 22:53:53,499 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 99 flow [2022-12-05 22:53:53,499 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-05 22:53:53,499 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:53,499 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:53,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 22:53:53,499 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:53:53,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:53,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1993266914, now seen corresponding path program 1 times [2022-12-05 22:53:53,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:53,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036051444] [2022-12-05 22:53:53,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:53,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:53,632 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-05 22:53:53,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:53,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036051444] [2022-12-05 22:53:53,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036051444] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:53,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:53,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:53:53,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725782132] [2022-12-05 22:53:53,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:53,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:53:53,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:53,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:53:53,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:53:53,635 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-05 22:53:53,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:53,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:53,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-05 22:53:53,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:53,781 INFO L130 PetriNetUnfolder]: 999/1605 cut-off events. [2022-12-05 22:53:53,781 INFO L131 PetriNetUnfolder]: For 584/585 co-relation queries the response was YES. [2022-12-05 22:53:53,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3987 conditions, 1605 events. 999/1605 cut-off events. For 584/585 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7881 event pairs, 289 based on Foata normal form. 32/1605 useless extension candidates. Maximal degree in co-relation 3974. Up to 1022 conditions per place. [2022-12-05 22:53:53,789 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 31 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2022-12-05 22:53:53,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 38 transitions, 201 flow [2022-12-05 22:53:53,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:53:53,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:53:53,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-05 22:53:53,790 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-05 22:53:53,790 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 99 flow. Second operand 3 states and 36 transitions. [2022-12-05 22:53:53,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 38 transitions, 201 flow [2022-12-05 22:53:53,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 191 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:53:53,791 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 104 flow [2022-12-05 22:53:53,791 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-05 22:53:53,792 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2022-12-05 22:53:53,792 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:53,792 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 104 flow [2022-12-05 22:53:53,793 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:53,793 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:53,793 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 104 flow [2022-12-05 22:53:53,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 27 transitions, 104 flow [2022-12-05 22:53:53,803 INFO L130 PetriNetUnfolder]: 39/131 cut-off events. [2022-12-05 22:53:53,803 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-05 22:53:53,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 131 events. 39/131 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 561 event pairs, 16 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 263. Up to 70 conditions per place. [2022-12-05 22:53:53,804 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 27 transitions, 104 flow [2022-12-05 22:53:53,804 INFO L188 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-05 22:53:53,805 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:53:53,806 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-05 22:53:53,806 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 104 flow [2022-12-05 22:53:53,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:53,806 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:53,806 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:53,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 22:53:53,806 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:53:53,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:53,807 INFO L85 PathProgramCache]: Analyzing trace with hash -385497194, now seen corresponding path program 1 times [2022-12-05 22:53:53,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:53,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997857591] [2022-12-05 22:53:53,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:53,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:53,926 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-05 22:53:53,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:53,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997857591] [2022-12-05 22:53:53,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997857591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:53,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:53,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:53:53,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747392204] [2022-12-05 22:53:53,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:53,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:53:53,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:53,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:53:53,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:53:53,928 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-05 22:53:53,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:53,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:53,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-05 22:53:53,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:54,032 INFO L130 PetriNetUnfolder]: 533/934 cut-off events. [2022-12-05 22:53:54,032 INFO L131 PetriNetUnfolder]: For 301/323 co-relation queries the response was YES. [2022-12-05 22:53:54,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2325 conditions, 934 events. 533/934 cut-off events. For 301/323 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4601 event pairs, 127 based on Foata normal form. 38/935 useless extension candidates. Maximal degree in co-relation 2311. Up to 745 conditions per place. [2022-12-05 22:53:54,036 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 33 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2022-12-05 22:53:54,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 43 transitions, 228 flow [2022-12-05 22:53:54,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:53:54,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:53:54,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-05 22:53:54,037 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508 [2022-12-05 22:53:54,037 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 104 flow. Second operand 3 states and 41 transitions. [2022-12-05 22:53:54,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 43 transitions, 228 flow [2022-12-05 22:53:54,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 43 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:53:54,039 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 124 flow [2022-12-05 22:53:54,039 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2022-12-05 22:53:54,039 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2022-12-05 22:53:54,040 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:54,040 INFO L89 Accepts]: Start accepts. Operand has 35 places, 30 transitions, 124 flow [2022-12-05 22:53:54,040 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:54,040 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:54,040 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 30 transitions, 124 flow [2022-12-05 22:53:54,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 30 transitions, 124 flow [2022-12-05 22:53:54,059 INFO L130 PetriNetUnfolder]: 100/299 cut-off events. [2022-12-05 22:53:54,059 INFO L131 PetriNetUnfolder]: For 52/54 co-relation queries the response was YES. [2022-12-05 22:53:54,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 299 events. 100/299 cut-off events. For 52/54 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1746 event pairs, 43 based on Foata normal form. 1/282 useless extension candidates. Maximal degree in co-relation 627. Up to 149 conditions per place. [2022-12-05 22:53:54,061 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 30 transitions, 124 flow [2022-12-05 22:53:54,061 INFO L188 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-05 22:53:54,063 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:53:54,063 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-05 22:53:54,063 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 124 flow [2022-12-05 22:53:54,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:54,063 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:54,064 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:54,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 22:53:54,064 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:53:54,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:54,064 INFO L85 PathProgramCache]: Analyzing trace with hash -877029516, now seen corresponding path program 1 times [2022-12-05 22:53:54,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:54,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849454717] [2022-12-05 22:53:54,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:54,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:54,204 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-05 22:53:54,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:54,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849454717] [2022-12-05 22:53:54,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849454717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:54,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:54,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:53:54,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863313597] [2022-12-05 22:53:54,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:54,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:53:54,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:54,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:53:54,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:53:54,205 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-05 22:53:54,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:54,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:54,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-05 22:53:54,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:54,308 INFO L130 PetriNetUnfolder]: 266/518 cut-off events. [2022-12-05 22:53:54,308 INFO L131 PetriNetUnfolder]: For 201/215 co-relation queries the response was YES. [2022-12-05 22:53:54,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1541 conditions, 518 events. 266/518 cut-off events. For 201/215 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2356 event pairs, 59 based on Foata normal form. 61/557 useless extension candidates. Maximal degree in co-relation 1526. Up to 173 conditions per place. [2022-12-05 22:53:54,311 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 44 selfloop transitions, 7 changer transitions 0/57 dead transitions. [2022-12-05 22:53:54,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 57 transitions, 320 flow [2022-12-05 22:53:54,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:53:54,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:53:54,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-05 22:53:54,312 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2022-12-05 22:53:54,312 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 124 flow. Second operand 4 states and 55 transitions. [2022-12-05 22:53:54,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 57 transitions, 320 flow [2022-12-05 22:53:54,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 57 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:53:54,314 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 160 flow [2022-12-05 22:53:54,314 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=34, 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=160, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2022-12-05 22:53:54,315 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2022-12-05 22:53:54,315 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:54,315 INFO L89 Accepts]: Start accepts. Operand has 38 places, 33 transitions, 160 flow [2022-12-05 22:53:54,316 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:54,316 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:54,316 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 33 transitions, 160 flow [2022-12-05 22:53:54,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 160 flow [2022-12-05 22:53:54,330 INFO L130 PetriNetUnfolder]: 55/189 cut-off events. [2022-12-05 22:53:54,330 INFO L131 PetriNetUnfolder]: For 106/126 co-relation queries the response was YES. [2022-12-05 22:53:54,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 189 events. 55/189 cut-off events. For 106/126 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 900 event pairs, 13 based on Foata normal form. 10/192 useless extension candidates. Maximal degree in co-relation 496. Up to 86 conditions per place. [2022-12-05 22:53:54,331 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 33 transitions, 160 flow [2022-12-05 22:53:54,331 INFO L188 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-05 22:53:54,333 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:53:54,333 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-05 22:53:54,333 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 160 flow [2022-12-05 22:53:54,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:54,333 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:54,334 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:54,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 22:53:54,334 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:53:54,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:54,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1509236196, now seen corresponding path program 1 times [2022-12-05 22:53:54,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:54,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743804282] [2022-12-05 22:53:54,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:54,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:54,497 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-05 22:53:54,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:54,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743804282] [2022-12-05 22:53:54,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743804282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:54,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:54,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:53:54,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189012669] [2022-12-05 22:53:54,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:54,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:53:54,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:54,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:53:54,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:53:54,500 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-05 22:53:54,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 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-05 22:53:54,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:54,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-05 22:53:54,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:54,590 INFO L130 PetriNetUnfolder]: 222/422 cut-off events. [2022-12-05 22:53:54,590 INFO L131 PetriNetUnfolder]: For 490/506 co-relation queries the response was YES. [2022-12-05 22:53:54,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1376 conditions, 422 events. 222/422 cut-off events. For 490/506 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1857 event pairs, 53 based on Foata normal form. 26/427 useless extension candidates. Maximal degree in co-relation 1359. Up to 173 conditions per place. [2022-12-05 22:53:54,593 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 40 selfloop transitions, 10 changer transitions 1/57 dead transitions. [2022-12-05 22:53:54,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 57 transitions, 344 flow [2022-12-05 22:53:54,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:53:54,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:53:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-05 22:53:54,594 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2022-12-05 22:53:54,594 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 160 flow. Second operand 5 states and 58 transitions. [2022-12-05 22:53:54,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 57 transitions, 344 flow [2022-12-05 22:53:54,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 57 transitions, 316 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-05 22:53:54,596 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 164 flow [2022-12-05 22:53:54,596 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2022-12-05 22:53:54,597 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2022-12-05 22:53:54,597 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:54,597 INFO L89 Accepts]: Start accepts. Operand has 39 places, 33 transitions, 164 flow [2022-12-05 22:53:54,597 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:54,597 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:54,598 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 33 transitions, 164 flow [2022-12-05 22:53:54,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 164 flow [2022-12-05 22:53:54,608 INFO L130 PetriNetUnfolder]: 46/142 cut-off events. [2022-12-05 22:53:54,608 INFO L131 PetriNetUnfolder]: For 133/139 co-relation queries the response was YES. [2022-12-05 22:53:54,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 142 events. 46/142 cut-off events. For 133/139 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 587 event pairs, 8 based on Foata normal form. 1/137 useless extension candidates. Maximal degree in co-relation 368. Up to 51 conditions per place. [2022-12-05 22:53:54,609 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 33 transitions, 164 flow [2022-12-05 22:53:54,609 INFO L188 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-05 22:53:54,896 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:53:54,897 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 300 [2022-12-05 22:53:54,897 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 160 flow [2022-12-05 22:53:54,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 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-05 22:53:54,897 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:54,897 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:54,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 22:53:54,897 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:53:54,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:54,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1125727224, now seen corresponding path program 1 times [2022-12-05 22:53:54,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:54,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671135857] [2022-12-05 22:53:54,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:54,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:55,045 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-05 22:53:55,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:55,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671135857] [2022-12-05 22:53:55,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671135857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:55,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:55,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:53:55,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960778834] [2022-12-05 22:53:55,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:55,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:53:55,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:55,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:53:55,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:53:55,047 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-05 22:53:55,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 160 flow. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-05 22:53:55,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:55,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-05 22:53:55,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:55,175 INFO L130 PetriNetUnfolder]: 361/642 cut-off events. [2022-12-05 22:53:55,175 INFO L131 PetriNetUnfolder]: For 807/807 co-relation queries the response was YES. [2022-12-05 22:53:55,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2149 conditions, 642 events. 361/642 cut-off events. For 807/807 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2736 event pairs, 42 based on Foata normal form. 1/643 useless extension candidates. Maximal degree in co-relation 2133. Up to 312 conditions per place. [2022-12-05 22:53:55,179 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 46 selfloop transitions, 14 changer transitions 9/69 dead transitions. [2022-12-05 22:53:55,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 69 transitions, 480 flow [2022-12-05 22:53:55,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:53:55,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:53:55,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-12-05 22:53:55,180 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5473684210526316 [2022-12-05 22:53:55,180 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 160 flow. Second operand 5 states and 52 transitions. [2022-12-05 22:53:55,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 69 transitions, 480 flow [2022-12-05 22:53:55,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 69 transitions, 424 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-05 22:53:55,184 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 224 flow [2022-12-05 22:53:55,184 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2022-12-05 22:53:55,185 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2022-12-05 22:53:55,185 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:55,185 INFO L89 Accepts]: Start accepts. Operand has 40 places, 39 transitions, 224 flow [2022-12-05 22:53:55,186 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:55,186 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:55,186 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 39 transitions, 224 flow [2022-12-05 22:53:55,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 39 transitions, 224 flow [2022-12-05 22:53:55,199 INFO L130 PetriNetUnfolder]: 61/181 cut-off events. [2022-12-05 22:53:55,199 INFO L131 PetriNetUnfolder]: For 144/170 co-relation queries the response was YES. [2022-12-05 22:53:55,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 181 events. 61/181 cut-off events. For 144/170 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 886 event pairs, 6 based on Foata normal form. 17/192 useless extension candidates. Maximal degree in co-relation 523. Up to 63 conditions per place. [2022-12-05 22:53:55,200 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 39 transitions, 224 flow [2022-12-05 22:53:55,200 INFO L188 LiptonReduction]: Number of co-enabled transitions 262 [2022-12-05 22:53:55,201 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:53:55,202 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-05 22:53:55,202 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 224 flow [2022-12-05 22:53:55,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-05 22:53:55,202 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:55,202 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:55,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 22:53:55,202 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:53:55,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:55,203 INFO L85 PathProgramCache]: Analyzing trace with hash 265957010, now seen corresponding path program 2 times [2022-12-05 22:53:55,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:55,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274268533] [2022-12-05 22:53:55,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:55,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:55,377 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-05 22:53:55,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:55,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274268533] [2022-12-05 22:53:55,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274268533] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:55,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:55,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:53:55,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076143262] [2022-12-05 22:53:55,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:55,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:53:55,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:55,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:53:55,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:53:55,379 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-05 22:53:55,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 224 flow. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:55,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:55,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-05 22:53:55,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:55,529 INFO L130 PetriNetUnfolder]: 429/776 cut-off events. [2022-12-05 22:53:55,530 INFO L131 PetriNetUnfolder]: For 1204/1204 co-relation queries the response was YES. [2022-12-05 22:53:55,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2949 conditions, 776 events. 429/776 cut-off events. For 1204/1204 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3571 event pairs, 56 based on Foata normal form. 1/777 useless extension candidates. Maximal degree in co-relation 2931. Up to 285 conditions per place. [2022-12-05 22:53:55,532 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 34 selfloop transitions, 8 changer transitions 43/85 dead transitions. [2022-12-05 22:53:55,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 85 transitions, 616 flow [2022-12-05 22:53:55,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:53:55,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:53:55,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-12-05 22:53:55,534 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-05 22:53:55,534 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 224 flow. Second operand 6 states and 60 transitions. [2022-12-05 22:53:55,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 85 transitions, 616 flow [2022-12-05 22:53:55,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 85 transitions, 616 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 22:53:55,538 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 183 flow [2022-12-05 22:53:55,538 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=183, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2022-12-05 22:53:55,539 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2022-12-05 22:53:55,539 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:55,539 INFO L89 Accepts]: Start accepts. Operand has 46 places, 30 transitions, 183 flow [2022-12-05 22:53:55,539 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:55,540 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:55,540 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 30 transitions, 183 flow [2022-12-05 22:53:55,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 30 transitions, 183 flow [2022-12-05 22:53:55,549 INFO L130 PetriNetUnfolder]: 29/111 cut-off events. [2022-12-05 22:53:55,549 INFO L131 PetriNetUnfolder]: For 144/158 co-relation queries the response was YES. [2022-12-05 22:53:55,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 111 events. 29/111 cut-off events. For 144/158 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 6 based on Foata normal form. 9/117 useless extension candidates. Maximal degree in co-relation 347. Up to 34 conditions per place. [2022-12-05 22:53:55,550 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 30 transitions, 183 flow [2022-12-05 22:53:55,550 INFO L188 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-05 22:53:55,569 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:53:55,569 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-05 22:53:55,569 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 187 flow [2022-12-05 22:53:55,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:55,570 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:55,570 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:55,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 22:53:55,570 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:53:55,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:55,570 INFO L85 PathProgramCache]: Analyzing trace with hash -780927401, now seen corresponding path program 1 times [2022-12-05 22:53:55,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:55,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946548537] [2022-12-05 22:53:55,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:55,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:55,715 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-05 22:53:55,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:55,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946548537] [2022-12-05 22:53:55,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946548537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:55,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:55,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:53:55,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776186924] [2022-12-05 22:53:55,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:55,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:53:55,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:55,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:53:55,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:53:55,717 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-05 22:53:55,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 187 flow. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:55,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:55,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-05 22:53:55,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:55,787 INFO L130 PetriNetUnfolder]: 196/392 cut-off events. [2022-12-05 22:53:55,787 INFO L131 PetriNetUnfolder]: For 905/905 co-relation queries the response was YES. [2022-12-05 22:53:55,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1587 conditions, 392 events. 196/392 cut-off events. For 905/905 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1736 event pairs, 38 based on Foata normal form. 1/393 useless extension candidates. Maximal degree in co-relation 1568. Up to 256 conditions per place. [2022-12-05 22:53:55,789 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 25 selfloop transitions, 4 changer transitions 18/47 dead transitions. [2022-12-05 22:53:55,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 347 flow [2022-12-05 22:53:55,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:53:55,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:53:55,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-05 22:53:55,790 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4605263157894737 [2022-12-05 22:53:55,790 INFO L175 Difference]: Start difference. First operand has 45 places, 30 transitions, 187 flow. Second operand 4 states and 35 transitions. [2022-12-05 22:53:55,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 47 transitions, 347 flow [2022-12-05 22:53:55,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 313 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-05 22:53:55,793 INFO L231 Difference]: Finished difference. Result has 42 places, 24 transitions, 130 flow [2022-12-05 22:53:55,793 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=42, PETRI_TRANSITIONS=24} [2022-12-05 22:53:55,794 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2022-12-05 22:53:55,794 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:55,794 INFO L89 Accepts]: Start accepts. Operand has 42 places, 24 transitions, 130 flow [2022-12-05 22:53:55,794 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:55,794 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:55,795 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 24 transitions, 130 flow [2022-12-05 22:53:55,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 24 transitions, 130 flow [2022-12-05 22:53:55,798 INFO L130 PetriNetUnfolder]: 6/35 cut-off events. [2022-12-05 22:53:55,798 INFO L131 PetriNetUnfolder]: For 41/49 co-relation queries the response was YES. [2022-12-05 22:53:55,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 35 events. 6/35 cut-off events. For 41/49 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 0 based on Foata normal form. 6/40 useless extension candidates. Maximal degree in co-relation 96. Up to 10 conditions per place. [2022-12-05 22:53:55,799 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 24 transitions, 130 flow [2022-12-05 22:53:55,799 INFO L188 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-05 22:53:56,393 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [466] $Ultimate##0-->L751: Formula: (and (= v_~x~0_94 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_11) (= v_~z~0_34 1) (= v_P0Thread1of1ForFork1_~arg.offset_11 |v_P0Thread1of1ForFork1_#in~arg.offset_11|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_11, ~z~0=v_~z~0_34, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_94, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_11} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] and [468] $Ultimate##0-->L766: Formula: (and (= |v_P1Thread1of1ForFork2_#in~arg.base_15| v_P1Thread1of1ForFork2_~arg.base_15) (= v_~x~0_96 v_~__unbuffered_p1_EAX~0_60) (= |v_P1Thread1of1ForFork2_#in~arg.offset_15| v_P1Thread1of1ForFork2_~arg.offset_15) (= v_~x~0_96 2)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_15|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_15|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_15|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_15, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_15|, ~x~0=v_~x~0_96} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~__unbuffered_p1_EAX~0, ~x~0] [2022-12-05 22:53:56,426 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 22:53:56,427 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 633 [2022-12-05 22:53:56,427 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 20 transitions, 114 flow [2022-12-05 22:53:56,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:56,427 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:56,427 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:56,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 22:53:56,428 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:53:56,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:56,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1025412127, now seen corresponding path program 1 times [2022-12-05 22:53:56,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:56,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029462342] [2022-12-05 22:53:56,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:56,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:57,156 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-05 22:53:57,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:57,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029462342] [2022-12-05 22:53:57,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029462342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:57,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:57,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:53:57,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201284666] [2022-12-05 22:53:57,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:57,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:53:57,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:57,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:53:57,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:53:57,157 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:53:57,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 20 transitions, 114 flow. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:57,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:57,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:53:57,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:57,254 INFO L130 PetriNetUnfolder]: 22/58 cut-off events. [2022-12-05 22:53:57,255 INFO L131 PetriNetUnfolder]: For 121/121 co-relation queries the response was YES. [2022-12-05 22:53:57,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 58 events. 22/58 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 2 based on Foata normal form. 1/59 useless extension candidates. Maximal degree in co-relation 211. Up to 24 conditions per place. [2022-12-05 22:53:57,255 INFO L137 encePairwiseOnDemand]: 9/14 looper letters, 18 selfloop transitions, 3 changer transitions 16/37 dead transitions. [2022-12-05 22:53:57,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 286 flow [2022-12-05 22:53:57,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:53:57,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:53:57,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-12-05 22:53:57,256 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2022-12-05 22:53:57,256 INFO L175 Difference]: Start difference. First operand has 37 places, 20 transitions, 114 flow. Second operand 6 states and 24 transitions. [2022-12-05 22:53:57,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 286 flow [2022-12-05 22:53:57,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 37 transitions, 255 flow, removed 10 selfloop flow, removed 6 redundant places. [2022-12-05 22:53:57,257 INFO L231 Difference]: Finished difference. Result has 38 places, 20 transitions, 105 flow [2022-12-05 22:53:57,258 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=105, PETRI_PLACES=38, PETRI_TRANSITIONS=20} [2022-12-05 22:53:57,258 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2022-12-05 22:53:57,258 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:57,258 INFO L89 Accepts]: Start accepts. Operand has 38 places, 20 transitions, 105 flow [2022-12-05 22:53:57,258 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:57,258 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:57,259 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 20 transitions, 105 flow [2022-12-05 22:53:57,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 20 transitions, 105 flow [2022-12-05 22:53:57,262 INFO L130 PetriNetUnfolder]: 5/23 cut-off events. [2022-12-05 22:53:57,262 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-05 22:53:57,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 23 events. 5/23 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 60. Up to 8 conditions per place. [2022-12-05 22:53:57,262 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 20 transitions, 105 flow [2022-12-05 22:53:57,262 INFO L188 LiptonReduction]: Number of co-enabled transitions 10 [2022-12-05 22:53:57,490 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [470] $Ultimate##0-->L766: Formula: (and (= v_~z~0_38 1) (= v_~x~0_98 v_~__unbuffered_p1_EAX~0_62) (= |v_P1Thread1of1ForFork2_#in~arg.offset_17| v_P1Thread1of1ForFork2_~arg.offset_17) (= v_~x~0_98 2) (= |v_P0Thread1of1ForFork1_#in~arg.base_13| v_P0Thread1of1ForFork1_~arg.base_13) (= v_P0Thread1of1ForFork1_~arg.offset_13 |v_P0Thread1of1ForFork1_#in~arg.offset_13|) (= |v_P1Thread1of1ForFork2_#in~arg.base_17| v_P1Thread1of1ForFork2_~arg.base_17)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_17|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_17|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_17|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_17, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_62, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_13, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_17|, ~z~0=v_~z~0_38, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_98, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_13} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~__unbuffered_p1_EAX~0, P0Thread1of1ForFork1_~arg.offset, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] and [377] L751-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_9| 0) (= v_~__unbuffered_cnt~0_21 (+ v_~__unbuffered_cnt~0_22 1)) (= |v_P0Thread1of1ForFork1_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-05 22:53:57,870 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [474] $Ultimate##0-->P0EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#in~arg.base_19| v_P1Thread1of1ForFork2_~arg.base_19) (= 2 v_~x~0_102) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= v_~__unbuffered_p1_EAX~0_64 v_~x~0_102) (= v_~__unbuffered_cnt~0_173 (+ v_~__unbuffered_cnt~0_174 1)) (= v_~z~0_40 1) (= |v_P0Thread1of1ForFork1_#res.offset_23| 0) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15) (= |v_P1Thread1of1ForFork2_#in~arg.offset_19| v_P1Thread1of1ForFork2_~arg.offset_19) (= |v_P0Thread1of1ForFork1_#res.base_23| 0)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_19|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_174, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_19|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|} OutVars{P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_19, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_23|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_23|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_19|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_64, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_173, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_19|, ~z~0=v_~z~0_40, ~x~0=v_~x~0_102} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~__unbuffered_p1_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] and [349] L766-->L782: Formula: (let ((.cse9 (= (mod v_~y$r_buff1_thd2~0_40 256) 0)) (.cse3 (= (mod v_~y$r_buff0_thd2~0_42 256) 0))) (let ((.cse5 (not .cse3)) (.cse12 (= 0 (mod v_~y$w_buff0_used~0_126 256))) (.cse4 (and .cse9 .cse3)) (.cse6 (and (= (mod v_~y$w_buff1_used~0_119 256) 0) .cse3))) (let ((.cse10 (or .cse12 .cse4 .cse6)) (.cse11 (and .cse5 (not .cse12)))) (let ((.cse1 (= (mod v_~y$w_buff0_used~0_125 256) 0)) (.cse2 (= (mod v_~y$w_buff1_used~0_118 256) 0)) (.cse7 (ite .cse10 v_~y~0_99 (ite .cse11 v_~y$w_buff0~0_61 v_~y$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0)))) (and (= |v_P1Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_20) (= v_~y$r_buff0_thd2~0_41 (ite .cse0 v_~y$r_buff0_thd2~0_42 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~y$r_buff0_thd2~0_42 (ite (and .cse5 (not .cse1)) 0 v_~y$r_buff0_thd2~0_42)))) (= 0 v_~y$flush_delayed~0_48) (= |v_P1Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_64) (= v_~y$w_buff1_used~0_118 (ite .cse0 v_~y$w_buff1_used~0_119 (ite (or .cse1 .cse4 .cse6) v_~y$w_buff1_used~0_119 0))) (= v_~y~0_99 v_~y$mem_tmp~0_32) (= (ite .cse0 v_~y$mem_tmp~0_32 .cse7) v_~y~0_98) (= (ite .cse0 v_~y$r_buff1_thd2~0_40 (ite (let ((.cse8 (= 0 (mod v_~y$r_buff0_thd2~0_41 256)))) (or .cse1 (and .cse2 .cse8) (and .cse9 .cse8))) v_~y$r_buff1_thd2~0_40 0)) v_~y$r_buff1_thd2~0_39) (= v_~y$w_buff0~0_61 v_~y$w_buff0~0_60) (= v_~__unbuffered_p1_EBX~0_8 .cse7) (= v_~y$w_buff1~0_58 v_~y$w_buff1~0_57) (= (ite .cse0 v_~y$w_buff0_used~0_126 (ite .cse10 v_~y$w_buff0_used~0_126 (ite .cse11 0 v_~y$w_buff0_used~0_126))) v_~y$w_buff0_used~0_125)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_40, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_126, ~y$w_buff1~0=v_~y$w_buff1~0_58, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_1|, ~y$w_buff0~0=v_~y$w_buff0~0_61, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_42, ~y~0=v_~y~0_99, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_39, ~weak$$choice0~0=v_~weak$$choice0~0_20, ~y$mem_tmp~0=v_~y$mem_tmp~0_32, ~y$w_buff1~0=v_~y$w_buff1~0_57, ~y$w_buff0~0=v_~y$w_buff0~0_60, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_48, ~y~0=v_~y~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-05 22:53:58,433 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [469] $Ultimate##0-->L822: Formula: (let ((.cse0 (not (= (mod v_~weak$$choice2~0_116 256) 0))) (.cse1 (= (mod v_~y$w_buff0_used~0_338 256) 0))) (and (= v_~__unbuffered_p2_EAX~0_84 1) (= v_~__unbuffered_p2_EBX~0_68 v_~z~0_36) (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_33| 0)) (= v_~y$w_buff1~0_198 v_~y$w_buff0~0_227) (= |v_P2Thread1of1ForFork0_#t~nondet5#1_42| v_~weak$$choice0~0_72) (= v_~y$flush_delayed~0_108 0) (= v_~y$w_buff0_used~0_338 (ite .cse0 1 0)) (= v_~y~0_264 (ite .cse0 v_~y$mem_tmp~0_92 v_~__unbuffered_p2_EAX~0_84)) (= v_~y$w_buff1_used~0_303 (ite .cse0 v_~y$w_buff0_used~0_339 (ite .cse1 v_~y$w_buff0_used~0_339 0))) (= v_~y$r_buff0_thd1~0_49 v_~y$r_buff1_thd1~0_45) (= |v_P2Thread1of1ForFork0_~arg#1.offset_31| |v_P2Thread1of1ForFork0_#in~arg#1.offset_31|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33| (ite (= (mod v_~y$w_buff0_used~0_339 256) 0) 1 0)) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_33|) (= v_~y$r_buff0_thd2~0_119 v_~y$r_buff1_thd2~0_125) (= |v_P2Thread1of1ForFork0_#in~arg#1.base_31| |v_P2Thread1of1ForFork0_~arg#1.base_31|) (= v_~y$w_buff0~0_226 1) (= v_~y$r_buff0_thd0~0_118 v_~y$r_buff1_thd0~0_115) (= v_~y~0_265 v_~y$mem_tmp~0_92) (= (ite .cse0 1 (ite .cse1 1 (ite (not .cse1) 0 1))) v_~y$r_buff0_thd3~0_188) (= |v_P2Thread1of1ForFork0_#t~nondet6#1_42| v_~weak$$choice2~0_116) (= (ite .cse0 v_~y$r_buff0_thd3~0_189 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_188 256) 0))) (or .cse1 (and .cse2 (= (mod v_~y$w_buff1_used~0_303 256) 0)) (and .cse2 (= 0 (mod v_~y$r_buff0_thd3~0_189 256))))) v_~y$r_buff0_thd3~0_189 0)) v_~y$r_buff1_thd3~0_173))) InVars {P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_31|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_339, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_189, ~y$w_buff0~0=v_~y$w_buff0~0_227, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_118, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_49, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_119, ~z~0=v_~z~0_36, ~y~0=v_~y~0_265, P2Thread1of1ForFork0_#t~nondet6#1=|v_P2Thread1of1ForFork0_#t~nondet6#1_42|, P2Thread1of1ForFork0_#t~nondet5#1=|v_P2Thread1of1ForFork0_#t~nondet5#1_42|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_338, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_31|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_45, ~y$mem_tmp~0=v_~y$mem_tmp~0_92, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_173, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_31|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_188, ~y$w_buff0~0=v_~y$w_buff0~0_226, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_49, ~y$flush_delayed~0=v_~y$flush_delayed~0_108, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_84, ~y~0=v_~y~0_264, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_68, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_125, ~weak$$choice0~0=v_~weak$$choice0~0_72, ~y$w_buff1~0=v_~y$w_buff1~0_198, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_118, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_119, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_33|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_31|, ~z~0=v_~z~0_36, ~weak$$choice2~0=v_~weak$$choice2~0_116, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_115, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_303} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet5#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p2_EAX~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0_#t~nondet6#1, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [475] $Ultimate##0-->L782: Formula: (let ((.cse6 (= (mod v_~y$r_buff1_thd2~0_128 256) 0)) (.cse9 (= (mod v_~y$r_buff0_thd2~0_122 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (and (= (mod v_~y$w_buff1_used~0_318 256) 0) .cse9)) (.cse8 (and .cse6 .cse9)) (.cse12 (= (mod v_~y$w_buff0_used~0_355 256) 0))) (let ((.cse2 (or .cse11 .cse8 .cse12)) (.cse3 (and (not .cse12) .cse10))) (let ((.cse0 (ite .cse2 v_~y~0_281 (ite .cse3 v_~y$w_buff0~0_237 v_~y$w_buff1~0_207))) (.cse7 (= (mod v_~y$w_buff1_used~0_317 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_118 256) 0))) (.cse4 (= (mod v_~y$w_buff0_used~0_354 256) 0))) (and (= |v_P1Thread1of1ForFork2_#in~arg.offset_21| v_P1Thread1of1ForFork2_~arg.offset_21) (= v_~__unbuffered_p1_EAX~0_66 v_~x~0_104) (= v_~__unbuffered_p1_EBX~0_86 .cse0) (= |v_P1Thread1of1ForFork2_#t~nondet3_54| v_~weak$$choice0~0_74) (= v_~z~0_42 1) (= |v_P1Thread1of1ForFork2_#t~nondet4_54| v_~weak$$choice2~0_118) (= (ite .cse1 v_~y$w_buff0_used~0_355 (ite .cse2 v_~y$w_buff0_used~0_355 (ite .cse3 0 v_~y$w_buff0_used~0_355))) v_~y$w_buff0_used~0_354) (= v_~y~0_281 v_~y$mem_tmp~0_94) (= |v_P1Thread1of1ForFork2_#in~arg.base_21| v_P1Thread1of1ForFork2_~arg.base_21) (= v_~y$r_buff1_thd2~0_127 (ite .cse1 v_~y$r_buff1_thd2~0_128 (ite (let ((.cse5 (= (mod v_~y$r_buff0_thd2~0_121 256) 0))) (or .cse4 (and .cse5 .cse6) (and .cse5 .cse7))) v_~y$r_buff1_thd2~0_128 0))) (= (ite .cse1 v_~y$mem_tmp~0_94 .cse0) v_~y~0_280) (= 2 v_~x~0_104) (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_17) (= v_~y$flush_delayed~0_110 0) (= v_~y$w_buff1~0_207 v_~y$w_buff1~0_206) (= (ite .cse1 v_~y$r_buff0_thd2~0_122 (ite (or .cse4 .cse8 (and .cse9 .cse7)) v_~y$r_buff0_thd2~0_122 (ite (and (not .cse4) .cse10) 0 v_~y$r_buff0_thd2~0_122))) v_~y$r_buff0_thd2~0_121) (= v_~y$w_buff0~0_237 v_~y$w_buff0~0_236) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_17|) (= (ite .cse1 v_~y$w_buff1_used~0_318 (ite (or .cse4 .cse11 .cse8) v_~y$w_buff1_used~0_318 0)) v_~y$w_buff1_used~0_317)))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_355, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_54|, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_54|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_128, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_21|, ~y$w_buff1~0=v_~y$w_buff1~0_207, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~y$w_buff0~0=v_~y$w_buff0~0_237, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_122, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_21|, ~y~0=v_~y~0_281, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_318} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_354, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_21|, ~y$mem_tmp~0=v_~y$mem_tmp~0_94, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~y$w_buff0~0=v_~y$w_buff0~0_236, ~y$flush_delayed~0=v_~y$flush_delayed~0_110, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, ~y~0=v_~y~0_280, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_86, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_74, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_21, ~y$w_buff1~0=v_~y$w_buff1~0_206, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_121, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_21|, ~z~0=v_~z~0_42, ~weak$$choice2~0=v_~weak$$choice2~0_118, ~x~0=v_~x~0_104, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_317} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.base, ~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, P0Thread1of1ForFork1_~arg.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, P1Thread1of1ForFork2_~arg.offset, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, ~z~0, ~y~0, ~weak$$choice2~0, ~x~0, ~y$w_buff1_used~0] [2022-12-05 22:53:58,886 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [469] $Ultimate##0-->L822: Formula: (let ((.cse0 (not (= (mod v_~weak$$choice2~0_116 256) 0))) (.cse1 (= (mod v_~y$w_buff0_used~0_338 256) 0))) (and (= v_~__unbuffered_p2_EAX~0_84 1) (= v_~__unbuffered_p2_EBX~0_68 v_~z~0_36) (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_33| 0)) (= v_~y$w_buff1~0_198 v_~y$w_buff0~0_227) (= |v_P2Thread1of1ForFork0_#t~nondet5#1_42| v_~weak$$choice0~0_72) (= v_~y$flush_delayed~0_108 0) (= v_~y$w_buff0_used~0_338 (ite .cse0 1 0)) (= v_~y~0_264 (ite .cse0 v_~y$mem_tmp~0_92 v_~__unbuffered_p2_EAX~0_84)) (= v_~y$w_buff1_used~0_303 (ite .cse0 v_~y$w_buff0_used~0_339 (ite .cse1 v_~y$w_buff0_used~0_339 0))) (= v_~y$r_buff0_thd1~0_49 v_~y$r_buff1_thd1~0_45) (= |v_P2Thread1of1ForFork0_~arg#1.offset_31| |v_P2Thread1of1ForFork0_#in~arg#1.offset_31|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33| (ite (= (mod v_~y$w_buff0_used~0_339 256) 0) 1 0)) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_33|) (= v_~y$r_buff0_thd2~0_119 v_~y$r_buff1_thd2~0_125) (= |v_P2Thread1of1ForFork0_#in~arg#1.base_31| |v_P2Thread1of1ForFork0_~arg#1.base_31|) (= v_~y$w_buff0~0_226 1) (= v_~y$r_buff0_thd0~0_118 v_~y$r_buff1_thd0~0_115) (= v_~y~0_265 v_~y$mem_tmp~0_92) (= (ite .cse0 1 (ite .cse1 1 (ite (not .cse1) 0 1))) v_~y$r_buff0_thd3~0_188) (= |v_P2Thread1of1ForFork0_#t~nondet6#1_42| v_~weak$$choice2~0_116) (= (ite .cse0 v_~y$r_buff0_thd3~0_189 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_188 256) 0))) (or .cse1 (and .cse2 (= (mod v_~y$w_buff1_used~0_303 256) 0)) (and .cse2 (= 0 (mod v_~y$r_buff0_thd3~0_189 256))))) v_~y$r_buff0_thd3~0_189 0)) v_~y$r_buff1_thd3~0_173))) InVars {P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_31|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_339, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_189, ~y$w_buff0~0=v_~y$w_buff0~0_227, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_118, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_49, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_119, ~z~0=v_~z~0_36, ~y~0=v_~y~0_265, P2Thread1of1ForFork0_#t~nondet6#1=|v_P2Thread1of1ForFork0_#t~nondet6#1_42|, P2Thread1of1ForFork0_#t~nondet5#1=|v_P2Thread1of1ForFork0_#t~nondet5#1_42|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_338, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_31|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_45, ~y$mem_tmp~0=v_~y$mem_tmp~0_92, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_173, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_31|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_188, ~y$w_buff0~0=v_~y$w_buff0~0_226, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_49, ~y$flush_delayed~0=v_~y$flush_delayed~0_108, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_84, ~y~0=v_~y~0_264, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_68, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_125, ~weak$$choice0~0=v_~weak$$choice0~0_72, ~y$w_buff1~0=v_~y$w_buff1~0_198, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_118, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_119, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_33|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_31|, ~z~0=v_~z~0_36, ~weak$$choice2~0=v_~weak$$choice2~0_116, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_115, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_303} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet5#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p2_EAX~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0_#t~nondet6#1, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [476] $Ultimate##0-->L782: Formula: (let ((.cse4 (= (mod v_~y$r_buff1_thd2~0_132 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd2~0_126 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~y$w_buff0_used~0_359 256) 0)) (.cse8 (and .cse10 .cse4)) (.cse9 (and .cse10 (= (mod v_~y$w_buff1_used~0_322 256) 0)))) (let ((.cse5 (or .cse12 .cse8 .cse9)) (.cse6 (and (not .cse12) .cse11))) (let ((.cse7 (ite .cse5 v_~y~0_285 (ite .cse6 v_~y$w_buff0~0_241 v_~y$w_buff1~0_211))) (.cse0 (not (= (mod v_~weak$$choice2~0_120 256) 0))) (.cse1 (= (mod v_~y$w_buff1_used~0_321 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_358 256) 0))) (and (= |v_P1Thread1of1ForFork2_#t~nondet4_58| v_~weak$$choice2~0_120) (= v_~y$flush_delayed~0_112 0) (= v_~y~0_285 v_~y$mem_tmp~0_96) (= v_~__unbuffered_cnt~0_177 (+ v_~__unbuffered_cnt~0_178 1)) (= |v_P0Thread1of1ForFork1_#res.base_25| 0) (= v_~y$w_buff1~0_211 v_~y$w_buff1~0_210) (= |v_P1Thread1of1ForFork2_#in~arg.offset_23| v_P1Thread1of1ForFork2_~arg.offset_23) (= v_~__unbuffered_p1_EAX~0_68 v_~x~0_106) (= v_~y$r_buff1_thd2~0_131 (ite .cse0 v_~y$r_buff1_thd2~0_132 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd2~0_125 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~y$r_buff1_thd2~0_132 0))) (= |v_P1Thread1of1ForFork2_#t~nondet3_58| v_~weak$$choice0~0_76) (= v_~y$w_buff0_used~0_358 (ite .cse0 v_~y$w_buff0_used~0_359 (ite .cse5 v_~y$w_buff0_used~0_359 (ite .cse6 0 v_~y$w_buff0_used~0_359)))) (= v_~__unbuffered_p1_EBX~0_88 .cse7) (= (ite .cse0 v_~y$mem_tmp~0_96 .cse7) v_~y~0_284) (= 2 v_~x~0_106) (= v_~y$w_buff0~0_241 v_~y$w_buff0~0_240) (= v_~z~0_44 1) (= v_~y$w_buff1_used~0_321 (ite .cse0 v_~y$w_buff1_used~0_322 (ite (or .cse3 .cse8 .cse9) v_~y$w_buff1_used~0_322 0))) (= v_~y$r_buff0_thd2~0_125 (ite .cse0 v_~y$r_buff0_thd2~0_126 (ite (or .cse3 .cse8 (and .cse10 .cse1)) v_~y$r_buff0_thd2~0_126 (ite (and (not .cse3) .cse11) 0 v_~y$r_buff0_thd2~0_126)))) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (= |v_P0Thread1of1ForFork1_#res.offset_25| 0) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|) (= |v_P1Thread1of1ForFork2_#in~arg.base_23| v_P1Thread1of1ForFork2_~arg.base_23)))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_359, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_58|, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_58|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_132, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_23|, ~y$w_buff1~0=v_~y$w_buff1~0_211, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~y$w_buff0~0=v_~y$w_buff0~0_241, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_178, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_23|, ~y~0=v_~y~0_285, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_322} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_358, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_25|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_25|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_23|, ~y$mem_tmp~0=v_~y$mem_tmp~0_96, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_68, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~y$w_buff0~0=v_~y$w_buff0~0_240, ~y$flush_delayed~0=v_~y$flush_delayed~0_112, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~y~0=v_~y~0_284, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_23, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_88, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_131, ~weak$$choice0~0=v_~weak$$choice0~0_76, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_23, ~y$w_buff1~0=v_~y$w_buff1~0_210, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_125, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_177, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_23|, ~z~0=v_~z~0_44, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_106, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_321} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.base, ~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P0Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, P1Thread1of1ForFork2_~arg.offset, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~y~0, ~weak$$choice2~0, ~x~0, ~y$w_buff1_used~0] [2022-12-05 22:53:59,408 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 22:53:59,408 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2150 [2022-12-05 22:53:59,408 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 17 transitions, 111 flow [2022-12-05 22:53:59,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:59,409 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:59,409 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:59,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 22:53:59,409 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:53:59,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:59,409 INFO L85 PathProgramCache]: Analyzing trace with hash -755572516, now seen corresponding path program 1 times [2022-12-05 22:53:59,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:59,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500906260] [2022-12-05 22:53:59,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:59,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 22:53:59,432 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 22:53:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 22:53:59,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 22:53:59,470 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 22:53:59,470 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 22:53:59,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 22:53:59,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 22:53:59,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 22:53:59,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 22:53:59,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 22:53:59,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 22:53:59,472 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:59,476 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 22:53:59,476 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 22:53:59,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 10:53:59 BasicIcfg [2022-12-05 22:53:59,503 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 22:53:59,504 INFO L158 Benchmark]: Toolchain (without parser) took 12283.41ms. Allocated memory was 255.9MB in the beginning and 554.7MB in the end (delta: 298.8MB). Free memory was 230.4MB in the beginning and 435.8MB in the end (delta: -205.4MB). Peak memory consumption was 93.4MB. Max. memory is 8.0GB. [2022-12-05 22:53:59,504 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 255.9MB. Free memory is still 232.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 22:53:59,504 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.96ms. Allocated memory is still 255.9MB. Free memory was 229.8MB in the beginning and 203.1MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 22:53:59,504 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.61ms. Allocated memory is still 255.9MB. Free memory was 203.1MB in the beginning and 199.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 22:53:59,504 INFO L158 Benchmark]: Boogie Preprocessor took 37.47ms. Allocated memory is still 255.9MB. Free memory was 199.9MB in the beginning and 198.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 22:53:59,504 INFO L158 Benchmark]: RCFGBuilder took 630.04ms. Allocated memory is still 255.9MB. Free memory was 198.4MB in the beginning and 161.7MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-12-05 22:53:59,504 INFO L158 Benchmark]: TraceAbstraction took 11107.52ms. Allocated memory was 255.9MB in the beginning and 554.7MB in the end (delta: 298.8MB). Free memory was 160.6MB in the beginning and 435.8MB in the end (delta: -275.2MB). Peak memory consumption was 24.2MB. Max. memory is 8.0GB. [2022-12-05 22:53:59,505 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 255.9MB. Free memory is still 232.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 443.96ms. Allocated memory is still 255.9MB. Free memory was 229.8MB in the beginning and 203.1MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.61ms. Allocated memory is still 255.9MB. Free memory was 203.1MB in the beginning and 199.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.47ms. Allocated memory is still 255.9MB. Free memory was 199.9MB in the beginning and 198.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 630.04ms. Allocated memory is still 255.9MB. Free memory was 198.4MB in the beginning and 161.7MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 11107.52ms. Allocated memory was 255.9MB in the beginning and 554.7MB in the end (delta: 298.8MB). Free memory was 160.6MB in the beginning and 435.8MB in the end (delta: -275.2MB). Peak memory consumption was 24.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 115 PlacesBefore, 35 PlacesAfterwards, 107 TransitionsBefore, 26 TransitionsAfterwards, 1860 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 84 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1489, independent: 1436, independent conditional: 1436, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1489, independent: 1436, independent conditional: 0, independent unconditional: 1436, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1489, independent: 1436, independent conditional: 0, independent unconditional: 1436, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1489, independent: 1436, independent conditional: 0, independent unconditional: 1436, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1163, independent: 1128, independent conditional: 0, independent unconditional: 1128, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1163, independent: 1119, independent conditional: 0, independent unconditional: 1119, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 44, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 132, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1489, independent: 308, independent conditional: 0, independent unconditional: 308, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 1163, unknown conditional: 0, unknown unconditional: 1163] , Statistics on independence cache: Total cache size (in pairs): 1693, Positive cache size: 1658, Positive conditional cache size: 0, Positive unconditional cache size: 1658, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 206 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 95, independent: 73, independent conditional: 73, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 95, independent: 73, independent conditional: 7, independent unconditional: 66, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 95, independent: 73, independent conditional: 7, independent unconditional: 66, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 95, independent: 73, independent conditional: 7, independent unconditional: 66, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 87, independent: 69, independent conditional: 7, independent unconditional: 62, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 87, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 65, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 62, dependent conditional: 13, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 95, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 87, unknown conditional: 9, unknown unconditional: 78] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 69, Positive conditional cache size: 7, Positive unconditional cache size: 62, Negative cache size: 18, Negative conditional cache size: 2, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 116, independent: 104, independent conditional: 104, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 116, independent: 104, independent conditional: 24, independent unconditional: 80, dependent: 12, dependent conditional: 5, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 116, independent: 104, independent conditional: 8, independent unconditional: 96, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 116, independent: 104, independent conditional: 8, independent unconditional: 96, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 20, independent conditional: 3, independent unconditional: 17, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 116, independent: 84, independent conditional: 5, independent unconditional: 79, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 23, unknown conditional: 3, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 89, Positive conditional cache size: 10, Positive unconditional cache size: 79, 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: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 93, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 93, independent: 80, independent conditional: 4, independent unconditional: 76, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 93, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 93, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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: 93, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 90, Positive conditional cache size: 10, Positive unconditional cache size: 80, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, 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.0s, 34 PlacesBefore, 34 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 93, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 93, independent: 80, independent conditional: 9, independent unconditional: 71, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 93, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 93, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 93, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 90, Positive conditional cache size: 10, Positive unconditional cache size: 80, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 71, independent: 63, independent conditional: 63, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 71, independent: 63, independent conditional: 7, independent unconditional: 56, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 71, independent: 63, independent conditional: 7, independent unconditional: 56, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 71, independent: 63, independent conditional: 7, independent unconditional: 56, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 71, independent: 63, independent conditional: 7, independent unconditional: 56, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 90, Positive conditional cache size: 10, Positive unconditional cache size: 80, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 75, independent: 66, independent conditional: 66, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 75, independent: 66, independent conditional: 8, independent unconditional: 58, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 75, independent: 66, independent conditional: 8, independent unconditional: 58, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 75, independent: 66, independent conditional: 8, independent unconditional: 58, dependent: 9, dependent conditional: 0, dependent unconditional: 9, 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: 75, independent: 66, independent conditional: 8, independent unconditional: 58, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 90, Positive conditional cache size: 10, Positive unconditional cache size: 80, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 39 PlacesBefore, 37 PlacesAfterwards, 33 TransitionsBefore, 31 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 64, independent: 48, independent conditional: 4, independent unconditional: 44, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, independent: 48, independent conditional: 4, independent unconditional: 44, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, independent: 48, independent conditional: 4, independent unconditional: 44, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 64, independent: 48, independent conditional: 4, independent unconditional: 44, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 95, Positive conditional cache size: 10, Positive unconditional cache size: 85, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, independent: 59, independent conditional: 59, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 67, independent: 59, independent conditional: 35, independent unconditional: 24, dependent: 8, dependent conditional: 5, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 67, independent: 59, independent conditional: 13, independent unconditional: 46, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 67, independent: 59, independent conditional: 13, independent unconditional: 46, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 67, independent: 59, independent conditional: 13, independent unconditional: 46, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 95, Positive conditional cache size: 10, Positive unconditional cache size: 85, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, 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, 45 PlacesBefore, 45 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 40, independent conditional: 26, independent unconditional: 14, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, independent: 40, independent conditional: 14, independent unconditional: 26, 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: 54, independent: 40, independent conditional: 14, independent unconditional: 26, 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: 54, independent: 40, independent conditional: 14, independent unconditional: 26, 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): 131, Positive cache size: 109, Positive conditional cache size: 11, Positive unconditional cache size: 98, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 42 PlacesBefore, 37 PlacesAfterwards, 24 TransitionsBefore, 20 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 40, independent: 24, independent conditional: 19, independent unconditional: 5, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 24, independent conditional: 12, independent unconditional: 12, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 24, independent conditional: 12, independent unconditional: 12, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 40, independent: 22, independent conditional: 12, independent unconditional: 10, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 129, Positive conditional cache size: 13, Positive unconditional cache size: 116, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 36 PlacesBefore, 33 PlacesAfterwards, 20 TransitionsBefore, 17 TransitionsAfterwards, 10 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 13, independent: 11, independent conditional: 11, independent unconditional: 0, 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): 195, Positive cache size: 173, Positive conditional cache size: 16, Positive unconditional cache size: 157, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [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$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L846] 0 pthread_t t156; [L847] FCALL, FORK 0 pthread_create(&t156, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t156, ((void *)0), P0, ((void *)0))=-2, t156={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t157; [L849] FCALL, FORK 0 pthread_create(&t157, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t157, ((void *)0), P1, ((void *)0))=-1, t156={5:0}, t157={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t158; [L851] FCALL, FORK 0 pthread_create(&t158, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t158, ((void *)0), P2, ((void *)0))=0, t156={5:0}, t157={6:0}, t158={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=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] 3 y$w_buff1 = y$w_buff0 [L794] 3 y$w_buff0 = 1 [L795] 3 y$w_buff1_used = y$w_buff0_used [L796] 3 y$w_buff0_used = (_Bool)1 [L797] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L797] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L798] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L799] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L800] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L801] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = (_Bool)1 [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 y$flush_delayed = weak$$choice2 [L808] 3 y$mem_tmp = y [L809] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L810] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EAX = y [L817] 3 y = y$flush_delayed ? y$mem_tmp : y [L818] 3 y$flush_delayed = (_Bool)0 [L821] 3 __unbuffered_p2_EBX = z [L747] 3 z = 1 [L750] 3 x = 1 [L762] 3 x = 2 [L765] 3 __unbuffered_p1_EAX = x [L755] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 3 return 0; [L768] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 3 y$flush_delayed = weak$$choice2 [L771] 3 y$mem_tmp = y [L772] 3 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L773] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L774] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L775] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L776] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 3 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L778] 3 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 3 __unbuffered_p1_EBX = y [L780] 3 y = y$flush_delayed ? y$mem_tmp : y [L781] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L824] 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) [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] 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 [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 3 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 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) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 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 [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 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 [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 137 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 157 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 576 IncrementalHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 17 mSDtfsCounter, 576 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=8, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 1041 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 22:53:59,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...