/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:30:33,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:30:33,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:30:33,680 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:30:33,681 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:30:33,683 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:30:33,685 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:30:33,690 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:30:33,691 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:30:33,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:30:33,695 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:30:33,696 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:30:33,697 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:30:33,698 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:30:33,699 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:30:33,701 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:30:33,702 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:30:33,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:30:33,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:30:33,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:30:33,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:30:33,711 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:30:33,711 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:30:33,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:30:33,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:30:33,714 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:30:33,714 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:30:33,716 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:30:33,716 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:30:33,717 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:30:33,717 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:30:33,718 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:30:33,719 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:30:33,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:30:33,720 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:30:33,720 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:30:33,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:30:33,720 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:30:33,720 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:30:33,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:30:33,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:30:33,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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:30:33,750 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:30:33,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:30:33,752 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:30:33,752 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:30:33,752 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:30:33,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:30:33,753 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:30:33,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:30:33,753 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:30:33,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:30:33,753 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:30:33,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:30:33,754 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:30:33,754 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:30:33,754 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:30:33,754 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:30:33,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:30:33,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:30:33,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:30:33,754 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:30:33,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:30:33,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:30:33,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:30:33,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:30:33,755 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:30:33,755 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:30:33,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:30:33,755 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:30:33,755 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:30:34,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:30:34,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:30:34,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:30:34,040 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:30:34,041 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:30:34,041 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i [2022-12-06 04:30:35,054 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:30:35,295 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:30:35,295 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i [2022-12-06 04:30:35,303 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a1f59add/1434bf8acb634278ba47f54134434fd6/FLAG6b1d3e93d [2022-12-06 04:30:35,315 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a1f59add/1434bf8acb634278ba47f54134434fd6 [2022-12-06 04:30:35,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:30:35,318 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:30:35,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:30:35,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:30:35,321 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:30:35,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:30:35" (1/1) ... [2022-12-06 04:30:35,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e0d8bb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:35, skipping insertion in model container [2022-12-06 04:30:35,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:30:35" (1/1) ... [2022-12-06 04:30:35,326 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:30:35,362 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:30:35,483 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/safe019_power.oepc.i[995,1008] [2022-12-06 04:30:35,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:30:35,711 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:30:35,721 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/safe019_power.oepc.i[995,1008] [2022-12-06 04:30:35,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:35,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:35,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:30:35,814 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:30:35,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:35 WrapperNode [2022-12-06 04:30:35,814 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:30:35,815 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:30:35,816 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:30:35,816 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:30:35,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:35" (1/1) ... [2022-12-06 04:30:35,834 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:35" (1/1) ... [2022-12-06 04:30:35,873 INFO L138 Inliner]: procedures = 177, calls = 87, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 182 [2022-12-06 04:30:35,874 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:30:35,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:30:35,874 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:30:35,874 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:30:35,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:35" (1/1) ... [2022-12-06 04:30:35,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:35" (1/1) ... [2022-12-06 04:30:35,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:35" (1/1) ... [2022-12-06 04:30:35,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:35" (1/1) ... [2022-12-06 04:30:35,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:35" (1/1) ... [2022-12-06 04:30:35,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:35" (1/1) ... [2022-12-06 04:30:35,904 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:35" (1/1) ... [2022-12-06 04:30:35,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:35" (1/1) ... [2022-12-06 04:30:35,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:30:35,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:30:35,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:30:35,909 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:30:35,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:35" (1/1) ... [2022-12-06 04:30:35,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:30:35,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:30:35,954 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:30:35,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:30:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:30:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:30:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:30:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:30:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:30:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:30:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:30:35,985 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:30:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:30:35,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:30:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:30:35,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:30:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:30:35,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:30:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:30:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:30:35,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:30:35,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:30:35,989 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:30:36,116 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:30:36,117 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:30:36,517 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:30:36,790 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:30:36,790 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:30:36,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:30:36 BoogieIcfgContainer [2022-12-06 04:30:36,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:30:36,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:30:36,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:30:36,795 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:30:36,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:30:35" (1/3) ... [2022-12-06 04:30:36,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23dc990d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:30:36, skipping insertion in model container [2022-12-06 04:30:36,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:35" (2/3) ... [2022-12-06 04:30:36,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23dc990d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:30:36, skipping insertion in model container [2022-12-06 04:30:36,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:30:36" (3/3) ... [2022-12-06 04:30:36,797 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_power.oepc.i [2022-12-06 04:30:36,810 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:30:36,810 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:30:36,810 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:30:36,894 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:30:36,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 143 transitions, 306 flow [2022-12-06 04:30:36,988 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2022-12-06 04:30:36,988 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:30:37,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-12-06 04:30:37,000 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 143 transitions, 306 flow [2022-12-06 04:30:37,003 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 125 transitions, 262 flow [2022-12-06 04:30:37,004 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:37,037 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 125 transitions, 262 flow [2022-12-06 04:30:37,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 125 transitions, 262 flow [2022-12-06 04:30:37,066 INFO L130 PetriNetUnfolder]: 1/125 cut-off events. [2022-12-06 04:30:37,066 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:30:37,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 1/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 47 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 04:30:37,069 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 125 transitions, 262 flow [2022-12-06 04:30:37,069 INFO L188 LiptonReduction]: Number of co-enabled transitions 1736 [2022-12-06 04:30:49,319 INFO L203 LiptonReduction]: Total number of compositions: 103 [2022-12-06 04:30:49,332 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:30:49,336 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;@6c0e6c29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:30:49,336 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 04:30:49,341 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-06 04:30:49,341 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:30:49,341 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:49,341 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:49,342 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:30:49,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:49,345 INFO L85 PathProgramCache]: Analyzing trace with hash 461147869, now seen corresponding path program 1 times [2022-12-06 04:30:49,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:49,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396399060] [2022-12-06 04:30:49,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:49,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:49,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:30:49,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:49,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396399060] [2022-12-06 04:30:49,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396399060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:49,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:49,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:30:49,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262471929] [2022-12-06 04:30:49,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:49,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 04:30:49,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:49,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 04:30:49,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 04:30:49,574 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 04:30:49,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 60 flow. Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:49,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:49,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 04:30:49,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:49,971 INFO L130 PetriNetUnfolder]: 1667/2360 cut-off events. [2022-12-06 04:30:49,972 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-12-06 04:30:49,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4804 conditions, 2360 events. 1667/2360 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 10279 event pairs, 1667 based on Foata normal form. 0/2350 useless extension candidates. Maximal degree in co-relation 4792. Up to 2341 conditions per place. [2022-12-06 04:30:49,990 INFO L137 encePairwiseOnDemand]: 23/24 looper letters, 21 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2022-12-06 04:30:49,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 23 transitions, 100 flow [2022-12-06 04:30:49,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 04:30:49,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 04:30:49,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 26 transitions. [2022-12-06 04:30:49,999 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-06 04:30:50,000 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 60 flow. Second operand 2 states and 26 transitions. [2022-12-06 04:30:50,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 23 transitions, 100 flow [2022-12-06 04:30:50,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 23 transitions, 96 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:30:50,007 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 54 flow [2022-12-06 04:30:50,008 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2022-12-06 04:30:50,012 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-06 04:30:50,012 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:50,013 INFO L89 Accepts]: Start accepts. Operand has 33 places, 23 transitions, 54 flow [2022-12-06 04:30:50,015 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:50,015 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:50,016 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 23 transitions, 54 flow [2022-12-06 04:30:50,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 23 transitions, 54 flow [2022-12-06 04:30:50,031 INFO L130 PetriNetUnfolder]: 0/23 cut-off events. [2022-12-06 04:30:50,031 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:30:50,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 04:30:50,031 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 23 transitions, 54 flow [2022-12-06 04:30:50,032 INFO L188 LiptonReduction]: Number of co-enabled transitions 246 [2022-12-06 04:30:50,190 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:30:50,191 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 04:30:50,191 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 54 flow [2022-12-06 04:30:50,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:50,191 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:50,192 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:50,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:30:50,192 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:30:50,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:50,192 INFO L85 PathProgramCache]: Analyzing trace with hash 781460618, now seen corresponding path program 1 times [2022-12-06 04:30:50,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:50,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035066563] [2022-12-06 04:30:50,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:50,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:30:50,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:50,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035066563] [2022-12-06 04:30:50,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035066563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:50,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:50,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:30:50,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133083685] [2022-12-06 04:30:50,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:50,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:30:50,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:50,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:30:50,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:30:50,526 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-06 04:30:50,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 54 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-06 04:30:50,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:50,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-06 04:30:50,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:50,929 INFO L130 PetriNetUnfolder]: 1556/2321 cut-off events. [2022-12-06 04:30:50,929 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:30:50,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4614 conditions, 2321 events. 1556/2321 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11177 event pairs, 314 based on Foata normal form. 36/2356 useless extension candidates. Maximal degree in co-relation 4606. Up to 1801 conditions per place. [2022-12-06 04:30:50,939 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 30 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2022-12-06 04:30:50,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 142 flow [2022-12-06 04:30:50,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:30:50,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:30:50,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-06 04:30:50,940 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2022-12-06 04:30:50,940 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 54 flow. Second operand 3 states and 39 transitions. [2022-12-06 04:30:50,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 142 flow [2022-12-06 04:30:50,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 34 transitions, 142 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:30:50,942 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 62 flow [2022-12-06 04:30:50,942 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, 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=62, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2022-12-06 04:30:50,943 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2022-12-06 04:30:50,943 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:50,943 INFO L89 Accepts]: Start accepts. Operand has 35 places, 23 transitions, 62 flow [2022-12-06 04:30:50,943 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:50,943 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:50,944 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 23 transitions, 62 flow [2022-12-06 04:30:50,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 23 transitions, 62 flow [2022-12-06 04:30:50,948 INFO L130 PetriNetUnfolder]: 0/23 cut-off events. [2022-12-06 04:30:50,948 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:30:50,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:30:50,949 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 23 transitions, 62 flow [2022-12-06 04:30:50,949 INFO L188 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-06 04:30:50,950 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:30:50,951 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 04:30:50,951 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 62 flow [2022-12-06 04:30:50,951 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-06 04:30:50,951 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:50,951 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:50,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:30:50,951 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:30:50,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:50,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1544526871, now seen corresponding path program 1 times [2022-12-06 04:30:50,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:50,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280512398] [2022-12-06 04:30:50,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:50,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:51,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:30:51,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:51,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280512398] [2022-12-06 04:30:51,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280512398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:51,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:51,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:30:51,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122690138] [2022-12-06 04:30:51,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:51,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:30:51,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:51,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:30:51,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:30:51,214 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 04:30:51,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:51,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:51,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 04:30:51,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:51,735 INFO L130 PetriNetUnfolder]: 2757/4010 cut-off events. [2022-12-06 04:30:51,736 INFO L131 PetriNetUnfolder]: For 348/348 co-relation queries the response was YES. [2022-12-06 04:30:51,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8519 conditions, 4010 events. 2757/4010 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 20533 event pairs, 493 based on Foata normal form. 144/4150 useless extension candidates. Maximal degree in co-relation 8508. Up to 1660 conditions per place. [2022-12-06 04:30:51,751 INFO L137 encePairwiseOnDemand]: 19/23 looper letters, 42 selfloop transitions, 3 changer transitions 5/51 dead transitions. [2022-12-06 04:30:51,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 51 transitions, 227 flow [2022-12-06 04:30:51,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:30:51,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:30:51,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 04:30:51,752 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2022-12-06 04:30:51,752 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 62 flow. Second operand 4 states and 56 transitions. [2022-12-06 04:30:51,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 51 transitions, 227 flow [2022-12-06 04:30:51,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 51 transitions, 221 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:30:51,753 INFO L231 Difference]: Finished difference. Result has 38 places, 23 transitions, 72 flow [2022-12-06 04:30:51,754 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2022-12-06 04:30:51,754 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-12-06 04:30:51,754 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:51,754 INFO L89 Accepts]: Start accepts. Operand has 38 places, 23 transitions, 72 flow [2022-12-06 04:30:51,755 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:51,755 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:51,755 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 23 transitions, 72 flow [2022-12-06 04:30:51,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 23 transitions, 72 flow [2022-12-06 04:30:51,759 INFO L130 PetriNetUnfolder]: 0/23 cut-off events. [2022-12-06 04:30:51,760 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-06 04:30:51,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 23 events. 0/23 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:30:51,760 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 23 transitions, 72 flow [2022-12-06 04:30:51,760 INFO L188 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-06 04:30:51,832 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:30:51,833 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 04:30:51,833 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 72 flow [2022-12-06 04:30:51,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:51,833 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:51,834 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:51,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:30:51,834 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:30:51,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:51,834 INFO L85 PathProgramCache]: Analyzing trace with hash -635683466, now seen corresponding path program 1 times [2022-12-06 04:30:51,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:51,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108045997] [2022-12-06 04:30:51,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:51,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:52,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:30:52,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:52,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108045997] [2022-12-06 04:30:52,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108045997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:52,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:52,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:30:52,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141391482] [2022-12-06 04:30:52,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:52,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:30:52,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:52,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:30:52,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:30:52,128 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-06 04:30:52,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:52,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:52,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-06 04:30:52,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:52,369 INFO L130 PetriNetUnfolder]: 994/1527 cut-off events. [2022-12-06 04:30:52,370 INFO L131 PetriNetUnfolder]: For 633/633 co-relation queries the response was YES. [2022-12-06 04:30:52,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3551 conditions, 1527 events. 994/1527 cut-off events. For 633/633 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6867 event pairs, 316 based on Foata normal form. 24/1549 useless extension candidates. Maximal degree in co-relation 3538. Up to 1107 conditions per place. [2022-12-06 04:30:52,378 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 35 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2022-12-06 04:30:52,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 39 transitions, 192 flow [2022-12-06 04:30:52,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:30:52,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:30:52,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-06 04:30:52,379 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6376811594202898 [2022-12-06 04:30:52,380 INFO L175 Difference]: Start difference. First operand has 38 places, 23 transitions, 72 flow. Second operand 3 states and 44 transitions. [2022-12-06 04:30:52,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 39 transitions, 192 flow [2022-12-06 04:30:52,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 39 transitions, 175 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-06 04:30:52,381 INFO L231 Difference]: Finished difference. Result has 37 places, 23 transitions, 68 flow [2022-12-06 04:30:52,381 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, 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=68, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2022-12-06 04:30:52,382 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2022-12-06 04:30:52,382 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:52,382 INFO L89 Accepts]: Start accepts. Operand has 37 places, 23 transitions, 68 flow [2022-12-06 04:30:52,383 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:52,383 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:52,383 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 23 transitions, 68 flow [2022-12-06 04:30:52,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 23 transitions, 68 flow [2022-12-06 04:30:52,388 INFO L130 PetriNetUnfolder]: 0/23 cut-off events. [2022-12-06 04:30:52,388 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:30:52,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 23 events. 0/23 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:30:52,388 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 23 transitions, 68 flow [2022-12-06 04:30:52,388 INFO L188 LiptonReduction]: Number of co-enabled transitions 232 [2022-12-06 04:30:52,391 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:30:52,392 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 04:30:52,392 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 68 flow [2022-12-06 04:30:52,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:52,392 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:52,392 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:52,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:30:52,392 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:30:52,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:52,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1830174283, now seen corresponding path program 1 times [2022-12-06 04:30:52,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:52,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8946798] [2022-12-06 04:30:52,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:52,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:30:53,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:53,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8946798] [2022-12-06 04:30:53,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8946798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:53,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:53,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:30:53,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123884202] [2022-12-06 04:30:53,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:53,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:30:53,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:53,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:30:53,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:30:53,785 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 04:30:53,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 23 transitions, 68 flow. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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-06 04:30:53,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:53,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 04:30:53,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:54,067 INFO L130 PetriNetUnfolder]: 1238/1787 cut-off events. [2022-12-06 04:30:54,067 INFO L131 PetriNetUnfolder]: For 426/426 co-relation queries the response was YES. [2022-12-06 04:30:54,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4246 conditions, 1787 events. 1238/1787 cut-off events. For 426/426 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7407 event pairs, 323 based on Foata normal form. 4/1790 useless extension candidates. Maximal degree in co-relation 4234. Up to 1547 conditions per place. [2022-12-06 04:30:54,077 INFO L137 encePairwiseOnDemand]: 19/23 looper letters, 30 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2022-12-06 04:30:54,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 34 transitions, 164 flow [2022-12-06 04:30:54,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:30:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:30:54,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 04:30:54,078 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5362318840579711 [2022-12-06 04:30:54,079 INFO L175 Difference]: Start difference. First operand has 37 places, 23 transitions, 68 flow. Second operand 3 states and 37 transitions. [2022-12-06 04:30:54,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 34 transitions, 164 flow [2022-12-06 04:30:54,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 34 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:30:54,080 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 83 flow [2022-12-06 04:30:54,080 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2022-12-06 04:30:54,080 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-12-06 04:30:54,081 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:54,081 INFO L89 Accepts]: Start accepts. Operand has 38 places, 25 transitions, 83 flow [2022-12-06 04:30:54,081 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:54,081 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:54,081 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 25 transitions, 83 flow [2022-12-06 04:30:54,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 25 transitions, 83 flow [2022-12-06 04:30:54,088 INFO L130 PetriNetUnfolder]: 3/33 cut-off events. [2022-12-06 04:30:54,088 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 04:30:54,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 33 events. 3/33 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 1 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 57. Up to 10 conditions per place. [2022-12-06 04:30:54,088 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 25 transitions, 83 flow [2022-12-06 04:30:54,088 INFO L188 LiptonReduction]: Number of co-enabled transitions 250 [2022-12-06 04:30:54,162 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:30:54,163 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 04:30:54,163 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 85 flow [2022-12-06 04:30:54,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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-06 04:30:54,163 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:54,163 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:54,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:30:54,163 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:30:54,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:54,164 INFO L85 PathProgramCache]: Analyzing trace with hash 463862397, now seen corresponding path program 1 times [2022-12-06 04:30:54,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:54,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25165817] [2022-12-06 04:30:54,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:54,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:54,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:30:54,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:54,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25165817] [2022-12-06 04:30:54,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25165817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:54,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:54,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:30:54,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877756387] [2022-12-06 04:30:54,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:54,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:30:54,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:54,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:30:54,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:30:54,711 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 04:30:54,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 85 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:54,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:54,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 04:30:54,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:55,044 INFO L130 PetriNetUnfolder]: 1465/2110 cut-off events. [2022-12-06 04:30:55,045 INFO L131 PetriNetUnfolder]: For 595/595 co-relation queries the response was YES. [2022-12-06 04:30:55,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5157 conditions, 2110 events. 1465/2110 cut-off events. For 595/595 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 9143 event pairs, 1069 based on Foata normal form. 16/2125 useless extension candidates. Maximal degree in co-relation 5144. Up to 1852 conditions per place. [2022-12-06 04:30:55,055 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 27 selfloop transitions, 8 changer transitions 0/36 dead transitions. [2022-12-06 04:30:55,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 36 transitions, 182 flow [2022-12-06 04:30:55,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:30:55,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:30:55,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-06 04:30:55,056 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40625 [2022-12-06 04:30:55,056 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 85 flow. Second operand 4 states and 39 transitions. [2022-12-06 04:30:55,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 36 transitions, 182 flow [2022-12-06 04:30:55,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:30:55,057 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 130 flow [2022-12-06 04:30:55,057 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2022-12-06 04:30:55,058 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2022-12-06 04:30:55,058 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:55,058 INFO L89 Accepts]: Start accepts. Operand has 41 places, 30 transitions, 130 flow [2022-12-06 04:30:55,058 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:55,058 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:55,059 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 30 transitions, 130 flow [2022-12-06 04:30:55,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 30 transitions, 130 flow [2022-12-06 04:30:55,078 INFO L130 PetriNetUnfolder]: 41/118 cut-off events. [2022-12-06 04:30:55,079 INFO L131 PetriNetUnfolder]: For 84/100 co-relation queries the response was YES. [2022-12-06 04:30:55,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 118 events. 41/118 cut-off events. For 84/100 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 476 event pairs, 16 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 287. Up to 70 conditions per place. [2022-12-06 04:30:55,080 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 30 transitions, 130 flow [2022-12-06 04:30:55,080 INFO L188 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-06 04:30:55,133 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:30:55,134 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 04:30:55,134 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 130 flow [2022-12-06 04:30:55,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:55,135 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:55,135 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:55,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:30:55,135 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:30:55,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:55,135 INFO L85 PathProgramCache]: Analyzing trace with hash 700028457, now seen corresponding path program 2 times [2022-12-06 04:30:55,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:55,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700885945] [2022-12-06 04:30:55,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:55,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:56,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:30:56,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:56,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700885945] [2022-12-06 04:30:56,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700885945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:56,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:56,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:30:56,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232902526] [2022-12-06 04:30:56,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:56,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:30:56,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:56,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:30:56,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:30:56,099 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 04:30:56,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 130 flow. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:56,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:56,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 04:30:56,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:56,668 INFO L130 PetriNetUnfolder]: 2138/3147 cut-off events. [2022-12-06 04:30:56,668 INFO L131 PetriNetUnfolder]: For 2013/2013 co-relation queries the response was YES. [2022-12-06 04:30:56,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8718 conditions, 3147 events. 2138/3147 cut-off events. For 2013/2013 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 15663 event pairs, 339 based on Foata normal form. 4/3151 useless extension candidates. Maximal degree in co-relation 8703. Up to 1806 conditions per place. [2022-12-06 04:30:56,687 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 65 selfloop transitions, 13 changer transitions 0/79 dead transitions. [2022-12-06 04:30:56,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 79 transitions, 464 flow [2022-12-06 04:30:56,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:30:56,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:30:56,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-12-06 04:30:56,688 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-06 04:30:56,689 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 130 flow. Second operand 6 states and 78 transitions. [2022-12-06 04:30:56,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 79 transitions, 464 flow [2022-12-06 04:30:56,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 79 transitions, 445 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 04:30:56,692 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 237 flow [2022-12-06 04:30:56,692 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2022-12-06 04:30:56,693 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2022-12-06 04:30:56,693 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:56,693 INFO L89 Accepts]: Start accepts. Operand has 47 places, 40 transitions, 237 flow [2022-12-06 04:30:56,694 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:56,694 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:56,694 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 40 transitions, 237 flow [2022-12-06 04:30:56,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 40 transitions, 237 flow [2022-12-06 04:30:56,721 INFO L130 PetriNetUnfolder]: 52/151 cut-off events. [2022-12-06 04:30:56,721 INFO L131 PetriNetUnfolder]: For 280/306 co-relation queries the response was YES. [2022-12-06 04:30:56,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 151 events. 52/151 cut-off events. For 280/306 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 697 event pairs, 13 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 457. Up to 90 conditions per place. [2022-12-06 04:30:56,722 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 40 transitions, 237 flow [2022-12-06 04:30:56,722 INFO L188 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-06 04:30:56,782 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:30:56,783 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 04:30:56,783 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 239 flow [2022-12-06 04:30:56,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:56,783 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:56,783 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:56,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:30:56,783 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:30:56,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:56,783 INFO L85 PathProgramCache]: Analyzing trace with hash -900848654, now seen corresponding path program 1 times [2022-12-06 04:30:56,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:56,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181086833] [2022-12-06 04:30:56,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:56,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:56,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:30:56,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:56,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181086833] [2022-12-06 04:30:56,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181086833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:56,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:56,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:30:56,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327452187] [2022-12-06 04:30:56,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:56,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:30:56,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:56,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:30:56,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:30:56,910 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 04:30:56,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 239 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-06 04:30:56,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:56,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 04:30:56,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:57,291 INFO L130 PetriNetUnfolder]: 1623/2413 cut-off events. [2022-12-06 04:30:57,291 INFO L131 PetriNetUnfolder]: For 4701/4767 co-relation queries the response was YES. [2022-12-06 04:30:57,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7670 conditions, 2413 events. 1623/2413 cut-off events. For 4701/4767 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 11838 event pairs, 347 based on Foata normal form. 82/2491 useless extension candidates. Maximal degree in co-relation 7652. Up to 2221 conditions per place. [2022-12-06 04:30:57,307 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 65 selfloop transitions, 5 changer transitions 0/72 dead transitions. [2022-12-06 04:30:57,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 72 transitions, 564 flow [2022-12-06 04:30:57,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:30:57,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:30:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-06 04:30:57,309 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-06 04:30:57,309 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 239 flow. Second operand 3 states and 48 transitions. [2022-12-06 04:30:57,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 72 transitions, 564 flow [2022-12-06 04:30:57,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 72 transitions, 543 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 04:30:57,314 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 259 flow [2022-12-06 04:30:57,314 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=259, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2022-12-06 04:30:57,314 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2022-12-06 04:30:57,315 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:57,315 INFO L89 Accepts]: Start accepts. Operand has 48 places, 44 transitions, 259 flow [2022-12-06 04:30:57,315 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:57,315 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:57,315 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 44 transitions, 259 flow [2022-12-06 04:30:57,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 44 transitions, 259 flow [2022-12-06 04:30:57,389 INFO L130 PetriNetUnfolder]: 308/609 cut-off events. [2022-12-06 04:30:57,389 INFO L131 PetriNetUnfolder]: For 1047/1365 co-relation queries the response was YES. [2022-12-06 04:30:57,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1719 conditions, 609 events. 308/609 cut-off events. For 1047/1365 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 3495 event pairs, 120 based on Foata normal form. 4/524 useless extension candidates. Maximal degree in co-relation 1703. Up to 322 conditions per place. [2022-12-06 04:30:57,394 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 44 transitions, 259 flow [2022-12-06 04:30:57,394 INFO L188 LiptonReduction]: Number of co-enabled transitions 476 [2022-12-06 04:30:57,426 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:30:57,427 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-06 04:30:57,427 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 259 flow [2022-12-06 04:30:57,427 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-06 04:30:57,427 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:57,427 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:57,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:30:57,427 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:30:57,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:57,428 INFO L85 PathProgramCache]: Analyzing trace with hash 2143655339, now seen corresponding path program 1 times [2022-12-06 04:30:57,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:57,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229113567] [2022-12-06 04:30:57,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:57,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:57,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:30:57,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:57,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229113567] [2022-12-06 04:30:57,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229113567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:57,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:57,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:30:57,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815159443] [2022-12-06 04:30:57,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:57,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:30:57,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:57,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:30:57,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:30:57,571 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 04:30:57,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 259 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:57,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:57,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 04:30:57,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:57,821 INFO L130 PetriNetUnfolder]: 981/1558 cut-off events. [2022-12-06 04:30:57,822 INFO L131 PetriNetUnfolder]: For 2874/2909 co-relation queries the response was YES. [2022-12-06 04:30:57,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5761 conditions, 1558 events. 981/1558 cut-off events. For 2874/2909 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7605 event pairs, 113 based on Foata normal form. 113/1667 useless extension candidates. Maximal degree in co-relation 5742. Up to 987 conditions per place. [2022-12-06 04:30:57,831 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 87 selfloop transitions, 9 changer transitions 0/98 dead transitions. [2022-12-06 04:30:57,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 98 transitions, 771 flow [2022-12-06 04:30:57,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:30:57,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:30:57,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-06 04:30:57,832 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.66 [2022-12-06 04:30:57,832 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 259 flow. Second operand 4 states and 66 transitions. [2022-12-06 04:30:57,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 98 transitions, 771 flow [2022-12-06 04:30:57,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 98 transitions, 766 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:30:57,837 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 306 flow [2022-12-06 04:30:57,838 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=306, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2022-12-06 04:30:57,838 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2022-12-06 04:30:57,838 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:57,838 INFO L89 Accepts]: Start accepts. Operand has 51 places, 48 transitions, 306 flow [2022-12-06 04:30:57,839 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:57,839 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:57,839 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 48 transitions, 306 flow [2022-12-06 04:30:57,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 48 transitions, 306 flow [2022-12-06 04:30:57,895 INFO L130 PetriNetUnfolder]: 209/457 cut-off events. [2022-12-06 04:30:57,896 INFO L131 PetriNetUnfolder]: For 863/1174 co-relation queries the response was YES. [2022-12-06 04:30:57,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1553 conditions, 457 events. 209/457 cut-off events. For 863/1174 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2500 event pairs, 44 based on Foata normal form. 19/433 useless extension candidates. Maximal degree in co-relation 1535. Up to 239 conditions per place. [2022-12-06 04:30:57,900 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 48 transitions, 306 flow [2022-12-06 04:30:57,900 INFO L188 LiptonReduction]: Number of co-enabled transitions 532 [2022-12-06 04:30:57,901 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:30:57,902 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-06 04:30:57,902 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 306 flow [2022-12-06 04:30:57,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:57,902 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:57,902 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:57,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:30:57,903 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:30:57,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:57,903 INFO L85 PathProgramCache]: Analyzing trace with hash -71250988, now seen corresponding path program 1 times [2022-12-06 04:30:57,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:57,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437831673] [2022-12-06 04:30:57,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:57,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:58,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:30:58,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:58,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437831673] [2022-12-06 04:30:58,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437831673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:58,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:58,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:30:58,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210189886] [2022-12-06 04:30:58,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:58,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:30:58,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:58,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:30:58,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:30:58,717 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 04:30:58,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 306 flow. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:58,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:58,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 04:30:58,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:59,097 INFO L130 PetriNetUnfolder]: 1405/2291 cut-off events. [2022-12-06 04:30:59,097 INFO L131 PetriNetUnfolder]: For 5439/5439 co-relation queries the response was YES. [2022-12-06 04:30:59,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9360 conditions, 2291 events. 1405/2291 cut-off events. For 5439/5439 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 12603 event pairs, 385 based on Foata normal form. 48/2338 useless extension candidates. Maximal degree in co-relation 9339. Up to 1339 conditions per place. [2022-12-06 04:30:59,107 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 54 selfloop transitions, 9 changer transitions 4/68 dead transitions. [2022-12-06 04:30:59,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 68 transitions, 561 flow [2022-12-06 04:30:59,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:30:59,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:30:59,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 04:30:59,109 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41 [2022-12-06 04:30:59,109 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 306 flow. Second operand 4 states and 41 transitions. [2022-12-06 04:30:59,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 68 transitions, 561 flow [2022-12-06 04:30:59,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 68 transitions, 527 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 04:30:59,114 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 314 flow [2022-12-06 04:30:59,114 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=314, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2022-12-06 04:30:59,114 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2022-12-06 04:30:59,114 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:59,114 INFO L89 Accepts]: Start accepts. Operand has 53 places, 48 transitions, 314 flow [2022-12-06 04:30:59,115 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:59,115 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:59,115 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 48 transitions, 314 flow [2022-12-06 04:30:59,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 48 transitions, 314 flow [2022-12-06 04:30:59,177 INFO L130 PetriNetUnfolder]: 261/610 cut-off events. [2022-12-06 04:30:59,178 INFO L131 PetriNetUnfolder]: For 1114/1369 co-relation queries the response was YES. [2022-12-06 04:30:59,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1865 conditions, 610 events. 261/610 cut-off events. For 1114/1369 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 3885 event pairs, 54 based on Foata normal form. 21/580 useless extension candidates. Maximal degree in co-relation 1846. Up to 346 conditions per place. [2022-12-06 04:30:59,183 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 48 transitions, 314 flow [2022-12-06 04:30:59,183 INFO L188 LiptonReduction]: Number of co-enabled transitions 518 [2022-12-06 04:30:59,188 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [819] $Ultimate##0-->L812: Formula: (and (= (store |v_#memory_int_620| |v_~#y~0.base_308| (store (select |v_#memory_int_620| |v_~#y~0.base_308|) |v_~#y~0.offset_308| 1)) |v_#memory_int_619|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_21| v_P2Thread1of1ForFork0_~arg.offset_21) (= |v_P2Thread1of1ForFork0_#in~arg.base_21| v_P2Thread1of1ForFork0_~arg.base_21) (= v_~x~0_70 v_~__unbuffered_p2_EAX~0_74)) InVars {~#y~0.offset=|v_~#y~0.offset_308|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, #memory_int=|v_#memory_int_620|, ~#y~0.base=|v_~#y~0.base_308|, ~x~0=v_~x~0_70, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_21, ~#y~0.offset=|v_~#y~0.offset_308|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_21, #memory_int=|v_#memory_int_619|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_74, ~#y~0.base=|v_~#y~0.base_308|, ~x~0=v_~x~0_70, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, #memory_int, ~__unbuffered_p2_EAX~0] and [781] $Ultimate##0-->L829: Formula: (and (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= (store |v_#memory_int_343| |v_~#y~0.base_216| (store (select |v_#memory_int_343| |v_~#y~0.base_216|) |v_~#y~0.offset_216| 2)) |v_#memory_int_342|) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5)) InVars {~#y~0.offset=|v_~#y~0.offset_216|, #memory_int=|v_#memory_int_343|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~#y~0.base=|v_~#y~0.base_216|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{~#y~0.offset=|v_~#y~0.offset_216|, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, #memory_int=|v_#memory_int_342|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~#y~0.base=|v_~#y~0.base_216|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_~arg.offset, #memory_int, P3Thread1of1ForFork2_~arg.base] [2022-12-06 04:30:59,548 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:30:59,549 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 435 [2022-12-06 04:30:59,549 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 328 flow [2022-12-06 04:30:59,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:59,549 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:59,549 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:59,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:30:59,549 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:30:59,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:59,550 INFO L85 PathProgramCache]: Analyzing trace with hash 2050563844, now seen corresponding path program 2 times [2022-12-06 04:30:59,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:59,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606632593] [2022-12-06 04:30:59,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:59,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:00,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:00,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:00,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606632593] [2022-12-06 04:31:00,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606632593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:00,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:00,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 04:31:00,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293841524] [2022-12-06 04:31:00,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:00,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 04:31:00,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:00,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 04:31:00,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-06 04:31:00,734 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 04:31:00,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 328 flow. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:00,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:00,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 04:31:00,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:01,117 INFO L130 PetriNetUnfolder]: 1332/2210 cut-off events. [2022-12-06 04:31:01,117 INFO L131 PetriNetUnfolder]: For 5431/5431 co-relation queries the response was YES. [2022-12-06 04:31:01,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8733 conditions, 2210 events. 1332/2210 cut-off events. For 5431/5431 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 12024 event pairs, 405 based on Foata normal form. 9/2218 useless extension candidates. Maximal degree in co-relation 8711. Up to 1349 conditions per place. [2022-12-06 04:31:01,127 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 52 selfloop transitions, 11 changer transitions 2/66 dead transitions. [2022-12-06 04:31:01,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 66 transitions, 551 flow [2022-12-06 04:31:01,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:31:01,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:31:01,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 04:31:01,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40384615384615385 [2022-12-06 04:31:01,140 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 328 flow. Second operand 4 states and 42 transitions. [2022-12-06 04:31:01,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 66 transitions, 551 flow [2022-12-06 04:31:01,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 66 transitions, 533 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 04:31:01,146 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 352 flow [2022-12-06 04:31:01,146 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=352, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2022-12-06 04:31:01,146 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2022-12-06 04:31:01,146 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:01,146 INFO L89 Accepts]: Start accepts. Operand has 55 places, 49 transitions, 352 flow [2022-12-06 04:31:01,147 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:01,147 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:01,147 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 49 transitions, 352 flow [2022-12-06 04:31:01,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 49 transitions, 352 flow [2022-12-06 04:31:01,216 INFO L130 PetriNetUnfolder]: 287/670 cut-off events. [2022-12-06 04:31:01,216 INFO L131 PetriNetUnfolder]: For 1483/1857 co-relation queries the response was YES. [2022-12-06 04:31:01,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2083 conditions, 670 events. 287/670 cut-off events. For 1483/1857 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 4299 event pairs, 56 based on Foata normal form. 23/640 useless extension candidates. Maximal degree in co-relation 2063. Up to 405 conditions per place. [2022-12-06 04:31:01,223 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 49 transitions, 352 flow [2022-12-06 04:31:01,223 INFO L188 LiptonReduction]: Number of co-enabled transitions 542 [2022-12-06 04:31:01,283 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:01,284 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-06 04:31:01,284 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 352 flow [2022-12-06 04:31:01,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:01,284 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:01,284 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:01,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:31:01,284 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:31:01,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:01,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1642221884, now seen corresponding path program 1 times [2022-12-06 04:31:01,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:01,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250806117] [2022-12-06 04:31:01,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:01,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:01,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:01,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:01,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250806117] [2022-12-06 04:31:01,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250806117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:01,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:01,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:31:01,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621712126] [2022-12-06 04:31:01,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:01,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:31:01,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:01,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:31:01,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:31:01,447 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 04:31:01,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 352 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:01,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:01,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 04:31:01,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:01,717 INFO L130 PetriNetUnfolder]: 837/1414 cut-off events. [2022-12-06 04:31:01,718 INFO L131 PetriNetUnfolder]: For 3790/3804 co-relation queries the response was YES. [2022-12-06 04:31:01,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5789 conditions, 1414 events. 837/1414 cut-off events. For 3790/3804 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7480 event pairs, 64 based on Foata normal form. 113/1523 useless extension candidates. Maximal degree in co-relation 5766. Up to 480 conditions per place. [2022-12-06 04:31:01,724 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 91 selfloop transitions, 13 changer transitions 9/115 dead transitions. [2022-12-06 04:31:01,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 115 transitions, 1064 flow [2022-12-06 04:31:01,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:31:01,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:31:01,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-12-06 04:31:01,725 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6307692307692307 [2022-12-06 04:31:01,725 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 352 flow. Second operand 5 states and 82 transitions. [2022-12-06 04:31:01,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 115 transitions, 1064 flow [2022-12-06 04:31:01,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 115 transitions, 1025 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 04:31:01,730 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 392 flow [2022-12-06 04:31:01,730 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=392, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2022-12-06 04:31:01,731 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2022-12-06 04:31:01,731 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:01,731 INFO L89 Accepts]: Start accepts. Operand has 58 places, 51 transitions, 392 flow [2022-12-06 04:31:01,731 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:01,732 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:01,732 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 51 transitions, 392 flow [2022-12-06 04:31:01,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 51 transitions, 392 flow [2022-12-06 04:31:01,771 INFO L130 PetriNetUnfolder]: 150/380 cut-off events. [2022-12-06 04:31:01,771 INFO L131 PetriNetUnfolder]: For 928/1174 co-relation queries the response was YES. [2022-12-06 04:31:01,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 380 events. 150/380 cut-off events. For 928/1174 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2132 event pairs, 11 based on Foata normal form. 32/385 useless extension candidates. Maximal degree in co-relation 1427. Up to 211 conditions per place. [2022-12-06 04:31:01,774 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 51 transitions, 392 flow [2022-12-06 04:31:01,774 INFO L188 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-06 04:31:01,822 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:01,822 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 04:31:01,822 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 392 flow [2022-12-06 04:31:01,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:01,823 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:01,823 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:01,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:31:01,823 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:31:01,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:01,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1207572598, now seen corresponding path program 1 times [2022-12-06 04:31:01,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:01,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666805573] [2022-12-06 04:31:01,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:01,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:01,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:01,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:01,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666805573] [2022-12-06 04:31:01,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666805573] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:01,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:01,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:31:01,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324920953] [2022-12-06 04:31:01,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:01,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:31:01,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:01,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:31:01,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:31:01,968 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 04:31:01,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 392 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:01,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:01,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 04:31:01,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:02,290 INFO L130 PetriNetUnfolder]: 1402/2339 cut-off events. [2022-12-06 04:31:02,290 INFO L131 PetriNetUnfolder]: For 8113/8133 co-relation queries the response was YES. [2022-12-06 04:31:02,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10269 conditions, 2339 events. 1402/2339 cut-off events. For 8113/8133 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12791 event pairs, 264 based on Foata normal form. 32/2369 useless extension candidates. Maximal degree in co-relation 10245. Up to 1209 conditions per place. [2022-12-06 04:31:02,298 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 62 selfloop transitions, 2 changer transitions 36/101 dead transitions. [2022-12-06 04:31:02,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 101 transitions, 946 flow [2022-12-06 04:31:02,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:31:02,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:31:02,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-06 04:31:02,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5480769230769231 [2022-12-06 04:31:02,300 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 392 flow. Second operand 4 states and 57 transitions. [2022-12-06 04:31:02,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 101 transitions, 946 flow [2022-12-06 04:31:02,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 101 transitions, 872 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-12-06 04:31:02,311 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 371 flow [2022-12-06 04:31:02,311 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=371, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2022-12-06 04:31:02,312 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 24 predicate places. [2022-12-06 04:31:02,312 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:02,312 INFO L89 Accepts]: Start accepts. Operand has 60 places, 52 transitions, 371 flow [2022-12-06 04:31:02,314 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:02,314 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:02,314 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 52 transitions, 371 flow [2022-12-06 04:31:02,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 52 transitions, 371 flow [2022-12-06 04:31:02,360 INFO L130 PetriNetUnfolder]: 210/542 cut-off events. [2022-12-06 04:31:02,360 INFO L131 PetriNetUnfolder]: For 939/1155 co-relation queries the response was YES. [2022-12-06 04:31:02,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1707 conditions, 542 events. 210/542 cut-off events. For 939/1155 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3391 event pairs, 14 based on Foata normal form. 41/539 useless extension candidates. Maximal degree in co-relation 1685. Up to 218 conditions per place. [2022-12-06 04:31:02,365 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 52 transitions, 371 flow [2022-12-06 04:31:02,365 INFO L188 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-06 04:31:02,366 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:02,367 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-06 04:31:02,367 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 371 flow [2022-12-06 04:31:02,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:02,367 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:02,367 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:02,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:31:02,368 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:31:02,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:02,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1395268824, now seen corresponding path program 2 times [2022-12-06 04:31:02,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:02,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312737000] [2022-12-06 04:31:02,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:02,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:02,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:02,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:02,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312737000] [2022-12-06 04:31:02,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312737000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:02,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:02,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:31:02,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886033240] [2022-12-06 04:31:02,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:02,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:31:02,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:02,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:31:02,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:31:02,543 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 04:31:02,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 371 flow. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:02,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:02,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 04:31:02,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:02,830 INFO L130 PetriNetUnfolder]: 990/1659 cut-off events. [2022-12-06 04:31:02,830 INFO L131 PetriNetUnfolder]: For 4489/4569 co-relation queries the response was YES. [2022-12-06 04:31:02,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6915 conditions, 1659 events. 990/1659 cut-off events. For 4489/4569 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 9349 event pairs, 68 based on Foata normal form. 122/1764 useless extension candidates. Maximal degree in co-relation 6890. Up to 617 conditions per place. [2022-12-06 04:31:02,837 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 62 selfloop transitions, 17 changer transitions 28/108 dead transitions. [2022-12-06 04:31:02,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 108 transitions, 970 flow [2022-12-06 04:31:02,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:31:02,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:31:02,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-12-06 04:31:02,838 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2022-12-06 04:31:02,838 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 371 flow. Second operand 6 states and 84 transitions. [2022-12-06 04:31:02,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 108 transitions, 970 flow [2022-12-06 04:31:02,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 108 transitions, 937 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 04:31:02,855 INFO L231 Difference]: Finished difference. Result has 63 places, 41 transitions, 310 flow [2022-12-06 04:31:02,856 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=310, PETRI_PLACES=63, PETRI_TRANSITIONS=41} [2022-12-06 04:31:02,856 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 27 predicate places. [2022-12-06 04:31:02,856 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:02,856 INFO L89 Accepts]: Start accepts. Operand has 63 places, 41 transitions, 310 flow [2022-12-06 04:31:02,857 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:02,857 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:02,857 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 41 transitions, 310 flow [2022-12-06 04:31:02,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 41 transitions, 310 flow [2022-12-06 04:31:02,869 INFO L130 PetriNetUnfolder]: 44/123 cut-off events. [2022-12-06 04:31:02,869 INFO L131 PetriNetUnfolder]: For 354/414 co-relation queries the response was YES. [2022-12-06 04:31:02,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 123 events. 44/123 cut-off events. For 354/414 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 463 event pairs, 1 based on Foata normal form. 5/119 useless extension candidates. Maximal degree in co-relation 464. Up to 38 conditions per place. [2022-12-06 04:31:02,870 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 41 transitions, 310 flow [2022-12-06 04:31:02,870 INFO L188 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-06 04:33:02,392 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [821] $Ultimate##0-->L829: Formula: (and (= v_P3Thread1of1ForFork2_~arg.offset_47 |v_P3Thread1of1ForFork2_#in~arg.offset_47|) (= |v_P2Thread1of1ForFork0_#in~arg.base_34| v_P2Thread1of1ForFork0_~arg.base_34) (= v_~x~0_83 v_~__unbuffered_p2_EAX~0_87) (= |v_P2Thread1of1ForFork0_#in~arg.offset_34| v_P2Thread1of1ForFork0_~arg.offset_34) (= |v_P3Thread1of1ForFork2_#in~arg.base_47| v_P3Thread1of1ForFork2_~arg.base_47) (= |v_#memory_int_716| (store |v_#memory_int_718| |v_~#y~0.base_351| (store (select |v_#memory_int_718| |v_~#y~0.base_351|) |v_~#y~0.offset_351| 2)))) InVars {~#y~0.offset=|v_~#y~0.offset_351|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_34|, #memory_int=|v_#memory_int_718|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_47|, ~#y~0.base=|v_~#y~0.base_351|, ~x~0=v_~x~0_83, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_34|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_47|} OutVars{~#y~0.offset=|v_~#y~0.offset_351|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_34|, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_47, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_34, ~#y~0.base=|v_~#y~0.base_351|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_47, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_47|, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_34, #memory_int=|v_#memory_int_716|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_47|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_87, ~x~0=v_~x~0_83, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_34|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P3Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork0_~arg.offset, #memory_int, ~__unbuffered_p2_EAX~0, P3Thread1of1ForFork2_~arg.base] and [823] L3-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse16 (= (mod v_~y$r_buff0_thd0~0_356 256) 0)) (.cse15 (= (mod v_~y$w_buff0_used~0_634 256) 0))) (let ((.cse7 (not .cse15)) (.cse9 (not .cse16))) (let ((.cse26 (ite (and .cse7 .cse9) 0 v_~y$w_buff0_used~0_634))) (let ((.cse27 (= (mod .cse26 256) 0))) (let ((.cse30 (not .cse27))) (let ((.cse31 (and .cse9 .cse30))) (let ((.cse1 (ite .cse31 0 v_~y$r_buff0_thd0~0_356)) (.cse11 (= (mod v_~y$w_buff1_used~0_606 256) 0)) (.cse10 (= 0 (mod v_~y$r_buff1_thd0~0_354 256)))) (let ((.cse13 (not .cse10)) (.cse14 (not .cse11)) (.cse3 (= (mod .cse1 256) 0))) (let ((.cse6 (not .cse3)) (.cse17 (ite (or .cse31 (and .cse13 .cse14)) 0 v_~y$w_buff1_used~0_606))) (let ((.cse29 (= (mod .cse17 256) 0)) (.cse28 (and .cse6 .cse30))) (let ((.cse20 (ite (or (and .cse13 (not .cse29)) .cse28) 0 v_~y$r_buff1_thd0~0_354))) (let ((.cse21 (= (mod .cse20 256) 0)) (.cse19 (= (mod v_~weak$$choice2~0_172 256) 0))) (let ((.cse5 (= (mod v_~y$w_buff0_used~0_632 256) 0)) (.cse2 (= (mod v_~y$w_buff1_used~0_604 256) 0)) (.cse12 (select |v_#memory_int_826| |v_~#y~0.base_397|)) (.cse0 (not .cse19)) (.cse18 (and .cse29 .cse3)) (.cse4 (and .cse21 .cse3))) (and (= v_~y$r_buff0_thd0~0_354 (ite .cse0 .cse1 (ite (or (and .cse2 .cse3) .cse4 .cse5) .cse1 (ite (and (not .cse5) .cse6) 0 .cse1)))) (= (mod v_~main$tmp_guard1~0_58 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31|) (= v_~weak$$choice2~0_172 |v_ULTIMATE.start_main_#t~nondet37#1_99|) (= |v_ULTIMATE.start_main_#t~nondet36#1_99| v_~weak$$choice0~0_170) (= v_~y$flush_delayed~0_160 0) (= v_~weak$$choice1~0_156 |v_ULTIMATE.start_main_#t~nondet41#1_91|) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~mem33#1_327| |v_ULTIMATE.start_main_#t~mem33#1_325|))) (or (and .cse7 (= |v_ULTIMATE.start_main_#t~ite34#1_320| |v_ULTIMATE.start_main_#t~ite34#1_318|) .cse8 .cse9 (= v_~y$mem_tmp~0_126 v_~y$w_buff0~0_363)) (and (or (and (or .cse10 .cse11) (= |v_ULTIMATE.start_main_#t~ite34#1_318| |v_ULTIMATE.start_main_#t~mem33#1_325|) (= (select .cse12 |v_~#y~0.offset_394|) |v_ULTIMATE.start_main_#t~mem33#1_325|)) (and .cse13 .cse8 .cse14 (= v_~y$w_buff1~0_382 |v_ULTIMATE.start_main_#t~ite34#1_318|))) (= v_~y$mem_tmp~0_126 |v_ULTIMATE.start_main_#t~ite34#1_318|) (or .cse15 .cse16)))) (= v_~y$w_buff1_used~0_604 (ite .cse0 .cse17 (ite (or .cse18 .cse4 .cse5) .cse17 0))) (= v_~y$w_buff0~0_363 v_~y$w_buff0~0_362) (= v_~y$w_buff1~0_382 v_~y$w_buff1~0_381) (= (store |v_#memory_int_826| |v_~#y~0.base_397| (store .cse12 |v_~#y~0.offset_394| |v_ULTIMATE.start_main_#t~ite47#1_120|)) |v_#memory_int_824|) (= (ite (= 0 (ite (not (and (= 2 v_~__unbuffered_p0_EAX~0_165) (= v_~__unbuffered_p0_EBX~0_68 0) (= v_~__unbuffered_p2_EAX~0_97 1) (= v_~y$mem_tmp~0_126 2))) 1 0)) 0 1) v_~main$tmp_guard1~0_58) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37| 0) (or (and .cse19 (= v_~y$mem_tmp~0_126 |v_ULTIMATE.start_main_#t~mem46#1_146|) (= |v_ULTIMATE.start_main_#t~ite47#1_120| |v_ULTIMATE.start_main_#t~mem46#1_146|)) (and (= |v_ULTIMATE.start_main_#t~mem46#1_148| |v_ULTIMATE.start_main_#t~mem46#1_146|) .cse0 (= v_~y$mem_tmp~0_126 |v_ULTIMATE.start_main_#t~ite47#1_120|))) (= v_~y$r_buff1_thd0~0_352 (ite .cse0 .cse20 (ite (let ((.cse22 (= 0 (mod v_~y$r_buff0_thd0~0_354 256)))) (or (and .cse21 .cse22) .cse5 (and .cse2 .cse22))) .cse20 0))) (let ((.cse23 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_115 256))) (.cse24 (= |v_ULTIMATE.start_main_#t~mem42#1_154| |v_ULTIMATE.start_main_#t~mem42#1_152|))) (or (and .cse23 .cse24 (= |v_ULTIMATE.start_main_#t~ite43#1_149| |v_ULTIMATE.start_main_#t~ite43#1_151|) (= v_~__unbuffered_p0_EAX~0_166 v_~__unbuffered_p0_EAX~0_165)) (and (not .cse23) (= |v_ULTIMATE.start_main_#t~ite43#1_149| v_~__unbuffered_p0_EAX~0_165) (let ((.cse25 (= (mod v_~weak$$choice1~0_156 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem42#1_152| (select (select (store |v_#memory_int_826| |v_~#y~0.base_397| (store .cse12 |v_~#y~0.offset_394| v_~y$mem_tmp~0_126)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_112) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_112)) (= |v_ULTIMATE.start_main_#t~mem42#1_152| |v_ULTIMATE.start_main_#t~ite43#1_149|) (not .cse25)) (and .cse25 (= |v_ULTIMATE.start_main_#t~ite43#1_149| v_~__unbuffered_p0_EAX~0_166) .cse24)))))) (= v_~y$w_buff0_used~0_632 (ite .cse0 .cse26 (ite (or .cse18 .cse27 .cse4) .cse26 (ite .cse28 0 .cse26)))))))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_394|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_68, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_634, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_320|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_99|, ~#y~0.base=|v_~#y~0.base_397|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_112, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_91|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_166, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_327|, ~y$w_buff1~0=v_~y$w_buff1~0_382, ULTIMATE.start_main_#t~ite43#1=|v_ULTIMATE.start_main_#t~ite43#1_151|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_148|, ~y$w_buff0~0=v_~y$w_buff0~0_363, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_356, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_154|, #memory_int=|v_#memory_int_826|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_112, ULTIMATE.start_main_#t~nondet37#1=|v_ULTIMATE.start_main_#t~nondet37#1_99|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_97, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_115, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_354, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_606} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|, ~#y~0.offset=|v_~#y~0.offset_394|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_58, ~#y~0.base=|v_~#y~0.base_397|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_227|, ~y$mem_tmp~0=v_~y$mem_tmp~0_126, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_165, ~weak$$choice1~0=v_~weak$$choice1~0_156, ~y$w_buff0~0=v_~y$w_buff0~0_362, ~y$flush_delayed~0=v_~y$flush_delayed~0_160, ULTIMATE.start_main_#t~ite44#1=|v_ULTIMATE.start_main_#t~ite44#1_76|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_97, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_115, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_147|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_117|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_68, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_63|, ULTIMATE.start_main_#t~ite47#1=|v_ULTIMATE.start_main_#t~ite47#1_119|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_112, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_67|, ~weak$$choice0~0=v_~weak$$choice0~0_170, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31|, ~y$w_buff1~0=v_~y$w_buff1~0_381, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_354, #memory_int=|v_#memory_int_824|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_112, ~weak$$choice2~0=v_~weak$$choice2~0_172, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_352, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_604} AuxVars[|v_ULTIMATE.start_main_#t~mem46#1_146|, |v_ULTIMATE.start_main_#t~mem42#1_152|, |v_ULTIMATE.start_main_#t~ite47#1_120|, |v_ULTIMATE.start_main_#t~mem33#1_325|, |v_ULTIMATE.start_main_#t~ite34#1_318|, |v_ULTIMATE.start_main_#t~ite43#1_149|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~y$w_buff0~0, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite44#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite34#1, ULTIMATE.start_main_#t~mem45#1, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#t~ite47#1, ULTIMATE.start_main_#t~mem38#1, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~mem33#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite43#1, ULTIMATE.start_main_#t~mem46#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem42#1, #memory_int, ULTIMATE.start_main_#t~nondet37#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 04:33:04,623 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [696] L812-->L820: Formula: (let ((.cse1 (= (mod v_~y$r_buff0_thd3~0_28 256) 0))) (let ((.cse0 (= (mod v_~y$w_buff0_used~0_215 256) 0)) (.cse3 (= (mod v_~y$r_buff1_thd3~0_28 256) 0)) (.cse11 (not (= (mod v_~y$w_buff0_used~0_214 256) 0))) (.cse9 (not .cse1)) (.cse4 (= (mod v_~y$w_buff1_used~0_190 256) 0))) (let ((.cse6 (not .cse4)) (.cse10 (and .cse11 .cse9)) (.cse2 (select |v_#memory_int_219| |v_~#y~0.base_154|)) (.cse7 (not .cse3)) (.cse8 (not .cse0))) (and (let ((.cse5 (= |v_P2Thread1of1ForFork0_#t~mem19_1| |v_P2_#t~mem19_36|))) (or (and (or .cse0 .cse1) (or (and (= |v_P2_#t~ite20_33| |v_P2_#t~mem19_36|) (= |v_P2_#t~mem19_36| (select .cse2 |v_~#y~0.offset_154|)) (or .cse3 .cse4)) (and .cse5 (= v_~y$w_buff1~0_100 |v_P2_#t~ite20_33|) .cse6 .cse7)) (= |v_P2_#t~ite20_33| |v_P2_#t~ite21_33|)) (and .cse5 (= |v_P2_#t~ite20_33| |v_P2Thread1of1ForFork0_#t~ite20_1|) .cse8 (= |v_P2_#t~ite21_33| v_~y$w_buff0~0_94) .cse9))) (= v_~y$w_buff1_used~0_189 (ite (or (and .cse6 .cse7) .cse10) 0 v_~y$w_buff1_used~0_190)) (= v_~y$r_buff0_thd3~0_27 (ite .cse10 0 v_~y$r_buff0_thd3~0_28)) (= (store |v_#memory_int_219| |v_~#y~0.base_154| (store .cse2 |v_~#y~0.offset_154| |v_P2_#t~ite21_33|)) |v_#memory_int_218|) (= (ite (or (and .cse11 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_189 256) 0)) .cse7)) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27) (= v_~y$w_buff0_used~0_214 (ite (and .cse8 .cse9) 0 v_~y$w_buff0_used~0_215)))))) InVars {P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~#y~0.offset=|v_~#y~0.offset_154|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_215, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_28, ~y$w_buff0~0=v_~y$w_buff0~0_94, #memory_int=|v_#memory_int_219|, ~#y~0.base=|v_~#y~0.base_154|, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_190} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~#y~0.offset=|v_~#y~0.offset_154|, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_214, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_94, #memory_int=|v_#memory_int_218|, ~#y~0.base=|v_~#y~0.base_154|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_189} AuxVars[|v_P2_#t~ite21_33|, |v_P2_#t~mem19_36|, |v_P2_#t~ite20_33|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, #memory_int, P2Thread1of1ForFork0_#t~ite20, ~y$w_buff1_used~0] and [823] L3-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse16 (= (mod v_~y$r_buff0_thd0~0_356 256) 0)) (.cse15 (= (mod v_~y$w_buff0_used~0_634 256) 0))) (let ((.cse7 (not .cse15)) (.cse9 (not .cse16))) (let ((.cse26 (ite (and .cse7 .cse9) 0 v_~y$w_buff0_used~0_634))) (let ((.cse27 (= (mod .cse26 256) 0))) (let ((.cse30 (not .cse27))) (let ((.cse31 (and .cse9 .cse30))) (let ((.cse1 (ite .cse31 0 v_~y$r_buff0_thd0~0_356)) (.cse11 (= (mod v_~y$w_buff1_used~0_606 256) 0)) (.cse10 (= 0 (mod v_~y$r_buff1_thd0~0_354 256)))) (let ((.cse13 (not .cse10)) (.cse14 (not .cse11)) (.cse3 (= (mod .cse1 256) 0))) (let ((.cse6 (not .cse3)) (.cse17 (ite (or .cse31 (and .cse13 .cse14)) 0 v_~y$w_buff1_used~0_606))) (let ((.cse29 (= (mod .cse17 256) 0)) (.cse28 (and .cse6 .cse30))) (let ((.cse20 (ite (or (and .cse13 (not .cse29)) .cse28) 0 v_~y$r_buff1_thd0~0_354))) (let ((.cse21 (= (mod .cse20 256) 0)) (.cse19 (= (mod v_~weak$$choice2~0_172 256) 0))) (let ((.cse5 (= (mod v_~y$w_buff0_used~0_632 256) 0)) (.cse2 (= (mod v_~y$w_buff1_used~0_604 256) 0)) (.cse12 (select |v_#memory_int_826| |v_~#y~0.base_397|)) (.cse0 (not .cse19)) (.cse18 (and .cse29 .cse3)) (.cse4 (and .cse21 .cse3))) (and (= v_~y$r_buff0_thd0~0_354 (ite .cse0 .cse1 (ite (or (and .cse2 .cse3) .cse4 .cse5) .cse1 (ite (and (not .cse5) .cse6) 0 .cse1)))) (= (mod v_~main$tmp_guard1~0_58 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31|) (= v_~weak$$choice2~0_172 |v_ULTIMATE.start_main_#t~nondet37#1_99|) (= |v_ULTIMATE.start_main_#t~nondet36#1_99| v_~weak$$choice0~0_170) (= v_~y$flush_delayed~0_160 0) (= v_~weak$$choice1~0_156 |v_ULTIMATE.start_main_#t~nondet41#1_91|) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~mem33#1_327| |v_ULTIMATE.start_main_#t~mem33#1_325|))) (or (and .cse7 (= |v_ULTIMATE.start_main_#t~ite34#1_320| |v_ULTIMATE.start_main_#t~ite34#1_318|) .cse8 .cse9 (= v_~y$mem_tmp~0_126 v_~y$w_buff0~0_363)) (and (or (and (or .cse10 .cse11) (= |v_ULTIMATE.start_main_#t~ite34#1_318| |v_ULTIMATE.start_main_#t~mem33#1_325|) (= (select .cse12 |v_~#y~0.offset_394|) |v_ULTIMATE.start_main_#t~mem33#1_325|)) (and .cse13 .cse8 .cse14 (= v_~y$w_buff1~0_382 |v_ULTIMATE.start_main_#t~ite34#1_318|))) (= v_~y$mem_tmp~0_126 |v_ULTIMATE.start_main_#t~ite34#1_318|) (or .cse15 .cse16)))) (= v_~y$w_buff1_used~0_604 (ite .cse0 .cse17 (ite (or .cse18 .cse4 .cse5) .cse17 0))) (= v_~y$w_buff0~0_363 v_~y$w_buff0~0_362) (= v_~y$w_buff1~0_382 v_~y$w_buff1~0_381) (= (store |v_#memory_int_826| |v_~#y~0.base_397| (store .cse12 |v_~#y~0.offset_394| |v_ULTIMATE.start_main_#t~ite47#1_120|)) |v_#memory_int_824|) (= (ite (= 0 (ite (not (and (= 2 v_~__unbuffered_p0_EAX~0_165) (= v_~__unbuffered_p0_EBX~0_68 0) (= v_~__unbuffered_p2_EAX~0_97 1) (= v_~y$mem_tmp~0_126 2))) 1 0)) 0 1) v_~main$tmp_guard1~0_58) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37| 0) (or (and .cse19 (= v_~y$mem_tmp~0_126 |v_ULTIMATE.start_main_#t~mem46#1_146|) (= |v_ULTIMATE.start_main_#t~ite47#1_120| |v_ULTIMATE.start_main_#t~mem46#1_146|)) (and (= |v_ULTIMATE.start_main_#t~mem46#1_148| |v_ULTIMATE.start_main_#t~mem46#1_146|) .cse0 (= v_~y$mem_tmp~0_126 |v_ULTIMATE.start_main_#t~ite47#1_120|))) (= v_~y$r_buff1_thd0~0_352 (ite .cse0 .cse20 (ite (let ((.cse22 (= 0 (mod v_~y$r_buff0_thd0~0_354 256)))) (or (and .cse21 .cse22) .cse5 (and .cse2 .cse22))) .cse20 0))) (let ((.cse23 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_115 256))) (.cse24 (= |v_ULTIMATE.start_main_#t~mem42#1_154| |v_ULTIMATE.start_main_#t~mem42#1_152|))) (or (and .cse23 .cse24 (= |v_ULTIMATE.start_main_#t~ite43#1_149| |v_ULTIMATE.start_main_#t~ite43#1_151|) (= v_~__unbuffered_p0_EAX~0_166 v_~__unbuffered_p0_EAX~0_165)) (and (not .cse23) (= |v_ULTIMATE.start_main_#t~ite43#1_149| v_~__unbuffered_p0_EAX~0_165) (let ((.cse25 (= (mod v_~weak$$choice1~0_156 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem42#1_152| (select (select (store |v_#memory_int_826| |v_~#y~0.base_397| (store .cse12 |v_~#y~0.offset_394| v_~y$mem_tmp~0_126)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_112) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_112)) (= |v_ULTIMATE.start_main_#t~mem42#1_152| |v_ULTIMATE.start_main_#t~ite43#1_149|) (not .cse25)) (and .cse25 (= |v_ULTIMATE.start_main_#t~ite43#1_149| v_~__unbuffered_p0_EAX~0_166) .cse24)))))) (= v_~y$w_buff0_used~0_632 (ite .cse0 .cse26 (ite (or .cse18 .cse27 .cse4) .cse26 (ite .cse28 0 .cse26)))))))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_394|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_68, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_634, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_320|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_99|, ~#y~0.base=|v_~#y~0.base_397|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_112, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_91|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_166, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_327|, ~y$w_buff1~0=v_~y$w_buff1~0_382, ULTIMATE.start_main_#t~ite43#1=|v_ULTIMATE.start_main_#t~ite43#1_151|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_148|, ~y$w_buff0~0=v_~y$w_buff0~0_363, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_356, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_154|, #memory_int=|v_#memory_int_826|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_112, ULTIMATE.start_main_#t~nondet37#1=|v_ULTIMATE.start_main_#t~nondet37#1_99|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_97, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_115, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_354, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_606} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|, ~#y~0.offset=|v_~#y~0.offset_394|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_58, ~#y~0.base=|v_~#y~0.base_397|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_227|, ~y$mem_tmp~0=v_~y$mem_tmp~0_126, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_165, ~weak$$choice1~0=v_~weak$$choice1~0_156, ~y$w_buff0~0=v_~y$w_buff0~0_362, ~y$flush_delayed~0=v_~y$flush_delayed~0_160, ULTIMATE.start_main_#t~ite44#1=|v_ULTIMATE.start_main_#t~ite44#1_76|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_97, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_115, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_147|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_117|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_68, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_63|, ULTIMATE.start_main_#t~ite47#1=|v_ULTIMATE.start_main_#t~ite47#1_119|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_112, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_67|, ~weak$$choice0~0=v_~weak$$choice0~0_170, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31|, ~y$w_buff1~0=v_~y$w_buff1~0_381, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_354, #memory_int=|v_#memory_int_824|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_112, ~weak$$choice2~0=v_~weak$$choice2~0_172, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_352, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_604} AuxVars[|v_ULTIMATE.start_main_#t~mem46#1_146|, |v_ULTIMATE.start_main_#t~mem42#1_152|, |v_ULTIMATE.start_main_#t~ite47#1_120|, |v_ULTIMATE.start_main_#t~mem33#1_325|, |v_ULTIMATE.start_main_#t~ite34#1_318|, |v_ULTIMATE.start_main_#t~ite43#1_149|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~y$w_buff0~0, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite44#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite34#1, ULTIMATE.start_main_#t~mem45#1, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#t~ite47#1, ULTIMATE.start_main_#t~mem38#1, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~mem33#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite43#1, ULTIMATE.start_main_#t~mem46#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem42#1, #memory_int, ULTIMATE.start_main_#t~nondet37#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 04:33:06,913 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [781] $Ultimate##0-->L829: Formula: (and (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= (store |v_#memory_int_343| |v_~#y~0.base_216| (store (select |v_#memory_int_343| |v_~#y~0.base_216|) |v_~#y~0.offset_216| 2)) |v_#memory_int_342|) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5)) InVars {~#y~0.offset=|v_~#y~0.offset_216|, #memory_int=|v_#memory_int_343|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~#y~0.base=|v_~#y~0.base_216|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{~#y~0.offset=|v_~#y~0.offset_216|, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, #memory_int=|v_#memory_int_342|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~#y~0.base=|v_~#y~0.base_216|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_~arg.offset, #memory_int, P3Thread1of1ForFork2_~arg.base] and [823] L3-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse16 (= (mod v_~y$r_buff0_thd0~0_356 256) 0)) (.cse15 (= (mod v_~y$w_buff0_used~0_634 256) 0))) (let ((.cse7 (not .cse15)) (.cse9 (not .cse16))) (let ((.cse26 (ite (and .cse7 .cse9) 0 v_~y$w_buff0_used~0_634))) (let ((.cse27 (= (mod .cse26 256) 0))) (let ((.cse30 (not .cse27))) (let ((.cse31 (and .cse9 .cse30))) (let ((.cse1 (ite .cse31 0 v_~y$r_buff0_thd0~0_356)) (.cse11 (= (mod v_~y$w_buff1_used~0_606 256) 0)) (.cse10 (= 0 (mod v_~y$r_buff1_thd0~0_354 256)))) (let ((.cse13 (not .cse10)) (.cse14 (not .cse11)) (.cse3 (= (mod .cse1 256) 0))) (let ((.cse6 (not .cse3)) (.cse17 (ite (or .cse31 (and .cse13 .cse14)) 0 v_~y$w_buff1_used~0_606))) (let ((.cse29 (= (mod .cse17 256) 0)) (.cse28 (and .cse6 .cse30))) (let ((.cse20 (ite (or (and .cse13 (not .cse29)) .cse28) 0 v_~y$r_buff1_thd0~0_354))) (let ((.cse21 (= (mod .cse20 256) 0)) (.cse19 (= (mod v_~weak$$choice2~0_172 256) 0))) (let ((.cse5 (= (mod v_~y$w_buff0_used~0_632 256) 0)) (.cse2 (= (mod v_~y$w_buff1_used~0_604 256) 0)) (.cse12 (select |v_#memory_int_826| |v_~#y~0.base_397|)) (.cse0 (not .cse19)) (.cse18 (and .cse29 .cse3)) (.cse4 (and .cse21 .cse3))) (and (= v_~y$r_buff0_thd0~0_354 (ite .cse0 .cse1 (ite (or (and .cse2 .cse3) .cse4 .cse5) .cse1 (ite (and (not .cse5) .cse6) 0 .cse1)))) (= (mod v_~main$tmp_guard1~0_58 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31|) (= v_~weak$$choice2~0_172 |v_ULTIMATE.start_main_#t~nondet37#1_99|) (= |v_ULTIMATE.start_main_#t~nondet36#1_99| v_~weak$$choice0~0_170) (= v_~y$flush_delayed~0_160 0) (= v_~weak$$choice1~0_156 |v_ULTIMATE.start_main_#t~nondet41#1_91|) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~mem33#1_327| |v_ULTIMATE.start_main_#t~mem33#1_325|))) (or (and .cse7 (= |v_ULTIMATE.start_main_#t~ite34#1_320| |v_ULTIMATE.start_main_#t~ite34#1_318|) .cse8 .cse9 (= v_~y$mem_tmp~0_126 v_~y$w_buff0~0_363)) (and (or (and (or .cse10 .cse11) (= |v_ULTIMATE.start_main_#t~ite34#1_318| |v_ULTIMATE.start_main_#t~mem33#1_325|) (= (select .cse12 |v_~#y~0.offset_394|) |v_ULTIMATE.start_main_#t~mem33#1_325|)) (and .cse13 .cse8 .cse14 (= v_~y$w_buff1~0_382 |v_ULTIMATE.start_main_#t~ite34#1_318|))) (= v_~y$mem_tmp~0_126 |v_ULTIMATE.start_main_#t~ite34#1_318|) (or .cse15 .cse16)))) (= v_~y$w_buff1_used~0_604 (ite .cse0 .cse17 (ite (or .cse18 .cse4 .cse5) .cse17 0))) (= v_~y$w_buff0~0_363 v_~y$w_buff0~0_362) (= v_~y$w_buff1~0_382 v_~y$w_buff1~0_381) (= (store |v_#memory_int_826| |v_~#y~0.base_397| (store .cse12 |v_~#y~0.offset_394| |v_ULTIMATE.start_main_#t~ite47#1_120|)) |v_#memory_int_824|) (= (ite (= 0 (ite (not (and (= 2 v_~__unbuffered_p0_EAX~0_165) (= v_~__unbuffered_p0_EBX~0_68 0) (= v_~__unbuffered_p2_EAX~0_97 1) (= v_~y$mem_tmp~0_126 2))) 1 0)) 0 1) v_~main$tmp_guard1~0_58) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37| 0) (or (and .cse19 (= v_~y$mem_tmp~0_126 |v_ULTIMATE.start_main_#t~mem46#1_146|) (= |v_ULTIMATE.start_main_#t~ite47#1_120| |v_ULTIMATE.start_main_#t~mem46#1_146|)) (and (= |v_ULTIMATE.start_main_#t~mem46#1_148| |v_ULTIMATE.start_main_#t~mem46#1_146|) .cse0 (= v_~y$mem_tmp~0_126 |v_ULTIMATE.start_main_#t~ite47#1_120|))) (= v_~y$r_buff1_thd0~0_352 (ite .cse0 .cse20 (ite (let ((.cse22 (= 0 (mod v_~y$r_buff0_thd0~0_354 256)))) (or (and .cse21 .cse22) .cse5 (and .cse2 .cse22))) .cse20 0))) (let ((.cse23 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_115 256))) (.cse24 (= |v_ULTIMATE.start_main_#t~mem42#1_154| |v_ULTIMATE.start_main_#t~mem42#1_152|))) (or (and .cse23 .cse24 (= |v_ULTIMATE.start_main_#t~ite43#1_149| |v_ULTIMATE.start_main_#t~ite43#1_151|) (= v_~__unbuffered_p0_EAX~0_166 v_~__unbuffered_p0_EAX~0_165)) (and (not .cse23) (= |v_ULTIMATE.start_main_#t~ite43#1_149| v_~__unbuffered_p0_EAX~0_165) (let ((.cse25 (= (mod v_~weak$$choice1~0_156 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem42#1_152| (select (select (store |v_#memory_int_826| |v_~#y~0.base_397| (store .cse12 |v_~#y~0.offset_394| v_~y$mem_tmp~0_126)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_112) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_112)) (= |v_ULTIMATE.start_main_#t~mem42#1_152| |v_ULTIMATE.start_main_#t~ite43#1_149|) (not .cse25)) (and .cse25 (= |v_ULTIMATE.start_main_#t~ite43#1_149| v_~__unbuffered_p0_EAX~0_166) .cse24)))))) (= v_~y$w_buff0_used~0_632 (ite .cse0 .cse26 (ite (or .cse18 .cse27 .cse4) .cse26 (ite .cse28 0 .cse26)))))))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_394|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_68, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_634, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_320|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_99|, ~#y~0.base=|v_~#y~0.base_397|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_112, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_91|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_166, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_327|, ~y$w_buff1~0=v_~y$w_buff1~0_382, ULTIMATE.start_main_#t~ite43#1=|v_ULTIMATE.start_main_#t~ite43#1_151|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_148|, ~y$w_buff0~0=v_~y$w_buff0~0_363, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_356, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_154|, #memory_int=|v_#memory_int_826|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_112, ULTIMATE.start_main_#t~nondet37#1=|v_ULTIMATE.start_main_#t~nondet37#1_99|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_97, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_115, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_354, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_606} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|, ~#y~0.offset=|v_~#y~0.offset_394|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_58, ~#y~0.base=|v_~#y~0.base_397|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_227|, ~y$mem_tmp~0=v_~y$mem_tmp~0_126, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_165, ~weak$$choice1~0=v_~weak$$choice1~0_156, ~y$w_buff0~0=v_~y$w_buff0~0_362, ~y$flush_delayed~0=v_~y$flush_delayed~0_160, ULTIMATE.start_main_#t~ite44#1=|v_ULTIMATE.start_main_#t~ite44#1_76|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_97, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_115, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_147|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_117|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_68, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_63|, ULTIMATE.start_main_#t~ite47#1=|v_ULTIMATE.start_main_#t~ite47#1_119|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_112, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_67|, ~weak$$choice0~0=v_~weak$$choice0~0_170, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31|, ~y$w_buff1~0=v_~y$w_buff1~0_381, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_354, #memory_int=|v_#memory_int_824|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_112, ~weak$$choice2~0=v_~weak$$choice2~0_172, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_352, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_604} AuxVars[|v_ULTIMATE.start_main_#t~mem46#1_146|, |v_ULTIMATE.start_main_#t~mem42#1_152|, |v_ULTIMATE.start_main_#t~ite47#1_120|, |v_ULTIMATE.start_main_#t~mem33#1_325|, |v_ULTIMATE.start_main_#t~ite34#1_318|, |v_ULTIMATE.start_main_#t~ite43#1_149|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~y$w_buff0~0, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite44#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite34#1, ULTIMATE.start_main_#t~mem45#1, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#t~ite47#1, ULTIMATE.start_main_#t~mem38#1, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~mem33#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite43#1, ULTIMATE.start_main_#t~mem46#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem42#1, #memory_int, ULTIMATE.start_main_#t~nondet37#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 04:33:09,790 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [826] $Ultimate##0-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse21 (= (mod v_~y$r_buff0_thd0~0_361 256) 0)) (.cse20 (= (mod v_~y$w_buff0_used~0_639 256) 0))) (let ((.cse17 (not .cse20)) (.cse18 (not .cse21))) (let ((.cse5 (ite (and .cse17 .cse18) 0 v_~y$w_buff0_used~0_639))) (let ((.cse6 (= (mod .cse5 256) 0))) (let ((.cse30 (not .cse6))) (let ((.cse31 (and .cse30 .cse18))) (let ((.cse10 (ite .cse31 0 v_~y$r_buff0_thd0~0_361)) (.cse23 (= (mod v_~y$w_buff1_used~0_611 256) 0)) (.cse22 (= (mod v_~y$r_buff1_thd0~0_359 256) 0))) (let ((.cse24 (not .cse22)) (.cse25 (not .cse23)) (.cse11 (= (mod .cse10 256) 0))) (let ((.cse14 (not .cse11)) (.cse15 (ite (or (and .cse24 .cse25) .cse31) 0 v_~y$w_buff1_used~0_611))) (let ((.cse29 (= (mod .cse15 256) 0)) (.cse9 (and .cse14 .cse30))) (let ((.cse26 (ite (or (and .cse24 (not .cse29)) .cse9) 0 v_~y$r_buff1_thd0~0_359))) (let ((.cse16 (= (mod v_~weak$$choice2~0_174 256) 0)) (.cse28 (= (mod .cse26 256) 0))) (let ((.cse7 (and .cse11 .cse29)) (.cse8 (and .cse11 .cse28)) (.cse2 (select |v_#memory_int_832| |v_~#y~0.base_399|)) (.cse4 (not .cse16)) (.cse12 (= (mod v_~y$w_buff1_used~0_610 256) 0)) (.cse13 (= (mod v_~y$w_buff0_used~0_638 256) 0))) (and (= |v_P2Thread1of1ForFork0_#in~arg.offset_44| v_P2Thread1of1ForFork0_~arg.offset_44) (= |v_ULTIMATE.start_main_#t~nondet36#1_103| v_~weak$$choice0~0_172) (let ((.cse3 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_117 256) 0)) (.cse0 (= |v_ULTIMATE.start_main_#t~mem42#1_161| |v_ULTIMATE.start_main_#t~mem42#1_159|))) (or (and (= |v_ULTIMATE.start_main_#t~ite43#1_156| v_~__unbuffered_p0_EAX~0_169) (let ((.cse1 (= (mod v_~weak$$choice1~0_158 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite43#1_156| v_~__unbuffered_p0_EAX~0_170) .cse0 .cse1) (and (not .cse1) (= |v_ULTIMATE.start_main_#t~mem42#1_159| (select (select (store |v_#memory_int_832| |v_~#y~0.base_399| (store .cse2 |v_~#y~0.offset_396| v_~y$mem_tmp~0_128)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_114) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_114)) (= |v_ULTIMATE.start_main_#t~mem42#1_159| |v_ULTIMATE.start_main_#t~ite43#1_156|)))) (not .cse3)) (and (= v_~__unbuffered_p0_EAX~0_169 v_~__unbuffered_p0_EAX~0_170) .cse3 (= |v_ULTIMATE.start_main_#t~ite43#1_158| |v_ULTIMATE.start_main_#t~ite43#1_156|) .cse0))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_33| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|) (= v_~y$w_buff0_used~0_638 (ite .cse4 .cse5 (ite (or .cse6 .cse7 .cse8) .cse5 (ite .cse9 0 .cse5)))) (= v_~x~0_97 v_~__unbuffered_p2_EAX~0_99) (= v_~y$r_buff0_thd0~0_360 (ite .cse4 .cse10 (ite (or (and .cse11 .cse12) .cse8 .cse13) .cse10 (ite (and .cse14 (not .cse13)) 0 .cse10)))) (= v_P3Thread1of1ForFork2_~arg.offset_61 |v_P3Thread1of1ForFork2_#in~arg.offset_61|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39| 0) (= |v_P3Thread1of1ForFork2_#in~arg.base_61| v_P3Thread1of1ForFork2_~arg.base_61) (= (ite (= (ite (not (and (= v_~y$mem_tmp~0_128 2) (= 2 v_~__unbuffered_p0_EAX~0_169) (= v_~__unbuffered_p0_EBX~0_72 0) (= v_~__unbuffered_p2_EAX~0_99 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_60) (= v_~weak$$choice1~0_158 |v_ULTIMATE.start_main_#t~nondet41#1_95|) (= v_~y$w_buff1_used~0_610 (ite .cse4 .cse15 (ite (or .cse7 .cse8 .cse13) .cse15 0))) (= v_~y$flush_delayed~0_162 0) (= v_~y$w_buff1~0_386 v_~y$w_buff1~0_385) (= v_~y$w_buff0~0_367 v_~y$w_buff0~0_366) (or (and .cse16 (= |v_ULTIMATE.start_main_#t~ite47#1_125| |v_ULTIMATE.start_main_#t~mem46#1_153|) (= v_~y$mem_tmp~0_128 |v_ULTIMATE.start_main_#t~mem46#1_153|)) (and .cse4 (= v_~y$mem_tmp~0_128 |v_ULTIMATE.start_main_#t~ite47#1_125|) (= |v_ULTIMATE.start_main_#t~mem46#1_155| |v_ULTIMATE.start_main_#t~mem46#1_153|))) (= |v_#memory_int_830| (store |v_#memory_int_832| |v_~#y~0.base_399| (store .cse2 |v_~#y~0.offset_396| |v_ULTIMATE.start_main_#t~ite47#1_125|))) (let ((.cse19 (= |v_ULTIMATE.start_main_#t~mem33#1_332| |v_ULTIMATE.start_main_#t~mem33#1_334|))) (or (and .cse17 .cse18 (= v_~y$mem_tmp~0_128 v_~y$w_buff0~0_367) (= |v_ULTIMATE.start_main_#t~ite34#1_327| |v_ULTIMATE.start_main_#t~ite34#1_325|) .cse19) (and (or .cse20 .cse21) (= v_~y$mem_tmp~0_128 |v_ULTIMATE.start_main_#t~ite34#1_325|) (or (and (or .cse22 .cse23) (= |v_ULTIMATE.start_main_#t~ite34#1_325| |v_ULTIMATE.start_main_#t~mem33#1_332|)) (and .cse24 .cse19 (= v_~y$w_buff1~0_386 |v_ULTIMATE.start_main_#t~ite34#1_325|) .cse25))))) (= (mod v_~main$tmp_guard1~0_60 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_33|) (= v_~y$r_buff1_thd0~0_358 (ite .cse4 .cse26 (ite (let ((.cse27 (= (mod v_~y$r_buff0_thd0~0_360 256) 0))) (or (and .cse12 .cse27) (and .cse27 .cse28) .cse13)) .cse26 0))) (= |v_P2Thread1of1ForFork0_#in~arg.base_44| v_P2Thread1of1ForFork0_~arg.base_44) (= v_~weak$$choice2~0_174 |v_ULTIMATE.start_main_#t~nondet37#1_103|))))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_396|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_639, ~#y~0.base=|v_~#y~0.base_399|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_170, ~y$w_buff0~0=v_~y$w_buff0~0_367, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_61|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_117, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_72, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_44|, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_327|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_103|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_114, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_61|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_95|, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_334|, ~y$w_buff1~0=v_~y$w_buff1~0_386, ULTIMATE.start_main_#t~ite43#1=|v_ULTIMATE.start_main_#t~ite43#1_158|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_155|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_361, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_161|, #memory_int=|v_#memory_int_832|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_114, ULTIMATE.start_main_#t~nondet37#1=|v_ULTIMATE.start_main_#t~nondet37#1_103|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_359, ~x~0=v_~x~0_97, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_44|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_611} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|, ~#y~0.offset=|v_~#y~0.offset_396|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_638, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_61, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_60, ~#y~0.base=|v_~#y~0.base_399|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_61, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_231|, ~y$mem_tmp~0=v_~y$mem_tmp~0_128, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_169, ~weak$$choice1~0=v_~weak$$choice1~0_158, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_44, ~y$w_buff0~0=v_~y$w_buff0~0_366, ~y$flush_delayed~0=v_~y$flush_delayed~0_162, ULTIMATE.start_main_#t~ite44#1=|v_ULTIMATE.start_main_#t~ite44#1_78|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_61|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_99, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_117, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_152|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_121|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_72, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_44|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_65|, ULTIMATE.start_main_#t~ite47#1=|v_ULTIMATE.start_main_#t~ite47#1_124|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_44, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_114, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_61|, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_69|, ~weak$$choice0~0=v_~weak$$choice0~0_172, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_33|, ~y$w_buff1~0=v_~y$w_buff1~0_385, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_360, #memory_int=|v_#memory_int_830|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_114, ~weak$$choice2~0=v_~weak$$choice2~0_174, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_358, ~x~0=v_~x~0_97, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_44|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_610} AuxVars[|v_ULTIMATE.start_main_#t~mem42#1_159|, |v_ULTIMATE.start_main_#t~ite43#1_156|, |v_ULTIMATE.start_main_#t~ite47#1_125|, |v_ULTIMATE.start_main_#t~mem33#1_332|, |v_ULTIMATE.start_main_#t~mem46#1_153|, |v_ULTIMATE.start_main_#t~ite34#1_325|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, P3Thread1of1ForFork2_~arg.offset, ~main$tmp_guard1~0, P3Thread1of1ForFork2_~arg.base, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, P2Thread1of1ForFork0_~arg.base, ~y$w_buff0~0, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite44#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite34#1, ULTIMATE.start_main_#t~mem45#1, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#t~ite47#1, P2Thread1of1ForFork0_~arg.offset, ULTIMATE.start_main_#t~mem38#1, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~mem33#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite43#1, ULTIMATE.start_main_#t~mem46#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem42#1, #memory_int, ULTIMATE.start_main_#t~nondet37#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [702] L829-->L837: Formula: (let ((.cse9 (= (mod v_~y$r_buff0_thd4~0_32 256) 0))) (let ((.cse8 (= (mod v_~y$r_buff1_thd4~0_30 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_174 256) 0)) (.cse0 (not .cse9)) (.cse11 (not (= (mod v_~y$w_buff0_used~0_200 256) 0))) (.cse10 (= (mod v_~y$w_buff0_used~0_201 256) 0))) (let ((.cse2 (select |v_#memory_int_201| |v_~#y~0.base_144|)) (.cse1 (not .cse10)) (.cse3 (and .cse0 .cse11)) (.cse6 (not .cse7)) (.cse4 (not .cse8))) (and (= v_~y$w_buff0_used~0_200 (ite (and .cse0 .cse1) 0 v_~y$w_buff0_used~0_201)) (= (store |v_#memory_int_201| |v_~#y~0.base_144| (store .cse2 |v_~#y~0.offset_144| |v_P3_#t~ite24_29|)) |v_#memory_int_200|) (= (ite .cse3 0 v_~y$r_buff0_thd4~0_32) v_~y$r_buff0_thd4~0_31) (let ((.cse5 (= |v_P3_#t~mem22_32| |v_P3Thread1of1ForFork2_#t~mem22_1|))) (or (and (or (and .cse4 (= |v_P3_#t~ite23_27| v_~y$w_buff1~0_86) .cse5 .cse6) (and (or .cse7 .cse8) (= |v_P3_#t~ite23_27| |v_P3_#t~mem22_32|) (= (select .cse2 |v_~#y~0.offset_144|) |v_P3_#t~mem22_32|))) (or .cse9 .cse10) (= |v_P3_#t~ite23_27| |v_P3_#t~ite24_29|)) (and (= |v_P3_#t~ite24_29| v_~y$w_buff0~0_84) .cse0 (= |v_P3Thread1of1ForFork2_#t~ite23_1| |v_P3_#t~ite23_27|) .cse5 .cse1))) (= v_~y$w_buff1_used~0_173 (ite (or .cse3 (and .cse4 .cse6)) 0 v_~y$w_buff1_used~0_174)) (= (ite (or (and .cse11 (not (= (mod v_~y$r_buff0_thd4~0_31 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_173 256) 0)))) 0 v_~y$r_buff1_thd4~0_30) v_~y$r_buff1_thd4~0_29))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_32, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_30, ~#y~0.offset=|v_~#y~0.offset_144|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_201, ~y$w_buff1~0=v_~y$w_buff1~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_84, #memory_int=|v_#memory_int_201|, P3Thread1of1ForFork2_#t~ite23=|v_P3Thread1of1ForFork2_#t~ite23_1|, ~#y~0.base=|v_~#y~0.base_144|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_174, P3Thread1of1ForFork2_#t~mem22=|v_P3Thread1of1ForFork2_#t~mem22_1|} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_31, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_29, ~#y~0.offset=|v_~#y~0.offset_144|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_200, ~y$w_buff1~0=v_~y$w_buff1~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_84, #memory_int=|v_#memory_int_200|, P3Thread1of1ForFork2_#t~ite24=|v_P3Thread1of1ForFork2_#t~ite24_1|, ~#y~0.base=|v_~#y~0.base_144|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_173} AuxVars[|v_P3_#t~ite24_29|, |v_P3_#t~ite23_27|, |v_P3_#t~mem22_32|] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, #memory_int, P3Thread1of1ForFork2_#t~ite24, P3Thread1of1ForFork2_#t~ite23, ~y$w_buff1_used~0, P3Thread1of1ForFork2_#t~mem22] [2022-12-06 04:33:12,134 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [828] $Ultimate##0-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse7 (= (mod v_~y$r_buff0_thd0~0_369 256) 0)) (.cse8 (= (mod v_~y$w_buff0_used~0_649 256) 0))) (let ((.cse1 (not .cse8)) (.cse2 (not .cse7))) (let ((.cse26 (ite (and .cse1 .cse2) 0 v_~y$w_buff0_used~0_649))) (let ((.cse27 (= (mod .cse26 256) 0))) (let ((.cse30 (not .cse27))) (let ((.cse31 (and .cse30 .cse2))) (let ((.cse3 (= (mod v_~y$w_buff1_used~0_621 256) 0)) (.cse4 (= (mod v_~y$r_buff1_thd0~0_367 256) 0)) (.cse19 (ite .cse31 0 v_~y$r_buff0_thd0~0_369))) (let ((.cse20 (= (mod .cse19 256) 0)) (.cse5 (not .cse4)) (.cse6 (not .cse3))) (let ((.cse15 (ite (or .cse31 (and .cse5 .cse6)) 0 v_~y$w_buff1_used~0_621)) (.cse22 (not .cse20))) (let ((.cse28 (and .cse30 .cse22)) (.cse29 (= (mod .cse15 256) 0))) (let ((.cse23 (ite (or .cse28 (and .cse5 (not .cse29))) 0 v_~y$r_buff1_thd0~0_367))) (let ((.cse25 (= (mod .cse23 256) 0)) (.cse13 (= (mod v_~weak$$choice2~0_178 256) 0))) (let ((.cse12 (select |v_#memory_int_844| |v_~#y~0.base_403|)) (.cse21 (= (mod v_~y$w_buff1_used~0_620 256) 0)) (.cse18 (= (mod v_~y$w_buff0_used~0_648 256) 0)) (.cse14 (not .cse13)) (.cse16 (and .cse25 .cse20)) (.cse17 (and .cse20 .cse29))) (and (let ((.cse0 (= |v_ULTIMATE.start_main_#t~mem33#1_346| |v_ULTIMATE.start_main_#t~mem33#1_344|))) (or (and .cse0 (= v_~y$mem_tmp~0_132 v_~y$w_buff0~0_375) .cse1 .cse2 (= |v_ULTIMATE.start_main_#t~ite34#1_339| |v_ULTIMATE.start_main_#t~ite34#1_337|)) (and (or (and (= |v_ULTIMATE.start_main_#t~ite34#1_337| |v_ULTIMATE.start_main_#t~mem33#1_344|) (or .cse3 .cse4)) (and .cse0 .cse5 (= v_~y$w_buff1~0_394 |v_ULTIMATE.start_main_#t~ite34#1_337|) .cse6)) (= v_~y$mem_tmp~0_132 |v_ULTIMATE.start_main_#t~ite34#1_337|) (or .cse7 .cse8)))) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (= v_P3Thread1of1ForFork2_~arg.offset_63 |v_P3Thread1of1ForFork2_#in~arg.offset_63|) (= v_~weak$$choice1~0_162 |v_ULTIMATE.start_main_#t~nondet41#1_103|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (let ((.cse10 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_121 256) 0)) (.cse9 (= |v_ULTIMATE.start_main_#t~mem42#1_173| |v_ULTIMATE.start_main_#t~mem42#1_171|))) (or (and (= |v_ULTIMATE.start_main_#t~ite43#1_168| |v_ULTIMATE.start_main_#t~ite43#1_170|) .cse9 (= v_~__unbuffered_p0_EAX~0_178 v_~__unbuffered_p0_EAX~0_177) .cse10) (and (= |v_ULTIMATE.start_main_#t~ite43#1_168| v_~__unbuffered_p0_EAX~0_177) (not .cse10) (let ((.cse11 (= (mod v_~weak$$choice1~0_162 256) 0))) (or (and .cse9 .cse11 (= |v_ULTIMATE.start_main_#t~ite43#1_168| v_~__unbuffered_p0_EAX~0_178)) (and (not .cse11) (= |v_ULTIMATE.start_main_#t~mem42#1_171| |v_ULTIMATE.start_main_#t~ite43#1_168|) (= |v_ULTIMATE.start_main_#t~mem42#1_171| (select (select (store |v_#memory_int_844| |v_~#y~0.base_403| (store .cse12 |v_~#y~0.offset_400| v_~y$mem_tmp~0_132)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_118) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_118)))))))) (= v_~y$w_buff1~0_394 v_~y$w_buff1~0_393) (= v_~y$w_buff0~0_375 v_~y$w_buff0~0_374) (or (and (= v_~y$mem_tmp~0_132 |v_ULTIMATE.start_main_#t~mem46#1_165|) (= |v_ULTIMATE.start_main_#t~ite47#1_133| |v_ULTIMATE.start_main_#t~mem46#1_165|) .cse13) (and .cse14 (= v_~y$mem_tmp~0_132 |v_ULTIMATE.start_main_#t~ite47#1_133|) (= |v_ULTIMATE.start_main_#t~mem46#1_165| |v_ULTIMATE.start_main_#t~mem46#1_167|))) (= |v_ULTIMATE.start_main_#t~nondet36#1_111| v_~weak$$choice0~0_176) (= v_~weak$$choice2~0_178 |v_ULTIMATE.start_main_#t~nondet37#1_111|) (= v_~y$flush_delayed~0_166 0) (= (ite .cse14 .cse15 (ite (or .cse16 .cse17 .cse18) .cse15 0)) v_~y$w_buff1_used~0_620) (= v_~main$tmp_guard1~0_64 (ite (= (ite (not (and (= 2 v_~__unbuffered_p0_EAX~0_177) (= v_~__unbuffered_p2_EAX~0_103 1) (= v_~__unbuffered_p0_EBX~0_76 0) (= v_~y$mem_tmp~0_132 2))) 1 0) 0) 0 1)) (= v_~y$r_buff0_thd0~0_368 (ite .cse14 .cse19 (ite (or .cse16 .cse18 (and .cse20 .cse21)) .cse19 (ite (and (not .cse18) .cse22) 0 .cse19)))) (= |v_#memory_int_842| (store |v_#memory_int_844| |v_~#y~0.base_403| (store .cse12 |v_~#y~0.offset_400| |v_ULTIMATE.start_main_#t~ite47#1_133|))) (= v_~y$r_buff1_thd0~0_366 (ite .cse14 .cse23 (ite (let ((.cse24 (= (mod v_~y$r_buff0_thd0~0_368 256) 0))) (or (and .cse24 .cse21) .cse18 (and .cse25 .cse24))) .cse23 0))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37| (mod v_~main$tmp_guard1~0_64 256)) (= |v_P3Thread1of1ForFork2_#in~arg.base_63| v_P3Thread1of1ForFork2_~arg.base_63) (= v_~y$w_buff0_used~0_648 (ite .cse14 .cse26 (ite (or .cse16 .cse17 .cse27) .cse26 (ite .cse28 0 .cse26)))))))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_400|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_649, ~#y~0.base=|v_~#y~0.base_403|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ~y$w_buff0~0=v_~y$w_buff0~0_375, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_63|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_103, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_121, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_76, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_339|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_111|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_118, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_63|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_103|, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_346|, ~y$w_buff1~0=v_~y$w_buff1~0_394, ULTIMATE.start_main_#t~ite43#1=|v_ULTIMATE.start_main_#t~ite43#1_170|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_167|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_369, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_173|, #memory_int=|v_#memory_int_844|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_118, ULTIMATE.start_main_#t~nondet37#1=|v_ULTIMATE.start_main_#t~nondet37#1_111|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_367, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_621} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~#y~0.offset=|v_~#y~0.offset_400|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_648, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_63, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_64, ~#y~0.base=|v_~#y~0.base_403|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_63, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_235|, ~y$mem_tmp~0=v_~y$mem_tmp~0_132, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_177, ~weak$$choice1~0=v_~weak$$choice1~0_162, ~y$w_buff0~0=v_~y$w_buff0~0_374, ~y$flush_delayed~0=v_~y$flush_delayed~0_166, ULTIMATE.start_main_#t~ite44#1=|v_ULTIMATE.start_main_#t~ite44#1_82|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_63|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_103, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_121, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_156|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_125|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_76, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_69|, ULTIMATE.start_main_#t~ite47#1=|v_ULTIMATE.start_main_#t~ite47#1_132|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_118, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_63|, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_73|, ~weak$$choice0~0=v_~weak$$choice0~0_176, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|, ~y$w_buff1~0=v_~y$w_buff1~0_393, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_368, #memory_int=|v_#memory_int_842|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_118, ~weak$$choice2~0=v_~weak$$choice2~0_178, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_366, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_620} AuxVars[|v_ULTIMATE.start_main_#t~ite47#1_133|, |v_ULTIMATE.start_main_#t~ite43#1_168|, |v_ULTIMATE.start_main_#t~mem33#1_344|, |v_ULTIMATE.start_main_#t~mem42#1_171|, |v_ULTIMATE.start_main_#t~ite34#1_337|, |v_ULTIMATE.start_main_#t~mem46#1_165|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, P3Thread1of1ForFork2_~arg.offset, ~main$tmp_guard1~0, P3Thread1of1ForFork2_~arg.base, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~y$w_buff0~0, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite44#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite34#1, ULTIMATE.start_main_#t~mem45#1, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#t~ite47#1, ULTIMATE.start_main_#t~mem38#1, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~mem33#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite43#1, ULTIMATE.start_main_#t~mem46#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem42#1, #memory_int, ULTIMATE.start_main_#t~nondet37#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [702] L829-->L837: Formula: (let ((.cse9 (= (mod v_~y$r_buff0_thd4~0_32 256) 0))) (let ((.cse8 (= (mod v_~y$r_buff1_thd4~0_30 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_174 256) 0)) (.cse0 (not .cse9)) (.cse11 (not (= (mod v_~y$w_buff0_used~0_200 256) 0))) (.cse10 (= (mod v_~y$w_buff0_used~0_201 256) 0))) (let ((.cse2 (select |v_#memory_int_201| |v_~#y~0.base_144|)) (.cse1 (not .cse10)) (.cse3 (and .cse0 .cse11)) (.cse6 (not .cse7)) (.cse4 (not .cse8))) (and (= v_~y$w_buff0_used~0_200 (ite (and .cse0 .cse1) 0 v_~y$w_buff0_used~0_201)) (= (store |v_#memory_int_201| |v_~#y~0.base_144| (store .cse2 |v_~#y~0.offset_144| |v_P3_#t~ite24_29|)) |v_#memory_int_200|) (= (ite .cse3 0 v_~y$r_buff0_thd4~0_32) v_~y$r_buff0_thd4~0_31) (let ((.cse5 (= |v_P3_#t~mem22_32| |v_P3Thread1of1ForFork2_#t~mem22_1|))) (or (and (or (and .cse4 (= |v_P3_#t~ite23_27| v_~y$w_buff1~0_86) .cse5 .cse6) (and (or .cse7 .cse8) (= |v_P3_#t~ite23_27| |v_P3_#t~mem22_32|) (= (select .cse2 |v_~#y~0.offset_144|) |v_P3_#t~mem22_32|))) (or .cse9 .cse10) (= |v_P3_#t~ite23_27| |v_P3_#t~ite24_29|)) (and (= |v_P3_#t~ite24_29| v_~y$w_buff0~0_84) .cse0 (= |v_P3Thread1of1ForFork2_#t~ite23_1| |v_P3_#t~ite23_27|) .cse5 .cse1))) (= v_~y$w_buff1_used~0_173 (ite (or .cse3 (and .cse4 .cse6)) 0 v_~y$w_buff1_used~0_174)) (= (ite (or (and .cse11 (not (= (mod v_~y$r_buff0_thd4~0_31 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_173 256) 0)))) 0 v_~y$r_buff1_thd4~0_30) v_~y$r_buff1_thd4~0_29))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_32, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_30, ~#y~0.offset=|v_~#y~0.offset_144|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_201, ~y$w_buff1~0=v_~y$w_buff1~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_84, #memory_int=|v_#memory_int_201|, P3Thread1of1ForFork2_#t~ite23=|v_P3Thread1of1ForFork2_#t~ite23_1|, ~#y~0.base=|v_~#y~0.base_144|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_174, P3Thread1of1ForFork2_#t~mem22=|v_P3Thread1of1ForFork2_#t~mem22_1|} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_31, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_29, ~#y~0.offset=|v_~#y~0.offset_144|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_200, ~y$w_buff1~0=v_~y$w_buff1~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_84, #memory_int=|v_#memory_int_200|, P3Thread1of1ForFork2_#t~ite24=|v_P3Thread1of1ForFork2_#t~ite24_1|, ~#y~0.base=|v_~#y~0.base_144|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_173} AuxVars[|v_P3_#t~ite24_29|, |v_P3_#t~ite23_27|, |v_P3_#t~mem22_32|] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, #memory_int, P3Thread1of1ForFork2_#t~ite24, P3Thread1of1ForFork2_#t~ite23, ~y$w_buff1_used~0, P3Thread1of1ForFork2_#t~mem22] [2022-12-06 04:33:14,564 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [819] $Ultimate##0-->L812: Formula: (and (= (store |v_#memory_int_620| |v_~#y~0.base_308| (store (select |v_#memory_int_620| |v_~#y~0.base_308|) |v_~#y~0.offset_308| 1)) |v_#memory_int_619|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_21| v_P2Thread1of1ForFork0_~arg.offset_21) (= |v_P2Thread1of1ForFork0_#in~arg.base_21| v_P2Thread1of1ForFork0_~arg.base_21) (= v_~x~0_70 v_~__unbuffered_p2_EAX~0_74)) InVars {~#y~0.offset=|v_~#y~0.offset_308|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, #memory_int=|v_#memory_int_620|, ~#y~0.base=|v_~#y~0.base_308|, ~x~0=v_~x~0_70, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_21, ~#y~0.offset=|v_~#y~0.offset_308|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_21, #memory_int=|v_#memory_int_619|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_74, ~#y~0.base=|v_~#y~0.base_308|, ~x~0=v_~x~0_70, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, #memory_int, ~__unbuffered_p2_EAX~0] and [814] L859-3-->L861-2: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2228~0#1.base_30| 0)) (= (store |v_#valid_112| |v_ULTIMATE.start_main_~#t2228~0#1.base_30| 1) |v_#valid_111|) (= (select |v_#valid_112| |v_ULTIMATE.start_main_~#t2228~0#1.base_30|) 0) (= 0 |v_ULTIMATE.start_main_~#t2228~0#1.offset_30|) (= (store |v_#memory_int_411| |v_ULTIMATE.start_main_~#t2228~0#1.base_30| (store (select |v_#memory_int_411| |v_ULTIMATE.start_main_~#t2228~0#1.base_30|) |v_ULTIMATE.start_main_~#t2228~0#1.offset_30| |v_ULTIMATE.start_main_#t~pre31#1_61|)) |v_#memory_int_410|) (= |v_#pthreadsForks_76| |v_ULTIMATE.start_main_#t~pre31#1_61|) (= (store |v_#length_99| |v_ULTIMATE.start_main_~#t2228~0#1.base_30| 4) |v_#length_98|) (< |v_#StackHeapBarrier_44| |v_ULTIMATE.start_main_~#t2228~0#1.base_30|) (= |v_#pthreadsForks_75| (+ |v_#pthreadsForks_76| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_44|, #pthreadsForks=|v_#pthreadsForks_76|, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_411|, #length=|v_#length_99|} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_61|, #StackHeapBarrier=|v_#StackHeapBarrier_44|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_31|, #pthreadsForks=|v_#pthreadsForks_75|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_25|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_410|, ULTIMATE.start_main_~#t2228~0#1.base=|v_ULTIMATE.start_main_~#t2228~0#1.base_30|, ULTIMATE.start_main_~#t2228~0#1.offset=|v_ULTIMATE.start_main_~#t2228~0#1.offset_30|, #length=|v_#length_98|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, ULTIMATE.start_main_#t~pre29#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet30#1, #valid, #memory_int, ULTIMATE.start_main_~#t2228~0#1.base, ULTIMATE.start_main_~#t2228~0#1.offset, #length] Received shutdown request... [2022-12-06 04:45:04,543 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 04:45:04,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 04:45:04,544 WARN L619 AbstractCegarLoop]: Verification canceled: while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-3-2-2-2-2-2-2-1 context. [2022-12-06 04:45:04,545 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 04:45:04,551 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 04:45:04,551 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 04:45:04,552 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 04:45:04,552 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:45:04,555 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:45:04,555 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:45:04,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:45:04 BasicIcfg [2022-12-06 04:45:04,558 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:45:04,559 INFO L158 Benchmark]: Toolchain (without parser) took 869240.76ms. Allocated memory was 186.6MB in the beginning and 1.0GB in the end (delta: 851.4MB). Free memory was 160.3MB in the beginning and 605.4MB in the end (delta: -445.1MB). Peak memory consumption was 656.8MB. Max. memory is 8.0GB. [2022-12-06 04:45:04,559 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 127.9MB. Free memory was 105.5MB in the beginning and 105.4MB in the end (delta: 34.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:45:04,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.86ms. Allocated memory is still 186.6MB. Free memory was 160.0MB in the beginning and 131.3MB in the end (delta: 28.7MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 04:45:04,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.21ms. Allocated memory is still 186.6MB. Free memory was 131.3MB in the beginning and 161.2MB in the end (delta: -29.9MB). Peak memory consumption was 5.7MB. Max. memory is 8.0GB. [2022-12-06 04:45:04,559 INFO L158 Benchmark]: Boogie Preprocessor took 34.21ms. Allocated memory is still 186.6MB. Free memory was 161.2MB in the beginning and 159.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:45:04,560 INFO L158 Benchmark]: RCFGBuilder took 882.78ms. Allocated memory is still 186.6MB. Free memory was 158.6MB in the beginning and 127.7MB in the end (delta: 30.8MB). Peak memory consumption was 51.8MB. Max. memory is 8.0GB. [2022-12-06 04:45:04,560 INFO L158 Benchmark]: TraceAbstraction took 867765.32ms. Allocated memory was 186.6MB in the beginning and 1.0GB in the end (delta: 851.4MB). Free memory was 127.2MB in the beginning and 605.4MB in the end (delta: -478.2MB). Peak memory consumption was 623.4MB. Max. memory is 8.0GB. [2022-12-06 04:45:04,561 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 127.9MB. Free memory was 105.5MB in the beginning and 105.4MB in the end (delta: 34.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 495.86ms. Allocated memory is still 186.6MB. Free memory was 160.0MB in the beginning and 131.3MB in the end (delta: 28.7MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.21ms. Allocated memory is still 186.6MB. Free memory was 131.3MB in the beginning and 161.2MB in the end (delta: -29.9MB). Peak memory consumption was 5.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.21ms. Allocated memory is still 186.6MB. Free memory was 161.2MB in the beginning and 159.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 882.78ms. Allocated memory is still 186.6MB. Free memory was 158.6MB in the beginning and 127.7MB in the end (delta: 30.8MB). Peak memory consumption was 51.8MB. Max. memory is 8.0GB. * TraceAbstraction took 867765.32ms. Allocated memory was 186.6MB in the beginning and 1.0GB in the end (delta: 851.4MB). Free memory was 127.2MB in the beginning and 605.4MB in the end (delta: -478.2MB). Peak memory consumption was 623.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.3s, 137 PlacesBefore, 36 PlacesAfterwards, 125 TransitionsBefore, 24 TransitionsAfterwards, 1736 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 61 TrivialYvCompositions, 40 ConcurrentYvCompositions, 0 ChoiceCompositions, 103 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1045, independent: 975, independent conditional: 975, independent unconditional: 0, dependent: 70, dependent conditional: 70, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1045, independent: 975, independent conditional: 0, independent unconditional: 975, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1045, independent: 975, independent conditional: 0, independent unconditional: 975, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1045, independent: 975, independent conditional: 0, independent unconditional: 975, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 917, independent: 880, independent conditional: 0, independent unconditional: 880, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 917, independent: 871, independent conditional: 0, independent unconditional: 871, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 46, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 263, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 254, dependent conditional: 0, dependent unconditional: 254, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1045, independent: 95, independent conditional: 0, independent unconditional: 95, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 917, unknown conditional: 0, unknown unconditional: 917] , Statistics on independence cache: Total cache size (in pairs): 1291, Positive cache size: 1254, Positive conditional cache size: 0, Positive unconditional cache size: 1254, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 32 PlacesBefore, 32 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 246 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70, independent: 50, independent conditional: 50, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 70, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 70, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 70, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 68, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 68, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 25, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 155, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 70, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 68, unknown conditional: 0, unknown unconditional: 68] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66, independent: 48, independent conditional: 3, independent unconditional: 45, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 66, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 38 PlacesBefore, 38 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 55, independent: 38, independent conditional: 3, independent unconditional: 35, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 55, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 55, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 70, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 70, dependent conditional: 2, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 55, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 18, unknown conditional: 2, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 26, Negative conditional cache size: 2, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, independent: 51, independent conditional: 51, 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: 67, independent: 51, independent conditional: 7, 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: 67, independent: 51, independent conditional: 0, independent unconditional: 51, 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: 67, independent: 51, independent conditional: 0, independent unconditional: 51, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 67, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 63, Positive conditional cache size: 0, Positive unconditional cache size: 63, Negative cache size: 26, Negative conditional cache size: 2, Negative unconditional cache size: 24, 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: 0.1s, 38 PlacesBefore, 38 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 250 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 103, independent: 77, independent conditional: 77, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 103, independent: 77, independent conditional: 17, independent unconditional: 60, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 103, independent: 77, independent conditional: 2, independent unconditional: 75, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 103, independent: 77, independent conditional: 2, independent unconditional: 75, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 50, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 103, independent: 69, independent conditional: 2, independent unconditional: 67, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 75, Positive conditional cache size: 0, Positive unconditional cache size: 75, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 51, independent: 44, independent conditional: 15, independent unconditional: 29, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 51, independent: 44, independent conditional: 10, independent unconditional: 34, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 51, independent: 44, independent conditional: 10, independent unconditional: 34, dependent: 7, dependent conditional: 0, dependent unconditional: 7, 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: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 52, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51, independent: 42, independent conditional: 8, independent unconditional: 34, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 77, Positive conditional cache size: 2, Positive unconditional cache size: 75, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 47 PlacesBefore, 47 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 203, independent: 181, independent conditional: 181, 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: 203, independent: 181, independent conditional: 75, independent unconditional: 106, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 203, independent: 181, independent conditional: 56, independent unconditional: 125, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 203, independent: 181, independent conditional: 56, independent unconditional: 125, dependent: 22, dependent conditional: 0, dependent unconditional: 22, 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: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 203, independent: 179, independent conditional: 54, independent unconditional: 125, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 83, Positive conditional cache size: 4, Positive unconditional cache size: 79, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 476 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38, independent: 34, independent conditional: 18, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, independent: 34, independent conditional: 16, independent unconditional: 18, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, independent: 34, independent conditional: 16, independent unconditional: 18, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 5, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 29, independent conditional: 29, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, independent: 24, independent conditional: 11, independent unconditional: 13, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 10, unknown conditional: 5, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 93, Positive conditional cache size: 9, Positive unconditional cache size: 84, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 532 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 5, dependent conditional: 0, dependent unconditional: 5, 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: 16, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 93, Positive conditional cache size: 9, Positive unconditional cache size: 84, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, 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.4s, 53 PlacesBefore, 53 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 518 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 38, independent conditional: 38, 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: 48, independent: 38, independent conditional: 20, independent unconditional: 18, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 38, independent conditional: 14, independent unconditional: 24, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 38, independent conditional: 14, independent unconditional: 24, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 2, 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: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 34, independent conditional: 12, independent unconditional: 22, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 104, Positive conditional cache size: 13, Positive unconditional cache size: 91, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 55 PlacesBefore, 55 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 542 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 45, independent conditional: 24, independent unconditional: 21, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 45, independent conditional: 22, independent unconditional: 23, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 45, independent conditional: 22, independent unconditional: 23, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 56, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, independent: 39, independent conditional: 16, independent unconditional: 23, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 110, Positive conditional cache size: 19, Positive unconditional cache size: 91, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 472 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, independent: 57, independent conditional: 57, 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: 67, independent: 57, independent conditional: 30, independent unconditional: 27, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 67, independent: 57, independent conditional: 27, independent unconditional: 30, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 67, independent: 57, independent conditional: 27, independent unconditional: 30, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 12, independent conditional: 8, independent unconditional: 4, 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: 15, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 67, independent: 45, independent conditional: 19, independent unconditional: 26, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 15, unknown conditional: 8, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 122, Positive conditional cache size: 27, Positive unconditional cache size: 95, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 472 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 41, independent: 36, independent conditional: 27, independent unconditional: 9, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 41, independent: 36, independent conditional: 24, independent unconditional: 12, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 41, independent: 36, independent conditional: 24, independent unconditional: 12, dependent: 5, dependent conditional: 0, dependent unconditional: 5, 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: 41, independent: 34, independent conditional: 22, independent unconditional: 12, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 124, Positive conditional cache size: 29, Positive unconditional cache size: 95, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-3-2-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 855]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-3-2-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 857]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-3-2-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 861]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-3-2-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 859]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-3-2-2-2-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 174 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 867.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 400 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 400 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1014 IncrementalHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 4 mSDtfsCounter, 1014 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred in iteration=12, InterpolantAutomatonStates: 55, 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.6s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 193 ConstructedInterpolants, 0 QuantifiedInterpolants, 2068 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown