/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-ticket-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:06:49,766 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:06:49,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:06:49,819 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:06:49,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:06:49,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:06:49,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:06:49,829 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:06:49,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:06:49,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:06:49,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:06:49,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:06:49,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:06:49,844 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:06:49,845 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:06:49,848 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:06:49,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:06:49,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:06:49,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:06:49,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:06:49,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:06:49,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:06:49,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:06:49,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:06:49,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:06:49,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:06:49,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:06:49,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:06:49,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:06:49,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:06:49,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:06:49,875 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:06:49,876 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:06:49,876 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:06:49,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:06:49,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:06:49,878 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:06:49,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:06:49,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:06:49,879 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:06:49,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:06:49,881 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 00:06:49,913 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:06:49,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:06:49,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:06:49,915 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:06:49,916 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:06:49,916 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:06:49,916 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:06:49,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:06:49,917 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:06:49,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:06:49,918 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:06:49,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:06:49,918 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:06:49,918 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:06:49,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:06:49,918 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:06:49,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:06:49,919 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:06:49,919 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:06:49,919 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:06:49,919 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:06:49,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:06:49,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:06:49,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:06:49,920 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:06:49,920 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:06:49,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:06:49,920 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:06:49,920 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 00:06:50,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:06:50,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:06:50,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:06:50,277 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:06:50,277 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:06:50,279 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-4.wvr.c [2022-12-06 00:06:51,412 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:06:51,612 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:06:51,613 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-4.wvr.c [2022-12-06 00:06:51,622 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8c374909/8fced3d740bf408abf03ed0868f1b2b8/FLAG9cc269684 [2022-12-06 00:06:51,634 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8c374909/8fced3d740bf408abf03ed0868f1b2b8 [2022-12-06 00:06:51,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:06:51,637 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:06:51,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:06:51,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:06:51,641 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:06:51,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:06:51" (1/1) ... [2022-12-06 00:06:51,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b3afcb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:51, skipping insertion in model container [2022-12-06 00:06:51,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:06:51" (1/1) ... [2022-12-06 00:06:51,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:06:51,667 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:06:51,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,795 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-4.wvr.c[3526,3539] [2022-12-06 00:06:51,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:06:51,807 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:06:51,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:51,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:51,839 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-4.wvr.c[3526,3539] [2022-12-06 00:06:51,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:06:51,860 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:06:51,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:51 WrapperNode [2022-12-06 00:06:51,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:06:51,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:06:51,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:06:51,862 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:06:51,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:51" (1/1) ... [2022-12-06 00:06:51,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:51" (1/1) ... [2022-12-06 00:06:51,917 INFO L138 Inliner]: procedures = 23, calls = 70, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2022-12-06 00:06:51,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:06:51,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:06:51,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:06:51,919 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:06:51,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:51" (1/1) ... [2022-12-06 00:06:51,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:51" (1/1) ... [2022-12-06 00:06:51,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:51" (1/1) ... [2022-12-06 00:06:51,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:51" (1/1) ... [2022-12-06 00:06:51,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:51" (1/1) ... [2022-12-06 00:06:51,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:51" (1/1) ... [2022-12-06 00:06:51,955 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:51" (1/1) ... [2022-12-06 00:06:51,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:51" (1/1) ... [2022-12-06 00:06:51,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:06:51,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:06:51,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:06:51,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:06:51,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:51" (1/1) ... [2022-12-06 00:06:51,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:06:51,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:06:51,996 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 00:06:52,005 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 00:06:52,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:06:52,037 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:06:52,037 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:06:52,037 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:06:52,038 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:06:52,038 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 00:06:52,038 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 00:06:52,038 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 00:06:52,039 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 00:06:52,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:06:52,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:06:52,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:06:52,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 00:06:52,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 00:06:52,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:06:52,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:06:52,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:06:52,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:06:52,041 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 00:06:52,199 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:06:52,200 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:06:52,526 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:06:52,606 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:06:52,606 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 00:06:52,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:06:52 BoogieIcfgContainer [2022-12-06 00:06:52,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:06:52,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:06:52,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:06:52,613 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:06:52,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:06:51" (1/3) ... [2022-12-06 00:06:52,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63619bf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:06:52, skipping insertion in model container [2022-12-06 00:06:52,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:51" (2/3) ... [2022-12-06 00:06:52,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63619bf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:06:52, skipping insertion in model container [2022-12-06 00:06:52,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:06:52" (3/3) ... [2022-12-06 00:06:52,616 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2022-12-06 00:06:52,633 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:06:52,633 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:06:52,633 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:06:52,689 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 00:06:52,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 135 transitions, 302 flow [2022-12-06 00:06:52,795 INFO L130 PetriNetUnfolder]: 2/131 cut-off events. [2022-12-06 00:06:52,795 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 00:06:52,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 131 events. 2/131 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2022-12-06 00:06:52,800 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 135 transitions, 302 flow [2022-12-06 00:06:52,805 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 119 transitions, 262 flow [2022-12-06 00:06:52,806 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:52,824 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 119 transitions, 262 flow [2022-12-06 00:06:52,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 119 transitions, 262 flow [2022-12-06 00:06:52,859 INFO L130 PetriNetUnfolder]: 2/119 cut-off events. [2022-12-06 00:06:52,859 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 00:06:52,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 119 events. 2/119 cut-off events. For 4/4 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/117 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2022-12-06 00:06:52,863 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 119 transitions, 262 flow [2022-12-06 00:06:52,863 INFO L188 LiptonReduction]: Number of co-enabled transitions 1302 [2022-12-06 00:06:58,194 INFO L203 LiptonReduction]: Total number of compositions: 93 [2022-12-06 00:06:58,219 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:06:58,226 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;@5989c16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:06:58,227 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 00:06:58,244 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-06 00:06:58,244 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 00:06:58,244 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:58,245 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:58,249 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 00:06:58,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:58,256 INFO L85 PathProgramCache]: Analyzing trace with hash -365016010, now seen corresponding path program 1 times [2022-12-06 00:06:58,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:58,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886058774] [2022-12-06 00:06:58,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:58,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:59,275 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 00:06:59,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:59,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886058774] [2022-12-06 00:06:59,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886058774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:59,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:59,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:59,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827144948] [2022-12-06 00:06:59,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:59,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:06:59,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:59,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:06:59,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:06:59,310 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 00:06:59,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 76 flow. Second operand has 6 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 00:06:59,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:59,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 00:06:59,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:59,714 INFO L130 PetriNetUnfolder]: 1049/1613 cut-off events. [2022-12-06 00:06:59,714 INFO L131 PetriNetUnfolder]: For 189/189 co-relation queries the response was YES. [2022-12-06 00:06:59,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3434 conditions, 1613 events. 1049/1613 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6826 event pairs, 235 based on Foata normal form. 1/1614 useless extension candidates. Maximal degree in co-relation 2616. Up to 674 conditions per place. [2022-12-06 00:06:59,725 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 62 selfloop transitions, 12 changer transitions 11/85 dead transitions. [2022-12-06 00:06:59,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 85 transitions, 406 flow [2022-12-06 00:06:59,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:06:59,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:06:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2022-12-06 00:06:59,737 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2022-12-06 00:06:59,738 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 76 flow. Second operand 6 states and 86 transitions. [2022-12-06 00:06:59,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 85 transitions, 406 flow [2022-12-06 00:06:59,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 85 transitions, 362 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-12-06 00:06:59,748 INFO L231 Difference]: Finished difference. Result has 39 places, 39 transitions, 140 flow [2022-12-06 00:06:59,749 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=39, PETRI_TRANSITIONS=39} [2022-12-06 00:06:59,752 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2022-12-06 00:06:59,753 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:59,753 INFO L89 Accepts]: Start accepts. Operand has 39 places, 39 transitions, 140 flow [2022-12-06 00:06:59,757 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:59,757 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:59,757 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 39 transitions, 140 flow [2022-12-06 00:06:59,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 39 transitions, 140 flow [2022-12-06 00:06:59,771 INFO L130 PetriNetUnfolder]: 19/89 cut-off events. [2022-12-06 00:06:59,771 INFO L131 PetriNetUnfolder]: For 18/19 co-relation queries the response was YES. [2022-12-06 00:06:59,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 89 events. 19/89 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 287 event pairs, 1 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 126. Up to 22 conditions per place. [2022-12-06 00:06:59,772 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 39 transitions, 140 flow [2022-12-06 00:06:59,773 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 00:06:59,806 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [432] L45-->L52: Formula: (and (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_15| |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_15|) (not (= 0 |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_15|)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_15| (ite (<= v_~m1~0_27 v_~s~0_140) 1 0)) (= v_~x~0_16 1)) InVars {~m1~0=v_~m1~0_27, ~s~0=v_~s~0_140} OutVars{thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_15|, ~m1~0=v_~m1~0_27, ~x~0=v_~x~0_16, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_15|, ~s~0=v_~s~0_140} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1] and [504] L86-->thread3EXIT: Formula: (and (= v_~s~0_388 (+ v_~s~0_389 1)) (= |v_thread3Thread1of1ForFork2_#res#1.base_27| 0) (= v_~b~0_199 (ite (= (ite (or (not (= (mod v_~b~0_200 256) 0)) (= v_~x~0_128 1)) 1 0) 0) 0 1)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) (= (ite (<= v_~m3~0_59 v_~s~0_389) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_27|)) InVars {~m3~0=v_~m3~0_59, ~b~0=v_~b~0_200, ~x~0=v_~x~0_128, ~s~0=v_~s~0_389} OutVars{~m3~0=v_~m3~0_59, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_27|, ~b~0=v_~b~0_199, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_27|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, ~x~0=v_~x~0_128, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_47|, ~s~0=v_~s~0_388} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0] [2022-12-06 00:06:59,880 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [432] L45-->L52: Formula: (and (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_15| |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_15|) (not (= 0 |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_15|)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_15| (ite (<= v_~m1~0_27 v_~s~0_140) 1 0)) (= v_~x~0_16 1)) InVars {~m1~0=v_~m1~0_27, ~s~0=v_~s~0_140} OutVars{thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_15|, ~m1~0=v_~m1~0_27, ~x~0=v_~x~0_16, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_15|, ~s~0=v_~s~0_140} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1] and [469] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_317 1) v_~s~0_316) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_37| 0) (= v_~b~0_139 (ite (= (ite (or (not (= 0 (mod v_~b~0_140 256))) (= v_~x~0_89 1)) 1 0) 0) 0 1)) (= (ite (<= v_~m4~0_31 v_~s~0_317) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= |v_thread4Thread1of1ForFork0_#res#1.base_37| 0)) InVars {~b~0=v_~b~0_140, ~m4~0=v_~m4~0_31, ~x~0=v_~x~0_89, ~s~0=v_~s~0_317} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_37|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_41|, ~b~0=v_~b~0_139, ~m4~0=v_~m4~0_31, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_37|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, ~x~0=v_~x~0_89, ~s~0=v_~s~0_316} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:06:59,954 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [432] L45-->L52: Formula: (and (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_15| |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_15|) (not (= 0 |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_15|)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_15| (ite (<= v_~m1~0_27 v_~s~0_140) 1 0)) (= v_~x~0_16 1)) InVars {~m1~0=v_~m1~0_27, ~s~0=v_~s~0_140} OutVars{thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_15|, ~m1~0=v_~m1~0_27, ~x~0=v_~x~0_16, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_15|, ~s~0=v_~s~0_140} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1] and [478] L67-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| 0)) (= v_~b~0_159 (ite (= (ite (or (= v_~x~0_98 1) (not (= (mod v_~b~0_160 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= (ite (<= v_~m2~0_57 v_~s~0_341) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~s~0_341 1) v_~s~0_340)) InVars {~b~0=v_~b~0_160, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_98, ~s~0=v_~s~0_341} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~b~0=v_~b~0_159, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|, ~x~0=v_~x~0_98, ~s~0=v_~s~0_340} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-06 00:07:00,065 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [432] L45-->L52: Formula: (and (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_15| |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_15|) (not (= 0 |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_15|)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_15| (ite (<= v_~m1~0_27 v_~s~0_140) 1 0)) (= v_~x~0_16 1)) InVars {~m1~0=v_~m1~0_27, ~s~0=v_~s~0_140} OutVars{thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_15|, ~m1~0=v_~m1~0_27, ~x~0=v_~x~0_16, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_15|, ~s~0=v_~s~0_140} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1] and [504] L86-->thread3EXIT: Formula: (and (= v_~s~0_388 (+ v_~s~0_389 1)) (= |v_thread3Thread1of1ForFork2_#res#1.base_27| 0) (= v_~b~0_199 (ite (= (ite (or (not (= (mod v_~b~0_200 256) 0)) (= v_~x~0_128 1)) 1 0) 0) 0 1)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) (= (ite (<= v_~m3~0_59 v_~s~0_389) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_27|)) InVars {~m3~0=v_~m3~0_59, ~b~0=v_~b~0_200, ~x~0=v_~x~0_128, ~s~0=v_~s~0_389} OutVars{~m3~0=v_~m3~0_59, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_27|, ~b~0=v_~b~0_199, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_27|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, ~x~0=v_~x~0_128, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_47|, ~s~0=v_~s~0_388} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0] [2022-12-06 00:07:00,134 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [432] L45-->L52: Formula: (and (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_15| |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_15|) (not (= 0 |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_15|)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_15| (ite (<= v_~m1~0_27 v_~s~0_140) 1 0)) (= v_~x~0_16 1)) InVars {~m1~0=v_~m1~0_27, ~s~0=v_~s~0_140} OutVars{thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_15|, ~m1~0=v_~m1~0_27, ~x~0=v_~x~0_16, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_15|, ~s~0=v_~s~0_140} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1] and [469] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_317 1) v_~s~0_316) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_37| 0) (= v_~b~0_139 (ite (= (ite (or (not (= 0 (mod v_~b~0_140 256))) (= v_~x~0_89 1)) 1 0) 0) 0 1)) (= (ite (<= v_~m4~0_31 v_~s~0_317) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= |v_thread4Thread1of1ForFork0_#res#1.base_37| 0)) InVars {~b~0=v_~b~0_140, ~m4~0=v_~m4~0_31, ~x~0=v_~x~0_89, ~s~0=v_~s~0_317} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_37|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_41|, ~b~0=v_~b~0_139, ~m4~0=v_~m4~0_31, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_37|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, ~x~0=v_~x~0_89, ~s~0=v_~s~0_316} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:00,216 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [432] L45-->L52: Formula: (and (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_15| |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_15|) (not (= 0 |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_15|)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_15| (ite (<= v_~m1~0_27 v_~s~0_140) 1 0)) (= v_~x~0_16 1)) InVars {~m1~0=v_~m1~0_27, ~s~0=v_~s~0_140} OutVars{thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_15|, ~m1~0=v_~m1~0_27, ~x~0=v_~x~0_16, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_15|, ~s~0=v_~s~0_140} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1] and [478] L67-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| 0)) (= v_~b~0_159 (ite (= (ite (or (= v_~x~0_98 1) (not (= (mod v_~b~0_160 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= (ite (<= v_~m2~0_57 v_~s~0_341) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~s~0_341 1) v_~s~0_340)) InVars {~b~0=v_~b~0_160, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_98, ~s~0=v_~s~0_341} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~b~0=v_~b~0_159, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|, ~x~0=v_~x~0_98, ~s~0=v_~s~0_340} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-06 00:07:00,305 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:07:00,306 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 553 [2022-12-06 00:07:00,307 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 38 transitions, 156 flow [2022-12-06 00:07:00,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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 00:07:00,307 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:00,307 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:00,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:07:00,307 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 00:07:00,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:00,308 INFO L85 PathProgramCache]: Analyzing trace with hash -7904107, now seen corresponding path program 1 times [2022-12-06 00:07:00,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:00,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194065830] [2022-12-06 00:07:00,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:00,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:00,518 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 00:07:00,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:00,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194065830] [2022-12-06 00:07:00,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194065830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:00,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:00,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:00,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029876785] [2022-12-06 00:07:00,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:00,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:07:00,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:00,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:07:00,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:07:00,522 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 00:07:00,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 38 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:00,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:00,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 00:07:00,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:00,781 INFO L130 PetriNetUnfolder]: 723/1120 cut-off events. [2022-12-06 00:07:00,781 INFO L131 PetriNetUnfolder]: For 805/805 co-relation queries the response was YES. [2022-12-06 00:07:00,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3063 conditions, 1120 events. 723/1120 cut-off events. For 805/805 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4475 event pairs, 150 based on Foata normal form. 28/1148 useless extension candidates. Maximal degree in co-relation 1762. Up to 1048 conditions per place. [2022-12-06 00:07:00,789 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 57 selfloop transitions, 14 changer transitions 1/72 dead transitions. [2022-12-06 00:07:00,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 72 transitions, 411 flow [2022-12-06 00:07:00,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:00,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-06 00:07:00,791 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.425 [2022-12-06 00:07:00,791 INFO L175 Difference]: Start difference. First operand has 38 places, 38 transitions, 156 flow. Second operand 5 states and 68 transitions. [2022-12-06 00:07:00,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 72 transitions, 411 flow [2022-12-06 00:07:00,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 72 transitions, 376 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 00:07:00,801 INFO L231 Difference]: Finished difference. Result has 42 places, 50 transitions, 236 flow [2022-12-06 00:07:00,802 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=236, PETRI_PLACES=42, PETRI_TRANSITIONS=50} [2022-12-06 00:07:00,802 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2022-12-06 00:07:00,802 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:00,803 INFO L89 Accepts]: Start accepts. Operand has 42 places, 50 transitions, 236 flow [2022-12-06 00:07:00,804 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:00,804 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:00,804 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 50 transitions, 236 flow [2022-12-06 00:07:00,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 50 transitions, 236 flow [2022-12-06 00:07:00,825 INFO L130 PetriNetUnfolder]: 71/219 cut-off events. [2022-12-06 00:07:00,825 INFO L131 PetriNetUnfolder]: For 82/94 co-relation queries the response was YES. [2022-12-06 00:07:00,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 219 events. 71/219 cut-off events. For 82/94 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1040 event pairs, 9 based on Foata normal form. 4/212 useless extension candidates. Maximal degree in co-relation 381. Up to 54 conditions per place. [2022-12-06 00:07:00,828 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 50 transitions, 236 flow [2022-12-06 00:07:00,828 INFO L188 LiptonReduction]: Number of co-enabled transitions 336 [2022-12-06 00:07:00,835 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:00,836 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 00:07:00,836 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 50 transitions, 236 flow [2022-12-06 00:07:00,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:00,836 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:00,836 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:00,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:07:00,837 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 00:07:00,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:00,837 INFO L85 PathProgramCache]: Analyzing trace with hash -674040837, now seen corresponding path program 1 times [2022-12-06 00:07:00,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:00,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754090162] [2022-12-06 00:07:00,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:00,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:01,078 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 00:07:01,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:01,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754090162] [2022-12-06 00:07:01,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754090162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:01,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:01,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:01,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183964246] [2022-12-06 00:07:01,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:01,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:07:01,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:01,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:07:01,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:07:01,082 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 00:07:01,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 50 transitions, 236 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:01,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:01,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 00:07:01,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:01,307 INFO L130 PetriNetUnfolder]: 634/981 cut-off events. [2022-12-06 00:07:01,308 INFO L131 PetriNetUnfolder]: For 746/746 co-relation queries the response was YES. [2022-12-06 00:07:01,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2968 conditions, 981 events. 634/981 cut-off events. For 746/746 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3746 event pairs, 146 based on Foata normal form. 24/1005 useless extension candidates. Maximal degree in co-relation 2147. Up to 909 conditions per place. [2022-12-06 00:07:01,314 INFO L137 encePairwiseOnDemand]: 22/31 looper letters, 55 selfloop transitions, 14 changer transitions 0/69 dead transitions. [2022-12-06 00:07:01,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 69 transitions, 427 flow [2022-12-06 00:07:01,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:01,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:01,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-12-06 00:07:01,316 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2022-12-06 00:07:01,316 INFO L175 Difference]: Start difference. First operand has 41 places, 50 transitions, 236 flow. Second operand 5 states and 61 transitions. [2022-12-06 00:07:01,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 69 transitions, 427 flow [2022-12-06 00:07:01,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 69 transitions, 425 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 00:07:01,322 INFO L231 Difference]: Finished difference. Result has 45 places, 51 transitions, 274 flow [2022-12-06 00:07:01,323 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=45, PETRI_TRANSITIONS=51} [2022-12-06 00:07:01,324 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 6 predicate places. [2022-12-06 00:07:01,324 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:01,324 INFO L89 Accepts]: Start accepts. Operand has 45 places, 51 transitions, 274 flow [2022-12-06 00:07:01,325 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:01,325 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:01,325 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 51 transitions, 274 flow [2022-12-06 00:07:01,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 51 transitions, 274 flow [2022-12-06 00:07:01,349 INFO L130 PetriNetUnfolder]: 67/214 cut-off events. [2022-12-06 00:07:01,349 INFO L131 PetriNetUnfolder]: For 111/127 co-relation queries the response was YES. [2022-12-06 00:07:01,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 214 events. 67/214 cut-off events. For 111/127 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1027 event pairs, 9 based on Foata normal form. 6/210 useless extension candidates. Maximal degree in co-relation 375. Up to 49 conditions per place. [2022-12-06 00:07:01,352 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 51 transitions, 274 flow [2022-12-06 00:07:01,352 INFO L188 LiptonReduction]: Number of co-enabled transitions 310 [2022-12-06 00:07:01,356 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:01,357 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-06 00:07:01,357 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 51 transitions, 274 flow [2022-12-06 00:07:01,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:01,357 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:01,358 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:01,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:07:01,358 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 00:07:01,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:01,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1916190824, now seen corresponding path program 1 times [2022-12-06 00:07:01,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:01,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999063057] [2022-12-06 00:07:01,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:01,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:01,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:07:01,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:01,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999063057] [2022-12-06 00:07:01,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999063057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:01,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:01,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:01,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199587497] [2022-12-06 00:07:01,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:01,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:01,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:01,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:01,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:01,619 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 00:07:01,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 51 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:01,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:01,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 00:07:01,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:01,837 INFO L130 PetriNetUnfolder]: 618/965 cut-off events. [2022-12-06 00:07:01,837 INFO L131 PetriNetUnfolder]: For 909/909 co-relation queries the response was YES. [2022-12-06 00:07:01,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2964 conditions, 965 events. 618/965 cut-off events. For 909/909 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3677 event pairs, 180 based on Foata normal form. 16/981 useless extension candidates. Maximal degree in co-relation 1705. Up to 893 conditions per place. [2022-12-06 00:07:01,874 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 41 selfloop transitions, 4 changer transitions 22/67 dead transitions. [2022-12-06 00:07:01,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 67 transitions, 403 flow [2022-12-06 00:07:01,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:07:01,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:07:01,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-12-06 00:07:01,876 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2022-12-06 00:07:01,876 INFO L175 Difference]: Start difference. First operand has 45 places, 51 transitions, 274 flow. Second operand 6 states and 63 transitions. [2022-12-06 00:07:01,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 67 transitions, 403 flow [2022-12-06 00:07:01,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 00:07:01,878 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 178 flow [2022-12-06 00:07:01,879 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2022-12-06 00:07:01,879 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 11 predicate places. [2022-12-06 00:07:01,879 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:01,879 INFO L89 Accepts]: Start accepts. Operand has 50 places, 40 transitions, 178 flow [2022-12-06 00:07:01,880 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:01,881 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:01,881 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 40 transitions, 178 flow [2022-12-06 00:07:01,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 40 transitions, 178 flow [2022-12-06 00:07:01,898 INFO L130 PetriNetUnfolder]: 50/185 cut-off events. [2022-12-06 00:07:01,899 INFO L131 PetriNetUnfolder]: For 74/88 co-relation queries the response was YES. [2022-12-06 00:07:01,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 185 events. 50/185 cut-off events. For 74/88 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 885 event pairs, 8 based on Foata normal form. 6/183 useless extension candidates. Maximal degree in co-relation 286. Up to 41 conditions per place. [2022-12-06 00:07:01,900 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 40 transitions, 178 flow [2022-12-06 00:07:01,901 INFO L188 LiptonReduction]: Number of co-enabled transitions 260 [2022-12-06 00:07:01,903 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:01,909 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 00:07:01,909 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 178 flow [2022-12-06 00:07:01,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:01,910 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:01,910 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:01,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 00:07:01,910 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 00:07:01,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:01,911 INFO L85 PathProgramCache]: Analyzing trace with hash -439724156, now seen corresponding path program 1 times [2022-12-06 00:07:01,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:01,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310753863] [2022-12-06 00:07:01,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:01,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:02,193 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 00:07:02,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:02,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310753863] [2022-12-06 00:07:02,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310753863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:02,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:02,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:07:02,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824460716] [2022-12-06 00:07:02,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:02,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:07:02,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:02,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:07:02,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:07:02,198 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 00:07:02,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 178 flow. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:02,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:02,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 00:07:02,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:02,616 INFO L130 PetriNetUnfolder]: 1085/1686 cut-off events. [2022-12-06 00:07:02,616 INFO L131 PetriNetUnfolder]: For 1973/1973 co-relation queries the response was YES. [2022-12-06 00:07:02,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5320 conditions, 1686 events. 1085/1686 cut-off events. For 1973/1973 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7613 event pairs, 48 based on Foata normal form. 62/1748 useless extension candidates. Maximal degree in co-relation 2968. Up to 617 conditions per place. [2022-12-06 00:07:02,627 INFO L137 encePairwiseOnDemand]: 16/31 looper letters, 68 selfloop transitions, 62 changer transitions 3/133 dead transitions. [2022-12-06 00:07:02,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 133 transitions, 837 flow [2022-12-06 00:07:02,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:07:02,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:07:02,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions. [2022-12-06 00:07:02,628 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49193548387096775 [2022-12-06 00:07:02,628 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 178 flow. Second operand 8 states and 122 transitions. [2022-12-06 00:07:02,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 133 transitions, 837 flow [2022-12-06 00:07:02,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 133 transitions, 781 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-12-06 00:07:02,642 INFO L231 Difference]: Finished difference. Result has 47 places, 89 transitions, 610 flow [2022-12-06 00:07:02,642 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=610, PETRI_PLACES=47, PETRI_TRANSITIONS=89} [2022-12-06 00:07:02,642 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 8 predicate places. [2022-12-06 00:07:02,643 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:02,643 INFO L89 Accepts]: Start accepts. Operand has 47 places, 89 transitions, 610 flow [2022-12-06 00:07:02,644 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:02,644 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:02,644 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 89 transitions, 610 flow [2022-12-06 00:07:02,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 89 transitions, 610 flow [2022-12-06 00:07:02,691 INFO L130 PetriNetUnfolder]: 275/575 cut-off events. [2022-12-06 00:07:02,692 INFO L131 PetriNetUnfolder]: For 781/839 co-relation queries the response was YES. [2022-12-06 00:07:02,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1917 conditions, 575 events. 275/575 cut-off events. For 781/839 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3062 event pairs, 22 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 1793. Up to 238 conditions per place. [2022-12-06 00:07:02,697 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 89 transitions, 610 flow [2022-12-06 00:07:02,698 INFO L188 LiptonReduction]: Number of co-enabled transitions 446 [2022-12-06 00:07:02,735 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_43) (= v_~t~0_42 (+ v_~t~0_43 1))) InVars {~t~0=v_~t~0_43} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_1|, ~t~0=v_~t~0_42} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] and [518] L45-->thread4EXIT: Formula: (let ((.cse0 (= v_~x~0_172 1))) (and (= (ite (= (ite (or .cse0 (not (= (mod v_~b~0_260 256) 0))) 1 0) 0) 0 1) v_~b~0_259) .cse0 (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_47| (ite (<= v_~m1~0_99 v_~s~0_457) 1 0)) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29| (ite (<= v_~m4~0_69 v_~s~0_457) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_47| |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_47|) (not (= 0 |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_47|)) (= |v_thread4Thread1of1ForFork0_#res#1.base_49| 0) (= |v_thread4Thread1of1ForFork0_#res#1.offset_49| 0) (= (+ v_~s~0_457 1) v_~s~0_456))) InVars {~b~0=v_~b~0_260, ~m4~0=v_~m4~0_69, ~m1~0=v_~m1~0_99, ~s~0=v_~s~0_457} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_49|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_47|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_53|, ~b~0=v_~b~0_259, ~m4~0=v_~m4~0_69, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|, ~m1~0=v_~m1~0_99, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_49|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_29|, ~x~0=v_~x~0_172, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_47|, ~s~0=v_~s~0_456} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x~0, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:02,834 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_43) (= v_~t~0_42 (+ v_~t~0_43 1))) InVars {~t~0=v_~t~0_43} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_1|, ~t~0=v_~t~0_42} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] and [469] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_317 1) v_~s~0_316) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_37| 0) (= v_~b~0_139 (ite (= (ite (or (not (= 0 (mod v_~b~0_140 256))) (= v_~x~0_89 1)) 1 0) 0) 0 1)) (= (ite (<= v_~m4~0_31 v_~s~0_317) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= |v_thread4Thread1of1ForFork0_#res#1.base_37| 0)) InVars {~b~0=v_~b~0_140, ~m4~0=v_~m4~0_31, ~x~0=v_~x~0_89, ~s~0=v_~s~0_317} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_37|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_41|, ~b~0=v_~b~0_139, ~m4~0=v_~m4~0_31, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_37|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, ~x~0=v_~x~0_89, ~s~0=v_~s~0_316} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:02,900 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_43) (= v_~t~0_42 (+ v_~t~0_43 1))) InVars {~t~0=v_~t~0_43} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_1|, ~t~0=v_~t~0_42} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] and [478] L67-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| 0)) (= v_~b~0_159 (ite (= (ite (or (= v_~x~0_98 1) (not (= (mod v_~b~0_160 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= (ite (<= v_~m2~0_57 v_~s~0_341) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~s~0_341 1) v_~s~0_340)) InVars {~b~0=v_~b~0_160, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_98, ~s~0=v_~s~0_341} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~b~0=v_~b~0_159, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|, ~x~0=v_~x~0_98, ~s~0=v_~s~0_340} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-06 00:07:02,967 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_43) (= v_~t~0_42 (+ v_~t~0_43 1))) InVars {~t~0=v_~t~0_43} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_1|, ~t~0=v_~t~0_42} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] and [395] $Ultimate##0-->L105: Formula: (and (= (+ v_~t~0_55 1) v_~t~0_54) (= v_~m4~0_7 v_~t~0_55)) InVars {~t~0=v_~t~0_55} OutVars{~m4~0=v_~m4~0_7, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_1|, ~t~0=v_~t~0_54} AuxVars[] AssignedVars[~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~t~0] [2022-12-06 00:07:02,986 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_43) (= v_~t~0_42 (+ v_~t~0_43 1))) InVars {~t~0=v_~t~0_43} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_1|, ~t~0=v_~t~0_42} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] and [515] L45-->thread4EXIT: Formula: (let ((.cse0 (= v_~x~0_166 1))) (and (= |v_thread4Thread1of1ForFork0_#res#1.offset_47| 0) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_27| 0)) (not (= 0 |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_41|)) (= (+ v_~s~0_445 1) v_~s~0_444) .cse0 (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m1~0_85 v_~s~0_445) 1 0)) (= |v_thread4Thread1of1ForFork0_#res#1.base_47| 0) (= (ite (= (ite (or .cse0 (not (= (mod v_~b~0_248 256) 0))) 1 0) 0) 0 1) v_~b~0_247) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_41| |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_41|) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m4~0_65 v_~s~0_445) 1 0)) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_27| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_27|))) InVars {~b~0=v_~b~0_248, ~m4~0=v_~m4~0_65, ~m1~0=v_~m1~0_85, ~s~0=v_~s~0_445} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_47|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_41|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_51|, ~b~0=v_~b~0_247, ~m4~0=v_~m4~0_65, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_85, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_47|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_27|, ~x~0=v_~x~0_166, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_41|, ~s~0=v_~s~0_444} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x~0, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:03,083 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_43) (= v_~t~0_42 (+ v_~t~0_43 1))) InVars {~t~0=v_~t~0_43} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_1|, ~t~0=v_~t~0_42} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] and [376] $Ultimate##0-->L45: Formula: (and (= (+ v_~t~0_51 1) v_~t~0_50) (= v_~m1~0_9 v_~t~0_51)) InVars {~t~0=v_~t~0_51} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_50} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~t~0] [2022-12-06 00:07:03,107 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_43) (= v_~t~0_42 (+ v_~t~0_43 1))) InVars {~t~0=v_~t~0_43} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_1|, ~t~0=v_~t~0_42} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] and [469] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_317 1) v_~s~0_316) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_37| 0) (= v_~b~0_139 (ite (= (ite (or (not (= 0 (mod v_~b~0_140 256))) (= v_~x~0_89 1)) 1 0) 0) 0 1)) (= (ite (<= v_~m4~0_31 v_~s~0_317) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= |v_thread4Thread1of1ForFork0_#res#1.base_37| 0)) InVars {~b~0=v_~b~0_140, ~m4~0=v_~m4~0_31, ~x~0=v_~x~0_89, ~s~0=v_~s~0_317} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_37|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_41|, ~b~0=v_~b~0_139, ~m4~0=v_~m4~0_31, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_37|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, ~x~0=v_~x~0_89, ~s~0=v_~s~0_316} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:03,172 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_43) (= v_~t~0_42 (+ v_~t~0_43 1))) InVars {~t~0=v_~t~0_43} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_1|, ~t~0=v_~t~0_42} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] and [469] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_317 1) v_~s~0_316) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_37| 0) (= v_~b~0_139 (ite (= (ite (or (not (= 0 (mod v_~b~0_140 256))) (= v_~x~0_89 1)) 1 0) 0) 0 1)) (= (ite (<= v_~m4~0_31 v_~s~0_317) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= |v_thread4Thread1of1ForFork0_#res#1.base_37| 0)) InVars {~b~0=v_~b~0_140, ~m4~0=v_~m4~0_31, ~x~0=v_~x~0_89, ~s~0=v_~s~0_317} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_37|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_41|, ~b~0=v_~b~0_139, ~m4~0=v_~m4~0_31, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_37|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, ~x~0=v_~x~0_89, ~s~0=v_~s~0_316} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:03,239 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_43) (= v_~t~0_42 (+ v_~t~0_43 1))) InVars {~t~0=v_~t~0_43} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_1|, ~t~0=v_~t~0_42} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] and [519] L45-->thread2EXIT: Formula: (let ((.cse0 (= v_~x~0_174 1))) (and (= v_~b~0_263 (ite (= (ite (or (not (= (mod v_~b~0_264 256) 0)) .cse0) 1 0) 0) 0 1)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_49| (ite (<= v_~m1~0_101 v_~s~0_461) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_43| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43|) (= (ite (<= v_~m2~0_85 v_~s~0_461) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43|) (not (= 0 |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_49|)) (= (+ v_~s~0_461 1) v_~s~0_460) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_15|) .cse0 (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_43| 0)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_49| |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_49|))) InVars {~b~0=v_~b~0_264, ~m2~0=v_~m2~0_85, ~m1~0=v_~m1~0_101, ~s~0=v_~s~0_461} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_43|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_15|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_45|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_49|, ~b~0=v_~b~0_263, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_15|, ~m2~0=v_~m2~0_85, ~m1~0=v_~m1~0_101, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43|, ~x~0=v_~x~0_174, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_49|, ~s~0=v_~s~0_460} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:03,334 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_43) (= v_~t~0_42 (+ v_~t~0_43 1))) InVars {~t~0=v_~t~0_43} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_1|, ~t~0=v_~t~0_42} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] and [478] L67-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| 0)) (= v_~b~0_159 (ite (= (ite (or (= v_~x~0_98 1) (not (= (mod v_~b~0_160 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= (ite (<= v_~m2~0_57 v_~s~0_341) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~s~0_341 1) v_~s~0_340)) InVars {~b~0=v_~b~0_160, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_98, ~s~0=v_~s~0_341} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~b~0=v_~b~0_159, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|, ~x~0=v_~x~0_98, ~s~0=v_~s~0_340} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-06 00:07:03,404 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_43) (= v_~t~0_42 (+ v_~t~0_43 1))) InVars {~t~0=v_~t~0_43} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_1|, ~t~0=v_~t~0_42} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] and [383] $Ultimate##0-->L67: Formula: (and (= v_~t~0_46 (+ v_~t~0_47 1)) (= v_~m2~0_11 v_~t~0_47)) InVars {~t~0=v_~t~0_47} OutVars{thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_46} AuxVars[] AssignedVars[~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0] [2022-12-06 00:07:03,423 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_43) (= v_~t~0_42 (+ v_~t~0_43 1))) InVars {~t~0=v_~t~0_43} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_1|, ~t~0=v_~t~0_42} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] and [478] L67-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| 0)) (= v_~b~0_159 (ite (= (ite (or (= v_~x~0_98 1) (not (= (mod v_~b~0_160 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= (ite (<= v_~m2~0_57 v_~s~0_341) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~s~0_341 1) v_~s~0_340)) InVars {~b~0=v_~b~0_160, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_98, ~s~0=v_~s~0_341} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~b~0=v_~b~0_159, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|, ~x~0=v_~x~0_98, ~s~0=v_~s~0_340} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-06 00:07:03,488 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_43) (= v_~t~0_42 (+ v_~t~0_43 1))) InVars {~t~0=v_~t~0_43} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_1|, ~t~0=v_~t~0_42} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] and [516] L45-->thread2EXIT: Formula: (let ((.cse0 (= v_~x~0_168 1))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_79 v_~s~0_449) 1 0)) (not (= 0 |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_43|)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_43| |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_43|) (= v_~b~0_251 (ite (= (ite (or (not (= (mod v_~b~0_252 256) 0)) .cse0) 1 0) 0) 0 1)) (= v_~s~0_448 (+ v_~s~0_449 1)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_13| 0) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_13|) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_43| (ite (<= v_~m1~0_87 v_~s~0_449) 1 0)) .cse0)) InVars {~b~0=v_~b~0_252, ~m2~0=v_~m2~0_79, ~m1~0=v_~m1~0_87, ~s~0=v_~s~0_449} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_13|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_43|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_43|, ~b~0=v_~b~0_251, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_13|, ~m2~0=v_~m2~0_79, ~m1~0=v_~m1~0_87, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|, ~x~0=v_~x~0_168, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_43|, ~s~0=v_~s~0_448} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:03,577 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_43) (= v_~t~0_42 (+ v_~t~0_43 1))) InVars {~t~0=v_~t~0_43} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_1|, ~t~0=v_~t~0_42} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] and [492] L52-->thread1EXIT: Formula: (and (= v_~x~0_115 0) (= |v_thread1Thread1of1ForFork3_#res#1.base_37| 0) (= (+ v_~s~0_371 1) v_~s~0_370) (= |v_thread1Thread1of1ForFork3_#res#1.offset_37| 0)) InVars {~s~0=v_~s~0_371} OutVars{thread1Thread1of1ForFork3_#res#1.base=|v_thread1Thread1of1ForFork3_#res#1.base_37|, thread1Thread1of1ForFork3_#t~post2#1=|v_thread1Thread1of1ForFork3_#t~post2#1_43|, thread1Thread1of1ForFork3_#res#1.offset=|v_thread1Thread1of1ForFork3_#res#1.offset_37|, ~x~0=v_~x~0_115, ~s~0=v_~s~0_370} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#res#1.base, thread1Thread1of1ForFork3_#t~post2#1, thread1Thread1of1ForFork3_#res#1.offset, ~x~0, ~s~0] [2022-12-06 00:07:03,641 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_43) (= v_~t~0_42 (+ v_~t~0_43 1))) InVars {~t~0=v_~t~0_43} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_1|, ~t~0=v_~t~0_42} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] and [469] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_317 1) v_~s~0_316) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_37| 0) (= v_~b~0_139 (ite (= (ite (or (not (= 0 (mod v_~b~0_140 256))) (= v_~x~0_89 1)) 1 0) 0) 0 1)) (= (ite (<= v_~m4~0_31 v_~s~0_317) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= |v_thread4Thread1of1ForFork0_#res#1.base_37| 0)) InVars {~b~0=v_~b~0_140, ~m4~0=v_~m4~0_31, ~x~0=v_~x~0_89, ~s~0=v_~s~0_317} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_37|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_41|, ~b~0=v_~b~0_139, ~m4~0=v_~m4~0_31, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_37|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, ~x~0=v_~x~0_89, ~s~0=v_~s~0_316} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:03,705 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_43) (= v_~t~0_42 (+ v_~t~0_43 1))) InVars {~t~0=v_~t~0_43} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_1|, ~t~0=v_~t~0_42} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] and [519] L45-->thread2EXIT: Formula: (let ((.cse0 (= v_~x~0_174 1))) (and (= v_~b~0_263 (ite (= (ite (or (not (= (mod v_~b~0_264 256) 0)) .cse0) 1 0) 0) 0 1)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_49| (ite (<= v_~m1~0_101 v_~s~0_461) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_43| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43|) (= (ite (<= v_~m2~0_85 v_~s~0_461) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43|) (not (= 0 |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_49|)) (= (+ v_~s~0_461 1) v_~s~0_460) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_15|) .cse0 (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_43| 0)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_49| |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_49|))) InVars {~b~0=v_~b~0_264, ~m2~0=v_~m2~0_85, ~m1~0=v_~m1~0_101, ~s~0=v_~s~0_461} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_43|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_15|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_45|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_49|, ~b~0=v_~b~0_263, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_15|, ~m2~0=v_~m2~0_85, ~m1~0=v_~m1~0_101, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43|, ~x~0=v_~x~0_174, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_49|, ~s~0=v_~s~0_460} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:03,805 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_43) (= v_~t~0_42 (+ v_~t~0_43 1))) InVars {~t~0=v_~t~0_43} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_1|, ~t~0=v_~t~0_42} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] and [518] L45-->thread4EXIT: Formula: (let ((.cse0 (= v_~x~0_172 1))) (and (= (ite (= (ite (or .cse0 (not (= (mod v_~b~0_260 256) 0))) 1 0) 0) 0 1) v_~b~0_259) .cse0 (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_47| (ite (<= v_~m1~0_99 v_~s~0_457) 1 0)) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29| (ite (<= v_~m4~0_69 v_~s~0_457) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_47| |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_47|) (not (= 0 |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_47|)) (= |v_thread4Thread1of1ForFork0_#res#1.base_49| 0) (= |v_thread4Thread1of1ForFork0_#res#1.offset_49| 0) (= (+ v_~s~0_457 1) v_~s~0_456))) InVars {~b~0=v_~b~0_260, ~m4~0=v_~m4~0_69, ~m1~0=v_~m1~0_99, ~s~0=v_~s~0_457} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_49|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_47|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_53|, ~b~0=v_~b~0_259, ~m4~0=v_~m4~0_69, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|, ~m1~0=v_~m1~0_99, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_49|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_29|, ~x~0=v_~x~0_172, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_47|, ~s~0=v_~s~0_456} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x~0, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:03,904 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_43) (= v_~t~0_42 (+ v_~t~0_43 1))) InVars {~t~0=v_~t~0_43} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_1|, ~t~0=v_~t~0_42} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] and [478] L67-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| 0)) (= v_~b~0_159 (ite (= (ite (or (= v_~x~0_98 1) (not (= (mod v_~b~0_160 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= (ite (<= v_~m2~0_57 v_~s~0_341) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~s~0_341 1) v_~s~0_340)) InVars {~b~0=v_~b~0_160, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_98, ~s~0=v_~s~0_341} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~b~0=v_~b~0_159, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|, ~x~0=v_~x~0_98, ~s~0=v_~s~0_340} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-06 00:07:03,970 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_43) (= v_~t~0_42 (+ v_~t~0_43 1))) InVars {~t~0=v_~t~0_43} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_1|, ~t~0=v_~t~0_42} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] and [395] $Ultimate##0-->L105: Formula: (and (= (+ v_~t~0_55 1) v_~t~0_54) (= v_~m4~0_7 v_~t~0_55)) InVars {~t~0=v_~t~0_55} OutVars{~m4~0=v_~m4~0_7, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_1|, ~t~0=v_~t~0_54} AuxVars[] AssignedVars[~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~t~0] [2022-12-06 00:07:03,990 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_43) (= v_~t~0_42 (+ v_~t~0_43 1))) InVars {~t~0=v_~t~0_43} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_1|, ~t~0=v_~t~0_42} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] and [376] $Ultimate##0-->L45: Formula: (and (= (+ v_~t~0_51 1) v_~t~0_50) (= v_~m1~0_9 v_~t~0_51)) InVars {~t~0=v_~t~0_51} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_50} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~t~0] [2022-12-06 00:07:04,012 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:07:04,013 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1370 [2022-12-06 00:07:04,013 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 87 transitions, 688 flow [2022-12-06 00:07:04,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:04,013 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:04,013 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:04,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 00:07:04,014 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 00:07:04,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:04,014 INFO L85 PathProgramCache]: Analyzing trace with hash 296104302, now seen corresponding path program 1 times [2022-12-06 00:07:04,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:04,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044127357] [2022-12-06 00:07:04,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:04,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:04,239 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 00:07:04,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:04,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044127357] [2022-12-06 00:07:04,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044127357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:04,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:04,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:07:04,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737444615] [2022-12-06 00:07:04,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:04,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:07:04,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:04,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:07:04,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:07:04,241 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 00:07:04,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 87 transitions, 688 flow. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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 00:07:04,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:04,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 00:07:04,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:04,686 INFO L130 PetriNetUnfolder]: 1107/1710 cut-off events. [2022-12-06 00:07:04,687 INFO L131 PetriNetUnfolder]: For 3101/3101 co-relation queries the response was YES. [2022-12-06 00:07:04,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7320 conditions, 1710 events. 1107/1710 cut-off events. For 3101/3101 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 7803 event pairs, 36 based on Foata normal form. 78/1788 useless extension candidates. Maximal degree in co-relation 2457. Up to 1488 conditions per place. [2022-12-06 00:07:04,699 INFO L137 encePairwiseOnDemand]: 24/51 looper letters, 92 selfloop transitions, 68 changer transitions 0/160 dead transitions. [2022-12-06 00:07:04,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 160 transitions, 1513 flow [2022-12-06 00:07:04,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:07:04,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:07:04,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2022-12-06 00:07:04,701 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2965686274509804 [2022-12-06 00:07:04,701 INFO L175 Difference]: Start difference. First operand has 45 places, 87 transitions, 688 flow. Second operand 8 states and 121 transitions. [2022-12-06 00:07:04,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 160 transitions, 1513 flow [2022-12-06 00:07:04,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 160 transitions, 1447 flow, removed 31 selfloop flow, removed 2 redundant places. [2022-12-06 00:07:04,714 INFO L231 Difference]: Finished difference. Result has 52 places, 129 transitions, 1234 flow [2022-12-06 00:07:04,714 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1234, PETRI_PLACES=52, PETRI_TRANSITIONS=129} [2022-12-06 00:07:04,716 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 13 predicate places. [2022-12-06 00:07:04,716 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:04,719 INFO L89 Accepts]: Start accepts. Operand has 52 places, 129 transitions, 1234 flow [2022-12-06 00:07:04,720 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:04,720 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:04,721 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 129 transitions, 1234 flow [2022-12-06 00:07:04,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 129 transitions, 1234 flow [2022-12-06 00:07:04,773 INFO L130 PetriNetUnfolder]: 296/580 cut-off events. [2022-12-06 00:07:04,774 INFO L131 PetriNetUnfolder]: For 1516/1731 co-relation queries the response was YES. [2022-12-06 00:07:04,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2330 conditions, 580 events. 296/580 cut-off events. For 1516/1731 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 2932 event pairs, 17 based on Foata normal form. 1/571 useless extension candidates. Maximal degree in co-relation 2222. Up to 256 conditions per place. [2022-12-06 00:07:04,779 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 129 transitions, 1234 flow [2022-12-06 00:07:04,779 INFO L188 LiptonReduction]: Number of co-enabled transitions 546 [2022-12-06 00:07:04,780 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:04,781 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-06 00:07:04,781 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 129 transitions, 1234 flow [2022-12-06 00:07:04,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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 00:07:04,781 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:04,781 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:04,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 00:07:04,781 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 00:07:04,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:04,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1061663984, now seen corresponding path program 1 times [2022-12-06 00:07:04,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:04,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944689474] [2022-12-06 00:07:04,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:04,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:04,957 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 00:07:04,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:04,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944689474] [2022-12-06 00:07:04,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944689474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:04,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:04,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:04,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3720437] [2022-12-06 00:07:04,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:04,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:07:04,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:04,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:07:04,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:07:04,960 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 00:07:04,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 129 transitions, 1234 flow. Second operand has 5 states, 5 states have (on average 4.8) 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 00:07:04,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:04,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 00:07:04,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:05,305 INFO L130 PetriNetUnfolder]: 997/1554 cut-off events. [2022-12-06 00:07:05,305 INFO L131 PetriNetUnfolder]: For 3895/3895 co-relation queries the response was YES. [2022-12-06 00:07:05,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7273 conditions, 1554 events. 997/1554 cut-off events. For 3895/3895 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6941 event pairs, 46 based on Foata normal form. 30/1584 useless extension candidates. Maximal degree in co-relation 2721. Up to 1496 conditions per place. [2022-12-06 00:07:05,321 INFO L137 encePairwiseOnDemand]: 37/51 looper letters, 121 selfloop transitions, 24 changer transitions 0/145 dead transitions. [2022-12-06 00:07:05,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 145 transitions, 1554 flow [2022-12-06 00:07:05,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:05,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:05,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-12-06 00:07:05,323 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3137254901960784 [2022-12-06 00:07:05,323 INFO L175 Difference]: Start difference. First operand has 52 places, 129 transitions, 1234 flow. Second operand 5 states and 80 transitions. [2022-12-06 00:07:05,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 145 transitions, 1554 flow [2022-12-06 00:07:05,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 145 transitions, 1452 flow, removed 30 selfloop flow, removed 2 redundant places. [2022-12-06 00:07:05,341 INFO L231 Difference]: Finished difference. Result has 55 places, 128 transitions, 1176 flow [2022-12-06 00:07:05,342 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1176, PETRI_PLACES=55, PETRI_TRANSITIONS=128} [2022-12-06 00:07:05,342 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 16 predicate places. [2022-12-06 00:07:05,342 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:05,342 INFO L89 Accepts]: Start accepts. Operand has 55 places, 128 transitions, 1176 flow [2022-12-06 00:07:05,345 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:05,345 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:05,345 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 128 transitions, 1176 flow [2022-12-06 00:07:05,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 128 transitions, 1176 flow [2022-12-06 00:07:05,394 INFO L130 PetriNetUnfolder]: 273/547 cut-off events. [2022-12-06 00:07:05,394 INFO L131 PetriNetUnfolder]: For 1387/1418 co-relation queries the response was YES. [2022-12-06 00:07:05,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2219 conditions, 547 events. 273/547 cut-off events. For 1387/1418 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 2689 event pairs, 15 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 2112. Up to 239 conditions per place. [2022-12-06 00:07:05,400 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 128 transitions, 1176 flow [2022-12-06 00:07:05,400 INFO L188 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-06 00:07:05,402 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [383] $Ultimate##0-->L67: Formula: (and (= v_~t~0_46 (+ v_~t~0_47 1)) (= v_~m2~0_11 v_~t~0_47)) InVars {~t~0=v_~t~0_47} OutVars{thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_46} AuxVars[] AssignedVars[~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0] and [539] $Ultimate##0-->L45: Formula: (and (= v_~t~0_237 (+ v_~t~0_239 2)) (= (+ v_~t~0_239 1) v_~m1~0_119) (= v_~t~0_239 v_~m3~0_123)) InVars {~t~0=v_~t~0_239} OutVars{~m3~0=v_~m3~0_123, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_23|, ~m1~0=v_~m1~0_119, ~t~0=v_~t~0_237, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_49|} AuxVars[] AssignedVars[~m3~0, thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] [2022-12-06 00:07:05,494 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [383] $Ultimate##0-->L67: Formula: (and (= v_~t~0_46 (+ v_~t~0_47 1)) (= v_~m2~0_11 v_~t~0_47)) InVars {~t~0=v_~t~0_47} OutVars{thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_46} AuxVars[] AssignedVars[~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0] and [376] $Ultimate##0-->L45: Formula: (and (= (+ v_~t~0_51 1) v_~t~0_50) (= v_~m1~0_9 v_~t~0_51)) InVars {~t~0=v_~t~0_51} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_50} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~t~0] [2022-12-06 00:07:05,514 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [383] $Ultimate##0-->L67: Formula: (and (= v_~t~0_46 (+ v_~t~0_47 1)) (= v_~m2~0_11 v_~t~0_47)) InVars {~t~0=v_~t~0_47} OutVars{thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_46} AuxVars[] AssignedVars[~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0] and [537] $Ultimate##0-->thread2EXIT: Formula: (and (= (+ v_~s~0_535 1) v_~s~0_534) (= v_~t~0_228 v_~m3~0_119) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_59| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_59| 0)) (= (ite (<= v_~m2~0_106 v_~s~0_535) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_31|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_31| 0) (= v_~t~0_227 (+ v_~t~0_228 1)) (= v_~b~0_327 (ite (= (ite (or (= v_~x~0_210 1) (not (= (mod v_~b~0_328 256) 0))) 1 0) 0) 0 1))) InVars {~b~0=v_~b~0_328, ~m2~0=v_~m2~0_106, ~x~0=v_~x~0_210, ~s~0=v_~s~0_535, ~t~0=v_~t~0_228} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_59|, ~m3~0=v_~m3~0_119, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_31|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~b~0=v_~b~0_327, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_31|, ~m2~0=v_~m2~0_106, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|, ~x~0=v_~x~0_210, ~s~0=v_~s~0_534, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_45|, ~t~0=v_~t~0_227} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~m3~0, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~s~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] [2022-12-06 00:07:05,591 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:05,592 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 250 [2022-12-06 00:07:05,592 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 128 transitions, 1194 flow [2022-12-06 00:07:05,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) 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 00:07:05,593 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:05,593 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:05,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 00:07:05,593 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 00:07:05,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:05,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1921849107, now seen corresponding path program 1 times [2022-12-06 00:07:05,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:05,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793074607] [2022-12-06 00:07:05,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:05,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:05,781 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 00:07:05,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:05,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793074607] [2022-12-06 00:07:05,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793074607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:05,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:05,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:05,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984512766] [2022-12-06 00:07:05,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:05,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:05,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:05,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:05,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:05,783 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 00:07:05,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 128 transitions, 1194 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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 00:07:05,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:05,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 00:07:05,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:06,168 INFO L130 PetriNetUnfolder]: 1003/1564 cut-off events. [2022-12-06 00:07:06,169 INFO L131 PetriNetUnfolder]: For 4033/4033 co-relation queries the response was YES. [2022-12-06 00:07:06,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7460 conditions, 1564 events. 1003/1564 cut-off events. For 4033/4033 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 7094 event pairs, 20 based on Foata normal form. 8/1572 useless extension candidates. Maximal degree in co-relation 2822. Up to 607 conditions per place. [2022-12-06 00:07:06,182 INFO L137 encePairwiseOnDemand]: 28/52 looper letters, 77 selfloop transitions, 86 changer transitions 0/163 dead transitions. [2022-12-06 00:07:06,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 163 transitions, 1695 flow [2022-12-06 00:07:06,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:07:06,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:07:06,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2022-12-06 00:07:06,184 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3557692307692308 [2022-12-06 00:07:06,184 INFO L175 Difference]: Start difference. First operand has 55 places, 128 transitions, 1194 flow. Second operand 6 states and 111 transitions. [2022-12-06 00:07:06,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 163 transitions, 1695 flow [2022-12-06 00:07:06,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 163 transitions, 1634 flow, removed 17 selfloop flow, removed 2 redundant places. [2022-12-06 00:07:06,199 INFO L231 Difference]: Finished difference. Result has 58 places, 132 transitions, 1351 flow [2022-12-06 00:07:06,199 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1139, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1351, PETRI_PLACES=58, PETRI_TRANSITIONS=132} [2022-12-06 00:07:06,200 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 19 predicate places. [2022-12-06 00:07:06,200 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:06,200 INFO L89 Accepts]: Start accepts. Operand has 58 places, 132 transitions, 1351 flow [2022-12-06 00:07:06,201 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:06,201 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:06,201 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 132 transitions, 1351 flow [2022-12-06 00:07:06,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 132 transitions, 1351 flow [2022-12-06 00:07:06,256 INFO L130 PetriNetUnfolder]: 274/550 cut-off events. [2022-12-06 00:07:06,256 INFO L131 PetriNetUnfolder]: For 1715/1823 co-relation queries the response was YES. [2022-12-06 00:07:06,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2532 conditions, 550 events. 274/550 cut-off events. For 1715/1823 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2712 event pairs, 15 based on Foata normal form. 12/554 useless extension candidates. Maximal degree in co-relation 2425. Up to 236 conditions per place. [2022-12-06 00:07:06,262 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 132 transitions, 1351 flow [2022-12-06 00:07:06,262 INFO L188 LiptonReduction]: Number of co-enabled transitions 508 [2022-12-06 00:07:06,263 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:06,265 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-06 00:07:06,265 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 132 transitions, 1351 flow [2022-12-06 00:07:06,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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 00:07:06,265 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:06,265 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:06,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 00:07:06,266 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 00:07:06,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:06,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1038419819, now seen corresponding path program 1 times [2022-12-06 00:07:06,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:06,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255360714] [2022-12-06 00:07:06,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:06,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:06,426 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 00:07:06,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:06,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255360714] [2022-12-06 00:07:06,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255360714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:06,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:06,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:06,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514217977] [2022-12-06 00:07:06,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:06,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:06,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:06,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:06,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:06,429 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 00:07:06,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 132 transitions, 1351 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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 00:07:06,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:06,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 00:07:06,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:06,782 INFO L130 PetriNetUnfolder]: 1002/1569 cut-off events. [2022-12-06 00:07:06,783 INFO L131 PetriNetUnfolder]: For 4639/4639 co-relation queries the response was YES. [2022-12-06 00:07:06,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8172 conditions, 1569 events. 1002/1569 cut-off events. For 4639/4639 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 7126 event pairs, 19 based on Foata normal form. 10/1579 useless extension candidates. Maximal degree in co-relation 3653. Up to 603 conditions per place. [2022-12-06 00:07:06,805 INFO L137 encePairwiseOnDemand]: 32/52 looper letters, 80 selfloop transitions, 81 changer transitions 1/162 dead transitions. [2022-12-06 00:07:06,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 162 transitions, 1799 flow [2022-12-06 00:07:06,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:07:06,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:07:06,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2022-12-06 00:07:06,806 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3301282051282051 [2022-12-06 00:07:06,807 INFO L175 Difference]: Start difference. First operand has 58 places, 132 transitions, 1351 flow. Second operand 6 states and 103 transitions. [2022-12-06 00:07:06,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 162 transitions, 1799 flow [2022-12-06 00:07:06,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 162 transitions, 1692 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:06,829 INFO L231 Difference]: Finished difference. Result has 60 places, 135 transitions, 1426 flow [2022-12-06 00:07:06,829 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1426, PETRI_PLACES=60, PETRI_TRANSITIONS=135} [2022-12-06 00:07:06,830 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 21 predicate places. [2022-12-06 00:07:06,830 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:06,830 INFO L89 Accepts]: Start accepts. Operand has 60 places, 135 transitions, 1426 flow [2022-12-06 00:07:06,832 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:06,832 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:06,832 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 135 transitions, 1426 flow [2022-12-06 00:07:06,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 135 transitions, 1426 flow [2022-12-06 00:07:06,887 INFO L130 PetriNetUnfolder]: 272/556 cut-off events. [2022-12-06 00:07:06,887 INFO L131 PetriNetUnfolder]: For 2018/2072 co-relation queries the response was YES. [2022-12-06 00:07:06,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2605 conditions, 556 events. 272/556 cut-off events. For 2018/2072 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 2824 event pairs, 9 based on Foata normal form. 2/552 useless extension candidates. Maximal degree in co-relation 2492. Up to 236 conditions per place. [2022-12-06 00:07:06,893 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 135 transitions, 1426 flow [2022-12-06 00:07:06,893 INFO L188 LiptonReduction]: Number of co-enabled transitions 522 [2022-12-06 00:07:06,894 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:06,894 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-06 00:07:06,894 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 135 transitions, 1426 flow [2022-12-06 00:07:06,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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 00:07:06,895 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:06,895 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:06,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 00:07:06,895 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 00:07:06,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:06,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1919350748, now seen corresponding path program 1 times [2022-12-06 00:07:06,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:06,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443549451] [2022-12-06 00:07:06,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:06,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:07,083 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 00:07:07,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:07,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443549451] [2022-12-06 00:07:07,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443549451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:07,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:07,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:07,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956362675] [2022-12-06 00:07:07,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:07,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:07,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:07,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:07,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:07,086 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 00:07:07,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 135 transitions, 1426 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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 00:07:07,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:07,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 00:07:07,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:07,502 INFO L130 PetriNetUnfolder]: 1050/1651 cut-off events. [2022-12-06 00:07:07,502 INFO L131 PetriNetUnfolder]: For 6166/6166 co-relation queries the response was YES. [2022-12-06 00:07:07,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8807 conditions, 1651 events. 1050/1651 cut-off events. For 6166/6166 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 7642 event pairs, 24 based on Foata normal form. 46/1697 useless extension candidates. Maximal degree in co-relation 3362. Up to 1385 conditions per place. [2022-12-06 00:07:07,513 INFO L137 encePairwiseOnDemand]: 28/51 looper letters, 108 selfloop transitions, 68 changer transitions 1/177 dead transitions. [2022-12-06 00:07:07,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 177 transitions, 2117 flow [2022-12-06 00:07:07,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:07:07,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:07:07,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2022-12-06 00:07:07,515 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2913165266106443 [2022-12-06 00:07:07,515 INFO L175 Difference]: Start difference. First operand has 60 places, 135 transitions, 1426 flow. Second operand 7 states and 104 transitions. [2022-12-06 00:07:07,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 177 transitions, 2117 flow [2022-12-06 00:07:07,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 177 transitions, 2093 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:07:07,539 INFO L231 Difference]: Finished difference. Result has 67 places, 154 transitions, 1874 flow [2022-12-06 00:07:07,540 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1333, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1874, PETRI_PLACES=67, PETRI_TRANSITIONS=154} [2022-12-06 00:07:07,540 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 28 predicate places. [2022-12-06 00:07:07,540 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:07,540 INFO L89 Accepts]: Start accepts. Operand has 67 places, 154 transitions, 1874 flow [2022-12-06 00:07:07,541 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:07,541 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:07,541 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 154 transitions, 1874 flow [2022-12-06 00:07:07,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 154 transitions, 1874 flow [2022-12-06 00:07:07,597 INFO L130 PetriNetUnfolder]: 283/572 cut-off events. [2022-12-06 00:07:07,598 INFO L131 PetriNetUnfolder]: For 2938/3134 co-relation queries the response was YES. [2022-12-06 00:07:07,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2961 conditions, 572 events. 283/572 cut-off events. For 2938/3134 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 2907 event pairs, 9 based on Foata normal form. 1/569 useless extension candidates. Maximal degree in co-relation 2853. Up to 253 conditions per place. [2022-12-06 00:07:07,603 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 154 transitions, 1874 flow [2022-12-06 00:07:07,603 INFO L188 LiptonReduction]: Number of co-enabled transitions 572 [2022-12-06 00:07:07,604 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:07,605 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-06 00:07:07,605 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 154 transitions, 1874 flow [2022-12-06 00:07:07,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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 00:07:07,605 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:07,605 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:07,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 00:07:07,605 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 00:07:07,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:07,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1551456481, now seen corresponding path program 1 times [2022-12-06 00:07:07,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:07,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730834305] [2022-12-06 00:07:07,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:07,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:07,768 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 00:07:07,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:07,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730834305] [2022-12-06 00:07:07,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730834305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:07,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:07,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:07,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440568971] [2022-12-06 00:07:07,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:07,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:07,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:07,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:07,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:07,770 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 00:07:07,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 154 transitions, 1874 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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 00:07:07,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:07,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 00:07:07,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:08,142 INFO L130 PetriNetUnfolder]: 1063/1676 cut-off events. [2022-12-06 00:07:08,142 INFO L131 PetriNetUnfolder]: For 8129/8129 co-relation queries the response was YES. [2022-12-06 00:07:08,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9455 conditions, 1676 events. 1063/1676 cut-off events. For 8129/8129 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 7903 event pairs, 32 based on Foata normal form. 30/1706 useless extension candidates. Maximal degree in co-relation 7424. Up to 647 conditions per place. [2022-12-06 00:07:08,154 INFO L137 encePairwiseOnDemand]: 27/50 looper letters, 74 selfloop transitions, 114 changer transitions 1/189 dead transitions. [2022-12-06 00:07:08,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 189 transitions, 2475 flow [2022-12-06 00:07:08,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:07:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:07:08,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-12-06 00:07:08,155 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36333333333333334 [2022-12-06 00:07:08,155 INFO L175 Difference]: Start difference. First operand has 67 places, 154 transitions, 1874 flow. Second operand 6 states and 109 transitions. [2022-12-06 00:07:08,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 189 transitions, 2475 flow [2022-12-06 00:07:08,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 189 transitions, 2445 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-12-06 00:07:08,196 INFO L231 Difference]: Finished difference. Result has 73 places, 162 transitions, 2294 flow [2022-12-06 00:07:08,196 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1848, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2294, PETRI_PLACES=73, PETRI_TRANSITIONS=162} [2022-12-06 00:07:08,197 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 34 predicate places. [2022-12-06 00:07:08,197 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:08,197 INFO L89 Accepts]: Start accepts. Operand has 73 places, 162 transitions, 2294 flow [2022-12-06 00:07:08,198 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:08,198 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:08,198 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 162 transitions, 2294 flow [2022-12-06 00:07:08,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 162 transitions, 2294 flow [2022-12-06 00:07:08,257 INFO L130 PetriNetUnfolder]: 287/575 cut-off events. [2022-12-06 00:07:08,257 INFO L131 PetriNetUnfolder]: For 3586/3801 co-relation queries the response was YES. [2022-12-06 00:07:08,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3570 conditions, 575 events. 287/575 cut-off events. For 3586/3801 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 2943 event pairs, 17 based on Foata normal form. 2/573 useless extension candidates. Maximal degree in co-relation 3467. Up to 252 conditions per place. [2022-12-06 00:07:08,263 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 162 transitions, 2294 flow [2022-12-06 00:07:08,263 INFO L188 LiptonReduction]: Number of co-enabled transitions 580 [2022-12-06 00:07:08,264 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:08,265 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-06 00:07:08,265 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 162 transitions, 2294 flow [2022-12-06 00:07:08,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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 00:07:08,265 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:08,265 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:08,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 00:07:08,265 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 00:07:08,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:08,266 INFO L85 PathProgramCache]: Analyzing trace with hash -988750683, now seen corresponding path program 2 times [2022-12-06 00:07:08,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:08,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15899894] [2022-12-06 00:07:08,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:08,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:08,431 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 00:07:08,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:08,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15899894] [2022-12-06 00:07:08,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15899894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:08,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:08,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:07:08,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50318990] [2022-12-06 00:07:08,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:08,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:07:08,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:08,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:07:08,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:07:08,432 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 00:07:08,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 162 transitions, 2294 flow. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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 00:07:08,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:08,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 00:07:08,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:08,908 INFO L130 PetriNetUnfolder]: 1207/1988 cut-off events. [2022-12-06 00:07:08,908 INFO L131 PetriNetUnfolder]: For 11585/11585 co-relation queries the response was YES. [2022-12-06 00:07:08,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11978 conditions, 1988 events. 1207/1988 cut-off events. For 11585/11585 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 10329 event pairs, 19 based on Foata normal form. 54/2042 useless extension candidates. Maximal degree in co-relation 9306. Up to 764 conditions per place. [2022-12-06 00:07:08,923 INFO L137 encePairwiseOnDemand]: 17/50 looper letters, 74 selfloop transitions, 172 changer transitions 4/250 dead transitions. [2022-12-06 00:07:08,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 250 transitions, 3447 flow [2022-12-06 00:07:08,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:07:08,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:07:08,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2022-12-06 00:07:08,925 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38857142857142857 [2022-12-06 00:07:08,925 INFO L175 Difference]: Start difference. First operand has 73 places, 162 transitions, 2294 flow. Second operand 7 states and 136 transitions. [2022-12-06 00:07:08,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 250 transitions, 3447 flow [2022-12-06 00:07:08,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 250 transitions, 3284 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:08,978 INFO L231 Difference]: Finished difference. Result has 79 places, 204 transitions, 3225 flow [2022-12-06 00:07:08,978 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2146, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3225, PETRI_PLACES=79, PETRI_TRANSITIONS=204} [2022-12-06 00:07:08,979 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 40 predicate places. [2022-12-06 00:07:08,979 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:08,979 INFO L89 Accepts]: Start accepts. Operand has 79 places, 204 transitions, 3225 flow [2022-12-06 00:07:08,980 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:08,980 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:08,980 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 204 transitions, 3225 flow [2022-12-06 00:07:08,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 204 transitions, 3225 flow [2022-12-06 00:07:09,057 INFO L130 PetriNetUnfolder]: 296/668 cut-off events. [2022-12-06 00:07:09,057 INFO L131 PetriNetUnfolder]: For 5459/5794 co-relation queries the response was YES. [2022-12-06 00:07:09,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4550 conditions, 668 events. 296/668 cut-off events. For 5459/5794 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 3940 event pairs, 4 based on Foata normal form. 5/671 useless extension candidates. Maximal degree in co-relation 4406. Up to 275 conditions per place. [2022-12-06 00:07:09,065 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 204 transitions, 3225 flow [2022-12-06 00:07:09,065 INFO L188 LiptonReduction]: Number of co-enabled transitions 782 [2022-12-06 00:07:09,066 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:09,067 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 00:07:09,067 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 204 transitions, 3225 flow [2022-12-06 00:07:09,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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 00:07:09,067 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:09,068 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:09,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 00:07:09,068 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 00:07:09,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:09,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1162842075, now seen corresponding path program 3 times [2022-12-06 00:07:09,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:09,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278580237] [2022-12-06 00:07:09,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:09,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:09,243 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 00:07:09,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:09,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278580237] [2022-12-06 00:07:09,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278580237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:09,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:09,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:09,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833059709] [2022-12-06 00:07:09,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:09,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:09,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:09,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:09,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:09,245 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 00:07:09,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 204 transitions, 3225 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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 00:07:09,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:09,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 00:07:09,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:09,612 INFO L130 PetriNetUnfolder]: 802/1405 cut-off events. [2022-12-06 00:07:09,612 INFO L131 PetriNetUnfolder]: For 13405/13405 co-relation queries the response was YES. [2022-12-06 00:07:09,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10133 conditions, 1405 events. 802/1405 cut-off events. For 13405/13405 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 7226 event pairs, 20 based on Foata normal form. 106/1511 useless extension candidates. Maximal degree in co-relation 7120. Up to 510 conditions per place. [2022-12-06 00:07:09,624 INFO L137 encePairwiseOnDemand]: 22/50 looper letters, 94 selfloop transitions, 126 changer transitions 4/224 dead transitions. [2022-12-06 00:07:09,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 224 transitions, 3682 flow [2022-12-06 00:07:09,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:07:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:07:09,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2022-12-06 00:07:09,625 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37 [2022-12-06 00:07:09,625 INFO L175 Difference]: Start difference. First operand has 79 places, 204 transitions, 3225 flow. Second operand 6 states and 111 transitions. [2022-12-06 00:07:09,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 224 transitions, 3682 flow [2022-12-06 00:07:09,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 224 transitions, 3569 flow, removed 52 selfloop flow, removed 1 redundant places. [2022-12-06 00:07:09,692 INFO L231 Difference]: Finished difference. Result has 85 places, 191 transitions, 3302 flow [2022-12-06 00:07:09,693 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2547, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3302, PETRI_PLACES=85, PETRI_TRANSITIONS=191} [2022-12-06 00:07:09,693 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 46 predicate places. [2022-12-06 00:07:09,693 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:09,693 INFO L89 Accepts]: Start accepts. Operand has 85 places, 191 transitions, 3302 flow [2022-12-06 00:07:09,695 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:09,695 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:09,696 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 191 transitions, 3302 flow [2022-12-06 00:07:09,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 191 transitions, 3302 flow [2022-12-06 00:07:09,753 INFO L130 PetriNetUnfolder]: 200/494 cut-off events. [2022-12-06 00:07:09,754 INFO L131 PetriNetUnfolder]: For 4660/4863 co-relation queries the response was YES. [2022-12-06 00:07:09,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3867 conditions, 494 events. 200/494 cut-off events. For 4660/4863 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 2761 event pairs, 5 based on Foata normal form. 5/497 useless extension candidates. Maximal degree in co-relation 3758. Up to 205 conditions per place. [2022-12-06 00:07:09,760 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 191 transitions, 3302 flow [2022-12-06 00:07:09,760 INFO L188 LiptonReduction]: Number of co-enabled transitions 668 [2022-12-06 00:07:09,761 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:09,763 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-06 00:07:09,763 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 191 transitions, 3302 flow [2022-12-06 00:07:09,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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 00:07:09,763 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:09,763 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:09,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 00:07:09,764 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 00:07:09,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:09,764 INFO L85 PathProgramCache]: Analyzing trace with hash 16895420, now seen corresponding path program 1 times [2022-12-06 00:07:09,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:09,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161196734] [2022-12-06 00:07:09,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:09,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:09,946 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 00:07:09,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:09,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161196734] [2022-12-06 00:07:09,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161196734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:09,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:09,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:07:09,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91690204] [2022-12-06 00:07:09,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:09,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:07:09,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:09,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:07:09,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:07:09,949 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:07:09,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 191 transitions, 3302 flow. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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 00:07:09,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:09,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:07:09,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:10,351 INFO L130 PetriNetUnfolder]: 795/1412 cut-off events. [2022-12-06 00:07:10,351 INFO L131 PetriNetUnfolder]: For 11089/11089 co-relation queries the response was YES. [2022-12-06 00:07:10,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10856 conditions, 1412 events. 795/1412 cut-off events. For 11089/11089 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 7461 event pairs, 12 based on Foata normal form. 30/1442 useless extension candidates. Maximal degree in co-relation 7506. Up to 511 conditions per place. [2022-12-06 00:07:10,362 INFO L137 encePairwiseOnDemand]: 20/41 looper letters, 102 selfloop transitions, 133 changer transitions 4/239 dead transitions. [2022-12-06 00:07:10,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 239 transitions, 4161 flow [2022-12-06 00:07:10,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:07:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:07:10,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2022-12-06 00:07:10,364 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3628048780487805 [2022-12-06 00:07:10,364 INFO L175 Difference]: Start difference. First operand has 85 places, 191 transitions, 3302 flow. Second operand 8 states and 119 transitions. [2022-12-06 00:07:10,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 239 transitions, 4161 flow [2022-12-06 00:07:10,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 239 transitions, 3901 flow, removed 18 selfloop flow, removed 4 redundant places. [2022-12-06 00:07:10,439 INFO L231 Difference]: Finished difference. Result has 88 places, 198 transitions, 3455 flow [2022-12-06 00:07:10,439 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3022, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3455, PETRI_PLACES=88, PETRI_TRANSITIONS=198} [2022-12-06 00:07:10,440 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 49 predicate places. [2022-12-06 00:07:10,440 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:10,440 INFO L89 Accepts]: Start accepts. Operand has 88 places, 198 transitions, 3455 flow [2022-12-06 00:07:10,442 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:10,442 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:10,442 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 198 transitions, 3455 flow [2022-12-06 00:07:10,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 198 transitions, 3455 flow [2022-12-06 00:07:10,505 INFO L130 PetriNetUnfolder]: 195/494 cut-off events. [2022-12-06 00:07:10,505 INFO L131 PetriNetUnfolder]: For 4710/4976 co-relation queries the response was YES. [2022-12-06 00:07:10,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3739 conditions, 494 events. 195/494 cut-off events. For 4710/4976 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 2782 event pairs, 1 based on Foata normal form. 5/497 useless extension candidates. Maximal degree in co-relation 3625. Up to 201 conditions per place. [2022-12-06 00:07:10,510 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 198 transitions, 3455 flow [2022-12-06 00:07:10,511 INFO L188 LiptonReduction]: Number of co-enabled transitions 678 [2022-12-06 00:07:10,512 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:10,513 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-06 00:07:10,513 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 198 transitions, 3455 flow [2022-12-06 00:07:10,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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 00:07:10,513 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:10,513 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:10,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 00:07:10,513 INFO L420 AbstractCegarLoop]: === Iteration 15 === 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 00:07:10,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:10,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1060329423, now seen corresponding path program 1 times [2022-12-06 00:07:10,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:10,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385160342] [2022-12-06 00:07:10,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:10,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:10,680 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 00:07:10,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:10,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385160342] [2022-12-06 00:07:10,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385160342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:10,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:10,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:10,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056721926] [2022-12-06 00:07:10,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:10,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:10,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:10,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:10,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:10,682 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:07:10,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 198 transitions, 3455 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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 00:07:10,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:10,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:07:10,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:10,999 INFO L130 PetriNetUnfolder]: 761/1362 cut-off events. [2022-12-06 00:07:10,999 INFO L131 PetriNetUnfolder]: For 11610/11610 co-relation queries the response was YES. [2022-12-06 00:07:11,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10237 conditions, 1362 events. 761/1362 cut-off events. For 11610/11610 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 7108 event pairs, 20 based on Foata normal form. 18/1380 useless extension candidates. Maximal degree in co-relation 6877. Up to 1312 conditions per place. [2022-12-06 00:07:11,011 INFO L137 encePairwiseOnDemand]: 27/41 looper letters, 186 selfloop transitions, 11 changer transitions 8/205 dead transitions. [2022-12-06 00:07:11,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 205 transitions, 3780 flow [2022-12-06 00:07:11,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:07:11,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:07:11,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-12-06 00:07:11,013 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26422764227642276 [2022-12-06 00:07:11,013 INFO L175 Difference]: Start difference. First operand has 88 places, 198 transitions, 3455 flow. Second operand 6 states and 65 transitions. [2022-12-06 00:07:11,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 205 transitions, 3780 flow [2022-12-06 00:07:11,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 205 transitions, 3537 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 00:07:11,073 INFO L231 Difference]: Finished difference. Result has 90 places, 187 transitions, 3006 flow [2022-12-06 00:07:11,074 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3069, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3006, PETRI_PLACES=90, PETRI_TRANSITIONS=187} [2022-12-06 00:07:11,074 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 51 predicate places. [2022-12-06 00:07:11,074 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:11,074 INFO L89 Accepts]: Start accepts. Operand has 90 places, 187 transitions, 3006 flow [2022-12-06 00:07:11,076 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:11,076 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:11,076 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 187 transitions, 3006 flow [2022-12-06 00:07:11,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 187 transitions, 3006 flow [2022-12-06 00:07:11,132 INFO L130 PetriNetUnfolder]: 187/480 cut-off events. [2022-12-06 00:07:11,132 INFO L131 PetriNetUnfolder]: For 4104/4190 co-relation queries the response was YES. [2022-12-06 00:07:11,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3353 conditions, 480 events. 187/480 cut-off events. For 4104/4190 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 2712 event pairs, 4 based on Foata normal form. 3/482 useless extension candidates. Maximal degree in co-relation 3238. Up to 195 conditions per place. [2022-12-06 00:07:11,137 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 187 transitions, 3006 flow [2022-12-06 00:07:11,137 INFO L188 LiptonReduction]: Number of co-enabled transitions 648 [2022-12-06 00:07:11,144 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] $Ultimate##0-->L105: Formula: (and (= (+ v_~t~0_55 1) v_~t~0_54) (= v_~m4~0_7 v_~t~0_55)) InVars {~t~0=v_~t~0_55} OutVars{~m4~0=v_~m4~0_7, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_1|, ~t~0=v_~t~0_54} AuxVars[] AssignedVars[~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~t~0] and [478] L67-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| 0)) (= v_~b~0_159 (ite (= (ite (or (= v_~x~0_98 1) (not (= (mod v_~b~0_160 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= (ite (<= v_~m2~0_57 v_~s~0_341) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~s~0_341 1) v_~s~0_340)) InVars {~b~0=v_~b~0_160, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_98, ~s~0=v_~s~0_341} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~b~0=v_~b~0_159, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|, ~x~0=v_~x~0_98, ~s~0=v_~s~0_340} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-06 00:07:11,223 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [540] $Ultimate##0-->L45: Formula: (and (= (+ v_~t~0_245 1) v_~m3~0_125) (= v_~t~0_243 (+ v_~m3~0_125 2)) (= v_~t~0_245 v_~m2~0_108) (= (+ v_~m3~0_125 1) v_~m1~0_121)) InVars {~t~0=v_~t~0_245} OutVars{~m3~0=v_~m3~0_125, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_25|, ~m1~0=v_~m1~0_121, ~m2~0=v_~m2~0_108, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_16|, ~t~0=v_~t~0_243, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_51|} AuxVars[] AssignedVars[~m3~0, thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [478] L67-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| 0)) (= v_~b~0_159 (ite (= (ite (or (= v_~x~0_98 1) (not (= (mod v_~b~0_160 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= (ite (<= v_~m2~0_57 v_~s~0_341) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~s~0_341 1) v_~s~0_340)) InVars {~b~0=v_~b~0_160, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_98, ~s~0=v_~s~0_341} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~b~0=v_~b~0_159, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|, ~x~0=v_~x~0_98, ~s~0=v_~s~0_340} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-06 00:07:11,303 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [540] $Ultimate##0-->L45: Formula: (and (= (+ v_~t~0_245 1) v_~m3~0_125) (= v_~t~0_243 (+ v_~m3~0_125 2)) (= v_~t~0_245 v_~m2~0_108) (= (+ v_~m3~0_125 1) v_~m1~0_121)) InVars {~t~0=v_~t~0_245} OutVars{~m3~0=v_~m3~0_125, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_25|, ~m1~0=v_~m1~0_121, ~m2~0=v_~m2~0_108, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_16|, ~t~0=v_~t~0_243, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_51|} AuxVars[] AssignedVars[~m3~0, thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [544] $Ultimate##0-->thread2EXIT: Formula: (and (= v_~t~0_266 v_~m4~0_92) (= |v_thread2Thread1of1ForFork1_#res#1.offset_37| 0) (= (+ v_~s~0_547 1) v_~s~0_546) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_65| 0)) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_37|) (= v_~t~0_265 (+ v_~t~0_266 1)) (= v_~b~0_339 (ite (= (ite (or (= v_~x~0_216 1) (not (= (mod v_~b~0_340 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_65| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|) (= (ite (<= v_~m2~0_116 v_~s~0_547) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|)) InVars {~b~0=v_~b~0_340, ~m2~0=v_~m2~0_116, ~x~0=v_~x~0_216, ~s~0=v_~s~0_547, ~t~0=v_~t~0_266} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_65|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_37|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_67|, ~b~0=v_~b~0_339, ~m4~0=v_~m4~0_92, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_16|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_37|, ~m2~0=v_~m2~0_116, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~x~0=v_~x~0_216, ~s~0=v_~s~0_546, ~t~0=v_~t~0_265} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, ~b~0, ~m4~0, thread4Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~s~0, ~t~0] [2022-12-06 00:07:11,408 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [546] $Ultimate##0-->thread2EXIT: Formula: (and (= v_~t~0_273 (+ v_~m4~0_94 1)) (= (ite (<= v_~m2~0_120 v_~s~0_555) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= v_~s~0_554 (+ v_~s~0_555 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ v_~t~0_275 1) v_~m3~0_131) (= |v_thread2Thread1of1ForFork1_#res#1.offset_41| 0) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_41|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (= (+ v_~m3~0_131 1) v_~m1~0_127) (= v_~t~0_275 v_~m2~0_120) (= v_~t~0_273 (+ v_~m3~0_131 3)) (= v_~b~0_347 (ite (= (ite (or (not (= (mod v_~b~0_348 256) 0)) (= v_~x~0_220 1)) 1 0) 0) 0 1))) InVars {~b~0=v_~b~0_348, ~x~0=v_~x~0_220, ~s~0=v_~s~0_555, ~t~0=v_~t~0_275} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_71|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_18|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_26|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, ~m3~0=v_~m3~0_131, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_31|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_41|, ~b~0=v_~b~0_347, ~m4~0=v_~m4~0_94, ~m2~0=v_~m2~0_120, ~m1~0=v_~m1~0_127, ~x~0=v_~x~0_220, ~s~0=v_~s~0_554, ~t~0=v_~t~0_273, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_57|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread4Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~m3~0, thread1Thread1of1ForFork3_#t~post1#1, thread2Thread1of1ForFork1_#res#1.base, ~b~0, ~m4~0, ~m2~0, ~m1~0, ~s~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [504] L86-->thread3EXIT: Formula: (and (= v_~s~0_388 (+ v_~s~0_389 1)) (= |v_thread3Thread1of1ForFork2_#res#1.base_27| 0) (= v_~b~0_199 (ite (= (ite (or (not (= (mod v_~b~0_200 256) 0)) (= v_~x~0_128 1)) 1 0) 0) 0 1)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) (= (ite (<= v_~m3~0_59 v_~s~0_389) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_27|)) InVars {~m3~0=v_~m3~0_59, ~b~0=v_~b~0_200, ~x~0=v_~x~0_128, ~s~0=v_~s~0_389} OutVars{~m3~0=v_~m3~0_59, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_27|, ~b~0=v_~b~0_199, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_27|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, ~x~0=v_~x~0_128, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_47|, ~s~0=v_~s~0_388} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0] [2022-12-06 00:07:11,665 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] $Ultimate##0-->L105: Formula: (and (= v_~t~0_231 (+ v_~m4~0_90 1)) (= v_~t~0_233 v_~m3~0_121) (= v_~m4~0_90 (+ v_~t~0_233 1))) InVars {~t~0=v_~t~0_233} OutVars{~m3~0=v_~m3~0_121, ~m4~0=v_~m4~0_90, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_14|, ~t~0=v_~t~0_231, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_47|} AuxVars[] AssignedVars[~m3~0, ~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [478] L67-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| 0)) (= v_~b~0_159 (ite (= (ite (or (= v_~x~0_98 1) (not (= (mod v_~b~0_160 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= (ite (<= v_~m2~0_57 v_~s~0_341) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~s~0_341 1) v_~s~0_340)) InVars {~b~0=v_~b~0_160, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_98, ~s~0=v_~s~0_341} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~b~0=v_~b~0_159, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|, ~x~0=v_~x~0_98, ~s~0=v_~s~0_340} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-06 00:07:11,726 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [383] $Ultimate##0-->L67: Formula: (and (= v_~t~0_46 (+ v_~t~0_47 1)) (= v_~m2~0_11 v_~t~0_47)) InVars {~t~0=v_~t~0_47} OutVars{thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_46} AuxVars[] AssignedVars[~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0] and [548] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_45| 0) (= v_~b~0_357 (ite (= (ite (or (not (= (mod v_~b~0_358 256) 0)) (= v_~x~0_224 1)) 1 0) 0) 0 1)) (= (ite (<= v_~m2~0_124 v_~s~0_565) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_73| 0)) (= v_~t~0_283 (+ v_~m4~0_98 1)) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_45|) (= v_~t~0_284 v_~m3~0_135) (= v_~m4~0_98 (+ v_~t~0_284 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_73| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= v_~s~0_564 (+ v_~s~0_565 1))) InVars {~b~0=v_~b~0_358, ~m2~0=v_~m2~0_124, ~x~0=v_~x~0_224, ~s~0=v_~s~0_565, ~t~0=v_~t~0_284} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_75|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_22|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_45|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|, ~m3~0=v_~m3~0_135, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_45|, ~b~0=v_~b~0_357, ~m4~0=v_~m4~0_98, ~m2~0=v_~m2~0_124, ~x~0=v_~x~0_224, ~s~0=v_~s~0_564, ~t~0=v_~t~0_283, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_61|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~m3~0, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, ~b~0, thread4Thread1of1ForFork0_#t~post7#1, ~m4~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~s~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] [2022-12-06 00:07:11,799 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 00:07:11,800 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 726 [2022-12-06 00:07:11,800 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 185 transitions, 3000 flow [2022-12-06 00:07:11,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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 00:07:11,800 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:11,800 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:11,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 00:07:11,800 INFO L420 AbstractCegarLoop]: === Iteration 16 === 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 00:07:11,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:11,801 INFO L85 PathProgramCache]: Analyzing trace with hash -514635929, now seen corresponding path program 1 times [2022-12-06 00:07:11,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:11,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824985064] [2022-12-06 00:07:11,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:11,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:11,955 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 00:07:11,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:11,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824985064] [2022-12-06 00:07:11,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824985064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:11,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:11,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:11,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657519082] [2022-12-06 00:07:11,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:11,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:11,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:11,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:11,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:11,957 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 00:07:11,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 185 transitions, 3000 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 00:07:11,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:11,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 00:07:11,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:12,331 INFO L130 PetriNetUnfolder]: 841/1520 cut-off events. [2022-12-06 00:07:12,332 INFO L131 PetriNetUnfolder]: For 11286/11286 co-relation queries the response was YES. [2022-12-06 00:07:12,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10766 conditions, 1520 events. 841/1520 cut-off events. For 11286/11286 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 8254 event pairs, 21 based on Foata normal form. 32/1552 useless extension candidates. Maximal degree in co-relation 10405. Up to 818 conditions per place. [2022-12-06 00:07:12,344 INFO L137 encePairwiseOnDemand]: 22/43 looper letters, 121 selfloop transitions, 122 changer transitions 9/252 dead transitions. [2022-12-06 00:07:12,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 252 transitions, 4368 flow [2022-12-06 00:07:12,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:07:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:07:12,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2022-12-06 00:07:12,345 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38372093023255816 [2022-12-06 00:07:12,345 INFO L175 Difference]: Start difference. First operand has 87 places, 185 transitions, 3000 flow. Second operand 6 states and 99 transitions. [2022-12-06 00:07:12,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 252 transitions, 4368 flow [2022-12-06 00:07:12,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 252 transitions, 4283 flow, removed 33 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:12,409 INFO L231 Difference]: Finished difference. Result has 92 places, 219 transitions, 4019 flow [2022-12-06 00:07:12,409 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2927, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4019, PETRI_PLACES=92, PETRI_TRANSITIONS=219} [2022-12-06 00:07:12,409 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 53 predicate places. [2022-12-06 00:07:12,409 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:12,409 INFO L89 Accepts]: Start accepts. Operand has 92 places, 219 transitions, 4019 flow [2022-12-06 00:07:12,411 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:12,411 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:12,411 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 219 transitions, 4019 flow [2022-12-06 00:07:12,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 219 transitions, 4019 flow [2022-12-06 00:07:12,483 INFO L130 PetriNetUnfolder]: 197/535 cut-off events. [2022-12-06 00:07:12,483 INFO L131 PetriNetUnfolder]: For 5630/5754 co-relation queries the response was YES. [2022-12-06 00:07:12,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4250 conditions, 535 events. 197/535 cut-off events. For 5630/5754 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3263 event pairs, 4 based on Foata normal form. 7/541 useless extension candidates. Maximal degree in co-relation 4123. Up to 219 conditions per place. [2022-12-06 00:07:12,488 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 219 transitions, 4019 flow [2022-12-06 00:07:12,488 INFO L188 LiptonReduction]: Number of co-enabled transitions 732 [2022-12-06 00:07:12,489 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:12,489 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 00:07:12,489 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 219 transitions, 4019 flow [2022-12-06 00:07:12,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 00:07:12,489 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:12,490 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:12,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 00:07:12,490 INFO L420 AbstractCegarLoop]: === Iteration 17 === 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 00:07:12,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:12,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1047073, now seen corresponding path program 2 times [2022-12-06 00:07:12,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:12,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666905521] [2022-12-06 00:07:12,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:12,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:12,657 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 00:07:12,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:12,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666905521] [2022-12-06 00:07:12,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666905521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:12,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:12,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:12,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872001391] [2022-12-06 00:07:12,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:12,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:12,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:12,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:12,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:12,660 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:07:12,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 219 transitions, 4019 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 00:07:12,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:12,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:07:12,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:13,004 INFO L130 PetriNetUnfolder]: 815/1486 cut-off events. [2022-12-06 00:07:13,004 INFO L131 PetriNetUnfolder]: For 13333/13333 co-relation queries the response was YES. [2022-12-06 00:07:13,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11654 conditions, 1486 events. 815/1486 cut-off events. For 13333/13333 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 8167 event pairs, 20 based on Foata normal form. 4/1490 useless extension candidates. Maximal degree in co-relation 8076. Up to 1459 conditions per place. [2022-12-06 00:07:13,017 INFO L137 encePairwiseOnDemand]: 29/41 looper letters, 215 selfloop transitions, 10 changer transitions 8/233 dead transitions. [2022-12-06 00:07:13,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 233 transitions, 4575 flow [2022-12-06 00:07:13,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:07:13,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:07:13,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-12-06 00:07:13,019 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21602787456445993 [2022-12-06 00:07:13,019 INFO L175 Difference]: Start difference. First operand has 90 places, 219 transitions, 4019 flow. Second operand 7 states and 62 transitions. [2022-12-06 00:07:13,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 233 transitions, 4575 flow [2022-12-06 00:07:13,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 233 transitions, 4555 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-06 00:07:13,133 INFO L231 Difference]: Finished difference. Result has 97 places, 218 transitions, 4011 flow [2022-12-06 00:07:13,133 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3999, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4011, PETRI_PLACES=97, PETRI_TRANSITIONS=218} [2022-12-06 00:07:13,133 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 58 predicate places. [2022-12-06 00:07:13,133 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:13,133 INFO L89 Accepts]: Start accepts. Operand has 97 places, 218 transitions, 4011 flow [2022-12-06 00:07:13,136 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:13,136 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:13,136 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 218 transitions, 4011 flow [2022-12-06 00:07:13,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 218 transitions, 4011 flow [2022-12-06 00:07:13,217 INFO L130 PetriNetUnfolder]: 197/534 cut-off events. [2022-12-06 00:07:13,218 INFO L131 PetriNetUnfolder]: For 5625/5707 co-relation queries the response was YES. [2022-12-06 00:07:13,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4261 conditions, 534 events. 197/534 cut-off events. For 5625/5707 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3283 event pairs, 4 based on Foata normal form. 3/536 useless extension candidates. Maximal degree in co-relation 4131. Up to 218 conditions per place. [2022-12-06 00:07:13,226 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 218 transitions, 4011 flow [2022-12-06 00:07:13,226 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:13,227 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] $Ultimate##0-->thread2EXIT: Formula: (and (= v_~s~0_568 (+ v_~s~0_569 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_47| 0) (= v_~m3~0_137 (+ v_~t~0_289 1)) (= v_~m4~0_100 (+ v_~m3~0_137 1)) (= (ite (= 0 (ite (or (= v_~x~0_226 1) (not (= (mod v_~b~0_362 256) 0))) 1 0)) 0 1) v_~b~0_361) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~t~0_287 (+ v_~m4~0_100 1)) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_47|) (= v_~t~0_289 v_~m2~0_126) (= (ite (<= v_~m2~0_126 v_~s~0_569) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|)) InVars {~b~0=v_~b~0_362, ~x~0=v_~x~0_226, ~s~0=v_~s~0_569, ~t~0=v_~t~0_289} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_77|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_24|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_47|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_30|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, ~m3~0=v_~m3~0_137, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_47|, ~b~0=v_~b~0_361, ~m4~0=v_~m4~0_100, ~m2~0=v_~m2~0_126, ~x~0=v_~x~0_226, ~s~0=v_~s~0_568, ~t~0=v_~t~0_287, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_63|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread4Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~m3~0, thread2Thread1of1ForFork1_#res#1.base, ~b~0, ~m4~0, ~m2~0, ~s~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [504] L86-->thread3EXIT: Formula: (and (= v_~s~0_388 (+ v_~s~0_389 1)) (= |v_thread3Thread1of1ForFork2_#res#1.base_27| 0) (= v_~b~0_199 (ite (= (ite (or (not (= (mod v_~b~0_200 256) 0)) (= v_~x~0_128 1)) 1 0) 0) 0 1)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) (= (ite (<= v_~m3~0_59 v_~s~0_389) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_27|)) InVars {~m3~0=v_~m3~0_59, ~b~0=v_~b~0_200, ~x~0=v_~x~0_128, ~s~0=v_~s~0_389} OutVars{~m3~0=v_~m3~0_59, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_27|, ~b~0=v_~b~0_199, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_27|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, ~x~0=v_~x~0_128, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_47|, ~s~0=v_~s~0_388} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0] [2022-12-06 00:07:13,449 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:13,450 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 317 [2022-12-06 00:07:13,450 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 218 transitions, 4020 flow [2022-12-06 00:07:13,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 00:07:13,450 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:13,450 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:13,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 00:07:13,451 INFO L420 AbstractCegarLoop]: === Iteration 18 === 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 00:07:13,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:13,451 INFO L85 PathProgramCache]: Analyzing trace with hash 329872912, now seen corresponding path program 1 times [2022-12-06 00:07:13,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:13,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337076087] [2022-12-06 00:07:13,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:13,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:13,585 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 00:07:13,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:13,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337076087] [2022-12-06 00:07:13,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337076087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:13,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:13,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:13,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772581317] [2022-12-06 00:07:13,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:13,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:07:13,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:13,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:07:13,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:07:13,587 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:07:13,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 218 transitions, 4020 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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 00:07:13,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:13,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:07:13,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:13,890 INFO L130 PetriNetUnfolder]: 808/1471 cut-off events. [2022-12-06 00:07:13,890 INFO L131 PetriNetUnfolder]: For 13309/13309 co-relation queries the response was YES. [2022-12-06 00:07:13,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11584 conditions, 1471 events. 808/1471 cut-off events. For 13309/13309 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 8098 event pairs, 20 based on Foata normal form. 2/1473 useless extension candidates. Maximal degree in co-relation 11233. Up to 1457 conditions per place. [2022-12-06 00:07:13,902 INFO L137 encePairwiseOnDemand]: 30/41 looper letters, 215 selfloop transitions, 10 changer transitions 0/225 dead transitions. [2022-12-06 00:07:13,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 225 transitions, 4475 flow [2022-12-06 00:07:13,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:13,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-06 00:07:13,904 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2634146341463415 [2022-12-06 00:07:13,904 INFO L175 Difference]: Start difference. First operand has 94 places, 218 transitions, 4020 flow. Second operand 5 states and 54 transitions. [2022-12-06 00:07:13,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 225 transitions, 4475 flow [2022-12-06 00:07:13,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 225 transitions, 4437 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:14,003 INFO L231 Difference]: Finished difference. Result has 96 places, 218 transitions, 3995 flow [2022-12-06 00:07:14,003 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3954, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3995, PETRI_PLACES=96, PETRI_TRANSITIONS=218} [2022-12-06 00:07:14,004 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 57 predicate places. [2022-12-06 00:07:14,004 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:14,004 INFO L89 Accepts]: Start accepts. Operand has 96 places, 218 transitions, 3995 flow [2022-12-06 00:07:14,005 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:14,005 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:14,005 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 218 transitions, 3995 flow [2022-12-06 00:07:14,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 218 transitions, 3995 flow [2022-12-06 00:07:14,075 INFO L130 PetriNetUnfolder]: 196/533 cut-off events. [2022-12-06 00:07:14,075 INFO L131 PetriNetUnfolder]: For 5668/5880 co-relation queries the response was YES. [2022-12-06 00:07:14,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4234 conditions, 533 events. 196/533 cut-off events. For 5668/5880 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3273 event pairs, 4 based on Foata normal form. 7/538 useless extension candidates. Maximal degree in co-relation 4112. Up to 217 conditions per place. [2022-12-06 00:07:14,081 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 218 transitions, 3995 flow [2022-12-06 00:07:14,081 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:14,083 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] $Ultimate##0-->thread2EXIT: Formula: (and (= v_~s~0_568 (+ v_~s~0_569 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_47| 0) (= v_~m3~0_137 (+ v_~t~0_289 1)) (= v_~m4~0_100 (+ v_~m3~0_137 1)) (= (ite (= 0 (ite (or (= v_~x~0_226 1) (not (= (mod v_~b~0_362 256) 0))) 1 0)) 0 1) v_~b~0_361) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~t~0_287 (+ v_~m4~0_100 1)) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_47|) (= v_~t~0_289 v_~m2~0_126) (= (ite (<= v_~m2~0_126 v_~s~0_569) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|)) InVars {~b~0=v_~b~0_362, ~x~0=v_~x~0_226, ~s~0=v_~s~0_569, ~t~0=v_~t~0_289} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_77|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_24|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_47|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_30|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, ~m3~0=v_~m3~0_137, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_47|, ~b~0=v_~b~0_361, ~m4~0=v_~m4~0_100, ~m2~0=v_~m2~0_126, ~x~0=v_~x~0_226, ~s~0=v_~s~0_568, ~t~0=v_~t~0_287, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_63|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread4Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~m3~0, thread2Thread1of1ForFork1_#res#1.base, ~b~0, ~m4~0, ~m2~0, ~s~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [376] $Ultimate##0-->L45: Formula: (and (= (+ v_~t~0_51 1) v_~t~0_50) (= v_~m1~0_9 v_~t~0_51)) InVars {~t~0=v_~t~0_51} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_50} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~t~0] [2022-12-06 00:07:14,184 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [551] $Ultimate##0-->L45: Formula: (and (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_51|) (= (+ v_~m3~0_141 1) v_~m4~0_104) (= v_~t~0_299 v_~m2~0_130) (= v_~b~0_371 (ite (= (ite (or (not (= (mod v_~b~0_372 256) 0)) (= v_~x~0_230 1)) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_79| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_51| 0) (= (+ v_~m4~0_104 1) v_~m1~0_131) (= (+ v_~t~0_299 1) v_~m3~0_141) (= v_~t~0_297 (+ 1 v_~m1~0_131)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_79| 0)) (= (+ v_~s~0_579 1) v_~s~0_578) (= (ite (<= v_~m2~0_130 v_~s~0_579) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|)) InVars {~b~0=v_~b~0_372, ~x~0=v_~x~0_230, ~t~0=v_~t~0_299, ~s~0=v_~s~0_579} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_81|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_28|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_51|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_34|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_79|, ~m3~0=v_~m3~0_141, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_35|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_51|, ~b~0=v_~b~0_371, ~m4~0=v_~m4~0_104, ~m1~0=v_~m1~0_131, ~m2~0=v_~m2~0_130, ~x~0=v_~x~0_230, ~t~0=v_~t~0_297, ~s~0=v_~s~0_578, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_67|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread4Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~m3~0, thread1Thread1of1ForFork3_#t~post1#1, thread2Thread1of1ForFork1_#res#1.base, ~b~0, ~m4~0, ~m1~0, ~m2~0, ~t~0, ~s~0, thread3Thread1of1ForFork2_#t~post5#1] and [504] L86-->thread3EXIT: Formula: (and (= v_~s~0_388 (+ v_~s~0_389 1)) (= |v_thread3Thread1of1ForFork2_#res#1.base_27| 0) (= v_~b~0_199 (ite (= (ite (or (not (= (mod v_~b~0_200 256) 0)) (= v_~x~0_128 1)) 1 0) 0) 0 1)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) (= (ite (<= v_~m3~0_59 v_~s~0_389) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_27|)) InVars {~m3~0=v_~m3~0_59, ~b~0=v_~b~0_200, ~x~0=v_~x~0_128, ~s~0=v_~s~0_389} OutVars{~m3~0=v_~m3~0_59, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_27|, ~b~0=v_~b~0_199, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_27|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, ~x~0=v_~x~0_128, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_47|, ~s~0=v_~s~0_388} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0] [2022-12-06 00:07:14,428 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:07:14,428 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 424 [2022-12-06 00:07:14,429 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 216 transitions, 3961 flow [2022-12-06 00:07:14,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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 00:07:14,429 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:14,429 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:14,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 00:07:14,429 INFO L420 AbstractCegarLoop]: === Iteration 19 === 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 00:07:14,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:14,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1678848713, now seen corresponding path program 1 times [2022-12-06 00:07:14,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:14,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789297424] [2022-12-06 00:07:14,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:14,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:14,564 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 00:07:14,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:14,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789297424] [2022-12-06 00:07:14,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789297424] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:14,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:14,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:14,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272349076] [2022-12-06 00:07:14,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:14,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:07:14,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:14,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:07:14,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:07:14,566 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:07:14,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 216 transitions, 3961 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 00:07:14,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:14,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:07:14,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:14,916 INFO L130 PetriNetUnfolder]: 804/1463 cut-off events. [2022-12-06 00:07:14,916 INFO L131 PetriNetUnfolder]: For 13082/13082 co-relation queries the response was YES. [2022-12-06 00:07:14,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11490 conditions, 1463 events. 804/1463 cut-off events. For 13082/13082 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 7968 event pairs, 14 based on Foata normal form. 4/1467 useless extension candidates. Maximal degree in co-relation 11323. Up to 1273 conditions per place. [2022-12-06 00:07:14,929 INFO L137 encePairwiseOnDemand]: 22/41 looper letters, 174 selfloop transitions, 55 changer transitions 4/233 dead transitions. [2022-12-06 00:07:14,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 233 transitions, 4544 flow [2022-12-06 00:07:14,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:14,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-06 00:07:14,930 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37073170731707317 [2022-12-06 00:07:14,930 INFO L175 Difference]: Start difference. First operand has 93 places, 216 transitions, 3961 flow. Second operand 5 states and 76 transitions. [2022-12-06 00:07:14,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 233 transitions, 4544 flow [2022-12-06 00:07:15,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 233 transitions, 4512 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-06 00:07:15,029 INFO L231 Difference]: Finished difference. Result has 95 places, 213 transitions, 4075 flow [2022-12-06 00:07:15,029 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3903, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4075, PETRI_PLACES=95, PETRI_TRANSITIONS=213} [2022-12-06 00:07:15,030 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 56 predicate places. [2022-12-06 00:07:15,030 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:15,030 INFO L89 Accepts]: Start accepts. Operand has 95 places, 213 transitions, 4075 flow [2022-12-06 00:07:15,033 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:15,033 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:15,033 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 213 transitions, 4075 flow [2022-12-06 00:07:15,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 213 transitions, 4075 flow [2022-12-06 00:07:15,100 INFO L130 PetriNetUnfolder]: 194/526 cut-off events. [2022-12-06 00:07:15,101 INFO L131 PetriNetUnfolder]: For 6171/6252 co-relation queries the response was YES. [2022-12-06 00:07:15,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4331 conditions, 526 events. 194/526 cut-off events. For 6171/6252 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3187 event pairs, 4 based on Foata normal form. 3/528 useless extension candidates. Maximal degree in co-relation 4201. Up to 215 conditions per place. [2022-12-06 00:07:15,107 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 213 transitions, 4075 flow [2022-12-06 00:07:15,107 INFO L188 LiptonReduction]: Number of co-enabled transitions 720 [2022-12-06 00:07:15,108 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:15,109 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 00:07:15,109 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 213 transitions, 4075 flow [2022-12-06 00:07:15,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 00:07:15,110 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:15,110 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:15,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 00:07:15,110 INFO L420 AbstractCegarLoop]: === Iteration 20 === 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 00:07:15,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:15,110 INFO L85 PathProgramCache]: Analyzing trace with hash 2019282091, now seen corresponding path program 1 times [2022-12-06 00:07:15,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:15,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461435286] [2022-12-06 00:07:15,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:15,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:15,279 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 00:07:15,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:15,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461435286] [2022-12-06 00:07:15,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461435286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:15,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:15,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:07:15,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658666540] [2022-12-06 00:07:15,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:15,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:07:15,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:15,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:07:15,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:07:15,281 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 00:07:15,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 213 transitions, 4075 flow. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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 00:07:15,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:15,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 00:07:15,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:15,697 INFO L130 PetriNetUnfolder]: 839/1528 cut-off events. [2022-12-06 00:07:15,697 INFO L131 PetriNetUnfolder]: For 15431/15431 co-relation queries the response was YES. [2022-12-06 00:07:15,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12490 conditions, 1528 events. 839/1528 cut-off events. For 15431/15431 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 8507 event pairs, 14 based on Foata normal form. 30/1558 useless extension candidates. Maximal degree in co-relation 8295. Up to 870 conditions per place. [2022-12-06 00:07:15,709 INFO L137 encePairwiseOnDemand]: 21/39 looper letters, 138 selfloop transitions, 125 changer transitions 5/268 dead transitions. [2022-12-06 00:07:15,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 268 transitions, 5375 flow [2022-12-06 00:07:15,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:07:15,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:07:15,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-12-06 00:07:15,711 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36538461538461536 [2022-12-06 00:07:15,711 INFO L175 Difference]: Start difference. First operand has 95 places, 213 transitions, 4075 flow. Second operand 8 states and 114 transitions. [2022-12-06 00:07:15,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 268 transitions, 5375 flow [2022-12-06 00:07:15,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 268 transitions, 5270 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:15,832 INFO L231 Difference]: Finished difference. Result has 104 places, 232 transitions, 4878 flow [2022-12-06 00:07:15,833 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=3985, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4878, PETRI_PLACES=104, PETRI_TRANSITIONS=232} [2022-12-06 00:07:15,833 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 65 predicate places. [2022-12-06 00:07:15,833 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:15,833 INFO L89 Accepts]: Start accepts. Operand has 104 places, 232 transitions, 4878 flow [2022-12-06 00:07:15,835 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:15,835 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:15,836 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 232 transitions, 4878 flow [2022-12-06 00:07:15,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 232 transitions, 4878 flow [2022-12-06 00:07:15,908 INFO L130 PetriNetUnfolder]: 201/549 cut-off events. [2022-12-06 00:07:15,908 INFO L131 PetriNetUnfolder]: For 7480/7856 co-relation queries the response was YES. [2022-12-06 00:07:15,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4966 conditions, 549 events. 201/549 cut-off events. For 7480/7856 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 3420 event pairs, 2 based on Foata normal form. 8/553 useless extension candidates. Maximal degree in co-relation 4832. Up to 230 conditions per place. [2022-12-06 00:07:15,915 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 232 transitions, 4878 flow [2022-12-06 00:07:15,915 INFO L188 LiptonReduction]: Number of co-enabled transitions 758 [2022-12-06 00:07:15,916 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:15,917 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 00:07:15,917 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 232 transitions, 4878 flow [2022-12-06 00:07:15,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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 00:07:15,917 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:15,917 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:15,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 00:07:15,918 INFO L420 AbstractCegarLoop]: === Iteration 21 === 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 00:07:15,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:15,918 INFO L85 PathProgramCache]: Analyzing trace with hash 6246705, now seen corresponding path program 2 times [2022-12-06 00:07:15,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:15,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779362169] [2022-12-06 00:07:15,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:15,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:16,074 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 00:07:16,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:16,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779362169] [2022-12-06 00:07:16,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779362169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:16,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:16,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:16,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597061827] [2022-12-06 00:07:16,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:16,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:16,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:16,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:16,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:16,077 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 00:07:16,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 232 transitions, 4878 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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 00:07:16,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:16,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 00:07:16,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:16,490 INFO L130 PetriNetUnfolder]: 798/1481 cut-off events. [2022-12-06 00:07:16,490 INFO L131 PetriNetUnfolder]: For 18036/18036 co-relation queries the response was YES. [2022-12-06 00:07:16,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12853 conditions, 1481 events. 798/1481 cut-off events. For 18036/18036 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 8371 event pairs, 12 based on Foata normal form. 44/1525 useless extension candidates. Maximal degree in co-relation 12122. Up to 843 conditions per place. [2022-12-06 00:07:16,505 INFO L137 encePairwiseOnDemand]: 16/39 looper letters, 129 selfloop transitions, 124 changer transitions 4/257 dead transitions. [2022-12-06 00:07:16,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 257 transitions, 5495 flow [2022-12-06 00:07:16,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:07:16,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:07:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-12-06 00:07:16,507 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4358974358974359 [2022-12-06 00:07:16,507 INFO L175 Difference]: Start difference. First operand has 104 places, 232 transitions, 4878 flow. Second operand 6 states and 102 transitions. [2022-12-06 00:07:16,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 257 transitions, 5495 flow [2022-12-06 00:07:16,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 257 transitions, 5397 flow, removed 19 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:16,653 INFO L231 Difference]: Finished difference. Result has 108 places, 227 transitions, 4996 flow [2022-12-06 00:07:16,654 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=4630, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4996, PETRI_PLACES=108, PETRI_TRANSITIONS=227} [2022-12-06 00:07:16,655 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 69 predicate places. [2022-12-06 00:07:16,655 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:16,655 INFO L89 Accepts]: Start accepts. Operand has 108 places, 227 transitions, 4996 flow [2022-12-06 00:07:16,658 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:16,658 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:16,658 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 227 transitions, 4996 flow [2022-12-06 00:07:16,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 227 transitions, 4996 flow [2022-12-06 00:07:16,751 INFO L130 PetriNetUnfolder]: 185/530 cut-off events. [2022-12-06 00:07:16,751 INFO L131 PetriNetUnfolder]: For 7942/8178 co-relation queries the response was YES. [2022-12-06 00:07:16,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5095 conditions, 530 events. 185/530 cut-off events. For 7942/8178 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 3335 event pairs, 6 based on Foata normal form. 8/536 useless extension candidates. Maximal degree in co-relation 4964. Up to 227 conditions per place. [2022-12-06 00:07:16,760 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 227 transitions, 4996 flow [2022-12-06 00:07:16,761 INFO L188 LiptonReduction]: Number of co-enabled transitions 736 [2022-12-06 00:07:16,762 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:16,763 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-06 00:07:16,764 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 227 transitions, 4996 flow [2022-12-06 00:07:16,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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 00:07:16,764 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:16,764 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:16,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 00:07:16,765 INFO L420 AbstractCegarLoop]: === Iteration 22 === 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 00:07:16,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:16,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1712979407, now seen corresponding path program 3 times [2022-12-06 00:07:16,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:16,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867077296] [2022-12-06 00:07:16,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:16,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:16,946 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 00:07:16,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:16,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867077296] [2022-12-06 00:07:16,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867077296] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:16,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:16,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:07:16,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937527279] [2022-12-06 00:07:16,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:16,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:07:16,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:16,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:07:16,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:07:16,948 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 00:07:16,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 227 transitions, 4996 flow. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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 00:07:16,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:16,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 00:07:16,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:17,425 INFO L130 PetriNetUnfolder]: 802/1509 cut-off events. [2022-12-06 00:07:17,434 INFO L131 PetriNetUnfolder]: For 19921/19921 co-relation queries the response was YES. [2022-12-06 00:07:17,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14089 conditions, 1509 events. 802/1509 cut-off events. For 19921/19921 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 8746 event pairs, 18 based on Foata normal form. 52/1561 useless extension candidates. Maximal degree in co-relation 13225. Up to 811 conditions per place. [2022-12-06 00:07:17,454 INFO L137 encePairwiseOnDemand]: 17/38 looper letters, 131 selfloop transitions, 130 changer transitions 21/282 dead transitions. [2022-12-06 00:07:17,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 282 transitions, 6414 flow [2022-12-06 00:07:17,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:07:17,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:07:17,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions. [2022-12-06 00:07:17,455 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40131578947368424 [2022-12-06 00:07:17,455 INFO L175 Difference]: Start difference. First operand has 108 places, 227 transitions, 4996 flow. Second operand 8 states and 122 transitions. [2022-12-06 00:07:17,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 282 transitions, 6414 flow [2022-12-06 00:07:17,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 282 transitions, 6061 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-06 00:07:17,567 INFO L231 Difference]: Finished difference. Result has 111 places, 227 transitions, 5011 flow [2022-12-06 00:07:17,567 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=4619, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5011, PETRI_PLACES=111, PETRI_TRANSITIONS=227} [2022-12-06 00:07:17,567 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 72 predicate places. [2022-12-06 00:07:17,568 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:17,568 INFO L89 Accepts]: Start accepts. Operand has 111 places, 227 transitions, 5011 flow [2022-12-06 00:07:17,572 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:17,572 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:17,573 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 227 transitions, 5011 flow [2022-12-06 00:07:17,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 227 transitions, 5011 flow [2022-12-06 00:07:17,646 INFO L130 PetriNetUnfolder]: 161/478 cut-off events. [2022-12-06 00:07:17,647 INFO L131 PetriNetUnfolder]: For 6887/6937 co-relation queries the response was YES. [2022-12-06 00:07:17,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4550 conditions, 478 events. 161/478 cut-off events. For 6887/6937 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3021 event pairs, 7 based on Foata normal form. 3/480 useless extension candidates. Maximal degree in co-relation 4430. Up to 207 conditions per place. [2022-12-06 00:07:17,653 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 227 transitions, 5011 flow [2022-12-06 00:07:17,653 INFO L188 LiptonReduction]: Number of co-enabled transitions 720 [2022-12-06 00:07:17,654 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:17,654 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 00:07:17,655 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 227 transitions, 5011 flow [2022-12-06 00:07:17,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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 00:07:17,655 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:17,655 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:17,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 00:07:17,655 INFO L420 AbstractCegarLoop]: === Iteration 23 === 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 00:07:17,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:17,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1848490192, now seen corresponding path program 1 times [2022-12-06 00:07:17,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:17,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254335703] [2022-12-06 00:07:17,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:17,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:17,807 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 00:07:17,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:17,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254335703] [2022-12-06 00:07:17,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254335703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:17,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:17,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:07:17,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651990452] [2022-12-06 00:07:17,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:17,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:07:17,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:17,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:07:17,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:07:17,809 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 00:07:17,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 227 transitions, 5011 flow. Second operand has 8 states, 8 states have (on average 3.0) 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 00:07:17,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:17,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 00:07:17,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:18,286 INFO L130 PetriNetUnfolder]: 718/1377 cut-off events. [2022-12-06 00:07:18,286 INFO L131 PetriNetUnfolder]: For 16799/16799 co-relation queries the response was YES. [2022-12-06 00:07:18,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12208 conditions, 1377 events. 718/1377 cut-off events. For 16799/16799 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 7916 event pairs, 17 based on Foata normal form. 14/1391 useless extension candidates. Maximal degree in co-relation 11368. Up to 513 conditions per place. [2022-12-06 00:07:18,298 INFO L137 encePairwiseOnDemand]: 21/37 looper letters, 72 selfloop transitions, 190 changer transitions 6/268 dead transitions. [2022-12-06 00:07:18,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 268 transitions, 5820 flow [2022-12-06 00:07:18,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:07:18,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:07:18,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2022-12-06 00:07:18,300 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3663663663663664 [2022-12-06 00:07:18,300 INFO L175 Difference]: Start difference. First operand has 111 places, 227 transitions, 5011 flow. Second operand 9 states and 122 transitions. [2022-12-06 00:07:18,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 268 transitions, 5820 flow [2022-12-06 00:07:18,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 268 transitions, 5772 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 00:07:18,393 INFO L231 Difference]: Finished difference. Result has 117 places, 225 transitions, 5299 flow [2022-12-06 00:07:18,393 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4945, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5299, PETRI_PLACES=117, PETRI_TRANSITIONS=225} [2022-12-06 00:07:18,394 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 78 predicate places. [2022-12-06 00:07:18,394 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:18,394 INFO L89 Accepts]: Start accepts. Operand has 117 places, 225 transitions, 5299 flow [2022-12-06 00:07:18,397 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:18,397 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:18,398 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 225 transitions, 5299 flow [2022-12-06 00:07:18,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 225 transitions, 5299 flow [2022-12-06 00:07:18,455 INFO L130 PetriNetUnfolder]: 156/476 cut-off events. [2022-12-06 00:07:18,456 INFO L131 PetriNetUnfolder]: For 7484/7536 co-relation queries the response was YES. [2022-12-06 00:07:18,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4795 conditions, 476 events. 156/476 cut-off events. For 7484/7536 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3043 event pairs, 7 based on Foata normal form. 1/476 useless extension candidates. Maximal degree in co-relation 4675. Up to 205 conditions per place. [2022-12-06 00:07:18,460 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 225 transitions, 5299 flow [2022-12-06 00:07:18,460 INFO L188 LiptonReduction]: Number of co-enabled transitions 712 [2022-12-06 00:07:18,461 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:18,461 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-06 00:07:18,461 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 225 transitions, 5299 flow [2022-12-06 00:07:18,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) 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 00:07:18,462 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:18,462 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:18,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 00:07:18,462 INFO L420 AbstractCegarLoop]: === Iteration 24 === 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 00:07:18,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:18,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1256762124, now seen corresponding path program 2 times [2022-12-06 00:07:18,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:18,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474694065] [2022-12-06 00:07:18,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:18,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:18,605 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 00:07:18,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:18,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474694065] [2022-12-06 00:07:18,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474694065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:18,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:18,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:07:18,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490919858] [2022-12-06 00:07:18,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:18,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:07:18,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:18,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:07:18,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:07:18,607 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 00:07:18,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 225 transitions, 5299 flow. Second operand has 8 states, 8 states have (on average 3.0) 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 00:07:18,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:18,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 00:07:18,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:19,064 INFO L130 PetriNetUnfolder]: 699/1358 cut-off events. [2022-12-06 00:07:19,065 INFO L131 PetriNetUnfolder]: For 18150/18150 co-relation queries the response was YES. [2022-12-06 00:07:19,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12645 conditions, 1358 events. 699/1358 cut-off events. For 18150/18150 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 7939 event pairs, 13 based on Foata normal form. 22/1380 useless extension candidates. Maximal degree in co-relation 11835. Up to 475 conditions per place. [2022-12-06 00:07:19,076 INFO L137 encePairwiseOnDemand]: 18/37 looper letters, 69 selfloop transitions, 172 changer transitions 26/267 dead transitions. [2022-12-06 00:07:19,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 267 transitions, 6041 flow [2022-12-06 00:07:19,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:07:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:07:19,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 129 transitions. [2022-12-06 00:07:19,078 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38738738738738737 [2022-12-06 00:07:19,078 INFO L175 Difference]: Start difference. First operand has 117 places, 225 transitions, 5299 flow. Second operand 9 states and 129 transitions. [2022-12-06 00:07:19,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 267 transitions, 6041 flow [2022-12-06 00:07:19,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 267 transitions, 5449 flow, removed 8 selfloop flow, removed 10 redundant places. [2022-12-06 00:07:19,180 INFO L231 Difference]: Finished difference. Result has 115 places, 200 transitions, 4548 flow [2022-12-06 00:07:19,180 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4585, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4548, PETRI_PLACES=115, PETRI_TRANSITIONS=200} [2022-12-06 00:07:19,180 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 76 predicate places. [2022-12-06 00:07:19,180 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:19,181 INFO L89 Accepts]: Start accepts. Operand has 115 places, 200 transitions, 4548 flow [2022-12-06 00:07:19,182 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:19,182 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:19,182 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 200 transitions, 4548 flow [2022-12-06 00:07:19,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 200 transitions, 4548 flow [2022-12-06 00:07:19,235 INFO L130 PetriNetUnfolder]: 129/385 cut-off events. [2022-12-06 00:07:19,236 INFO L131 PetriNetUnfolder]: For 6243/6345 co-relation queries the response was YES. [2022-12-06 00:07:19,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3569 conditions, 385 events. 129/385 cut-off events. For 6243/6345 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2223 event pairs, 7 based on Foata normal form. 6/389 useless extension candidates. Maximal degree in co-relation 3459. Up to 164 conditions per place. [2022-12-06 00:07:19,240 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 200 transitions, 4548 flow [2022-12-06 00:07:19,240 INFO L188 LiptonReduction]: Number of co-enabled transitions 610 [2022-12-06 00:07:19,241 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:19,242 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-06 00:07:19,242 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 200 transitions, 4548 flow [2022-12-06 00:07:19,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) 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 00:07:19,242 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:19,242 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:19,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 00:07:19,243 INFO L420 AbstractCegarLoop]: === Iteration 25 === 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 00:07:19,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:19,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1947290938, now seen corresponding path program 1 times [2022-12-06 00:07:19,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:19,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661381546] [2022-12-06 00:07:19,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:19,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:19,434 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 00:07:19,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:19,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661381546] [2022-12-06 00:07:19,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661381546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:19,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:19,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:07:19,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60058771] [2022-12-06 00:07:19,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:19,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:07:19,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:19,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:07:19,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:07:19,436 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 00:07:19,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 200 transitions, 4548 flow. Second operand has 8 states, 8 states have (on average 3.0) 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 00:07:19,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:19,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 00:07:19,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:19,880 INFO L130 PetriNetUnfolder]: 562/1065 cut-off events. [2022-12-06 00:07:19,880 INFO L131 PetriNetUnfolder]: For 14289/14289 co-relation queries the response was YES. [2022-12-06 00:07:19,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9438 conditions, 1065 events. 562/1065 cut-off events. For 14289/14289 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5598 event pairs, 22 based on Foata normal form. 2/1067 useless extension candidates. Maximal degree in co-relation 6352. Up to 841 conditions per place. [2022-12-06 00:07:19,900 INFO L137 encePairwiseOnDemand]: 20/36 looper letters, 154 selfloop transitions, 64 changer transitions 9/227 dead transitions. [2022-12-06 00:07:19,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 227 transitions, 5145 flow [2022-12-06 00:07:19,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 00:07:19,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 00:07:19,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 99 transitions. [2022-12-06 00:07:19,901 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.275 [2022-12-06 00:07:19,901 INFO L175 Difference]: Start difference. First operand has 115 places, 200 transitions, 4548 flow. Second operand 10 states and 99 transitions. [2022-12-06 00:07:19,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 227 transitions, 5145 flow [2022-12-06 00:07:20,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 227 transitions, 4566 flow, removed 0 selfloop flow, removed 13 redundant places. [2022-12-06 00:07:20,023 INFO L231 Difference]: Finished difference. Result has 112 places, 193 transitions, 3956 flow [2022-12-06 00:07:20,024 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3969, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3956, PETRI_PLACES=112, PETRI_TRANSITIONS=193} [2022-12-06 00:07:20,024 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 73 predicate places. [2022-12-06 00:07:20,024 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:20,024 INFO L89 Accepts]: Start accepts. Operand has 112 places, 193 transitions, 3956 flow [2022-12-06 00:07:20,027 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:20,027 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:20,027 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 193 transitions, 3956 flow [2022-12-06 00:07:20,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 193 transitions, 3956 flow [2022-12-06 00:07:20,120 INFO L130 PetriNetUnfolder]: 126/378 cut-off events. [2022-12-06 00:07:20,120 INFO L131 PetriNetUnfolder]: For 6077/6104 co-relation queries the response was YES. [2022-12-06 00:07:20,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3077 conditions, 378 events. 126/378 cut-off events. For 6077/6104 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2166 event pairs, 7 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 2972. Up to 162 conditions per place. [2022-12-06 00:07:20,124 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 193 transitions, 3956 flow [2022-12-06 00:07:20,124 INFO L188 LiptonReduction]: Number of co-enabled transitions 596 [2022-12-06 00:07:20,151 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] $Ultimate##0-->L45: Formula: (and (= (+ v_~t~0_51 1) v_~t~0_50) (= v_~m1~0_9 v_~t~0_51)) InVars {~t~0=v_~t~0_51} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_50} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~t~0] and [478] L67-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| 0)) (= v_~b~0_159 (ite (= (ite (or (= v_~x~0_98 1) (not (= (mod v_~b~0_160 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= (ite (<= v_~m2~0_57 v_~s~0_341) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~s~0_341 1) v_~s~0_340)) InVars {~b~0=v_~b~0_160, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_98, ~s~0=v_~s~0_341} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~b~0=v_~b~0_159, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|, ~x~0=v_~x~0_98, ~s~0=v_~s~0_340} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-06 00:07:20,216 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] $Ultimate##0-->L45: Formula: (and (= (+ v_~t~0_51 1) v_~t~0_50) (= v_~m1~0_9 v_~t~0_51)) InVars {~t~0=v_~t~0_51} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_50} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~t~0] and [537] $Ultimate##0-->thread2EXIT: Formula: (and (= (+ v_~s~0_535 1) v_~s~0_534) (= v_~t~0_228 v_~m3~0_119) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_59| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_59| 0)) (= (ite (<= v_~m2~0_106 v_~s~0_535) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_31|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_31| 0) (= v_~t~0_227 (+ v_~t~0_228 1)) (= v_~b~0_327 (ite (= (ite (or (= v_~x~0_210 1) (not (= (mod v_~b~0_328 256) 0))) 1 0) 0) 0 1))) InVars {~b~0=v_~b~0_328, ~m2~0=v_~m2~0_106, ~x~0=v_~x~0_210, ~s~0=v_~s~0_535, ~t~0=v_~t~0_228} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_59|, ~m3~0=v_~m3~0_119, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_31|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~b~0=v_~b~0_327, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_31|, ~m2~0=v_~m2~0_106, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|, ~x~0=v_~x~0_210, ~s~0=v_~s~0_534, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_45|, ~t~0=v_~t~0_227} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~m3~0, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~s~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] [2022-12-06 00:07:20,293 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] $Ultimate##0-->L45: Formula: (and (= (+ v_~t~0_51 1) v_~t~0_50) (= v_~m1~0_9 v_~t~0_51)) InVars {~t~0=v_~t~0_51} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_50} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~t~0] and [478] L67-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| 0)) (= v_~b~0_159 (ite (= (ite (or (= v_~x~0_98 1) (not (= (mod v_~b~0_160 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= (ite (<= v_~m2~0_57 v_~s~0_341) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~s~0_341 1) v_~s~0_340)) InVars {~b~0=v_~b~0_160, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_98, ~s~0=v_~s~0_341} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~b~0=v_~b~0_159, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|, ~x~0=v_~x~0_98, ~s~0=v_~s~0_340} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-06 00:07:20,380 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [530] $Ultimate##0-->L67: Formula: (and (= v_~t~0_197 (+ v_~m2~0_98 1)) (= v_~t~0_199 v_~m3~0_105) (= v_~m2~0_98 (+ v_~t~0_199 1))) InVars {~t~0=v_~t~0_199} OutVars{~m3~0=v_~m3~0_105, ~m2~0=v_~m2~0_98, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_14|, ~t~0=v_~t~0_197, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_31|} AuxVars[] AssignedVars[~m3~0, ~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [469] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_317 1) v_~s~0_316) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_37| 0) (= v_~b~0_139 (ite (= (ite (or (not (= 0 (mod v_~b~0_140 256))) (= v_~x~0_89 1)) 1 0) 0) 0 1)) (= (ite (<= v_~m4~0_31 v_~s~0_317) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= |v_thread4Thread1of1ForFork0_#res#1.base_37| 0)) InVars {~b~0=v_~b~0_140, ~m4~0=v_~m4~0_31, ~x~0=v_~x~0_89, ~s~0=v_~s~0_317} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_37|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_41|, ~b~0=v_~b~0_139, ~m4~0=v_~m4~0_31, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_37|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, ~x~0=v_~x~0_89, ~s~0=v_~s~0_316} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:20,510 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] $Ultimate##0-->L45: Formula: (and (= (+ v_~t~0_51 1) v_~t~0_50) (= v_~m1~0_9 v_~t~0_51)) InVars {~t~0=v_~t~0_51} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_50} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~t~0] and [556] $Ultimate##0-->thread4EXIT: Formula: (and (= (+ v_~s~0_601 1) v_~s~0_600) (= |v_thread4Thread1of1ForFork0_#res#1.base_65| 0) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= (ite (<= v_~m4~0_108 v_~s~0_601) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45|) (= |v_thread4Thread1of1ForFork0_#res#1.offset_65| 0) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_45| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45|) (= (ite (= (ite (or (not (= (mod v_~b~0_394 256) 0)) (= v_~x~0_240 1)) 1 0) 0) 0 1) v_~b~0_393) (= (+ v_~t~0_322 1) v_~m2~0_140) (= v_~t~0_322 v_~m3~0_147) (= v_~t~0_321 (+ v_~m2~0_140 1))) InVars {~b~0=v_~b~0_394, ~m4~0=v_~m4~0_108, ~x~0=v_~x~0_240, ~s~0=v_~s~0_601, ~t~0=v_~t~0_322} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_65|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_38|, ~m3~0=v_~m3~0_147, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_69|, ~b~0=v_~b~0_393, ~m4~0=v_~m4~0_108, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45|, ~m2~0=v_~m2~0_140, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_65|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_45|, ~x~0=v_~x~0_240, ~s~0=v_~s~0_600, ~t~0=v_~t~0_321, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_73|} AuxVars[] AssignedVars[~m3~0, thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~m2~0, thread4Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_#t~post3#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] [2022-12-06 00:07:20,580 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] $Ultimate##0-->L45: Formula: (and (= (+ v_~t~0_51 1) v_~t~0_50) (= v_~m1~0_9 v_~t~0_51)) InVars {~t~0=v_~t~0_51} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_50} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~t~0] and [557] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_89| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_89|) (= (+ v_~s~0_605 1) v_~s~0_604) (= v_~t~0_326 v_~m3~0_149) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_61|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_89| 0)) (= v_~t~0_325 (+ v_~m2~0_142 1)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_61| 0) (= v_~m2~0_142 (+ v_~t~0_326 1)) (= (ite (<= v_~m2~0_142 v_~s~0_605) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_89|) (= (ite (= 0 (ite (or (= v_~x~0_242 1) (not (= (mod v_~b~0_398 256) 0))) 1 0)) 0 1) v_~b~0_397)) InVars {~b~0=v_~b~0_398, ~x~0=v_~x~0_242, ~s~0=v_~s~0_605, ~t~0=v_~t~0_326} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_91|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_61|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_89|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_40|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_89|, ~m3~0=v_~m3~0_149, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_61|, ~b~0=v_~b~0_397, ~m2~0=v_~m2~0_142, ~x~0=v_~x~0_242, ~s~0=v_~s~0_604, ~t~0=v_~t~0_325, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_75|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~m3~0, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, ~m2~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, ~s~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] [2022-12-06 00:07:20,664 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] $Ultimate##0-->L105: Formula: (and (= v_~t~0_231 (+ v_~m4~0_90 1)) (= v_~t~0_233 v_~m3~0_121) (= v_~m4~0_90 (+ v_~t~0_233 1))) InVars {~t~0=v_~t~0_233} OutVars{~m3~0=v_~m3~0_121, ~m4~0=v_~m4~0_90, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_14|, ~t~0=v_~t~0_231, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_47|} AuxVars[] AssignedVars[~m3~0, ~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [555] $Ultimate##0-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_138 v_~s~0_597) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_87|) (= v_~t~0_318 v_~m1~0_139) (= (+ v_~t~0_318 1) v_~t~0_317) (= (+ v_~s~0_597 1) v_~s~0_596) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_59|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_87| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_87|) (= v_~b~0_389 (ite (= (ite (or (= v_~x~0_238 1) (not (= (mod v_~b~0_390 256) 0))) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_87| 0)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_59| 0)) InVars {~b~0=v_~b~0_390, ~m2~0=v_~m2~0_138, ~x~0=v_~x~0_238, ~s~0=v_~s~0_597, ~t~0=v_~t~0_318} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_87|, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_43|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_59|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_89|, ~b~0=v_~b~0_389, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_59|, ~m2~0=v_~m2~0_138, ~m1~0=v_~m1~0_139, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_87|, ~x~0=v_~x~0_238, ~s~0=v_~s~0_596, ~t~0=v_~t~0_317} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~post1#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, ~m1~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~s~0, ~t~0] [2022-12-06 00:07:20,748 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [383] $Ultimate##0-->L67: Formula: (and (= v_~t~0_46 (+ v_~t~0_47 1)) (= v_~m2~0_11 v_~t~0_47)) InVars {~t~0=v_~t~0_47} OutVars{thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_46} AuxVars[] AssignedVars[~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0] and [560] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_93| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_65|) (= (+ v_~s~0_617 1) v_~s~0_616) (= |v_thread2Thread1of1ForFork1_#res#1.offset_65| 0) (= v_~t~0_343 v_~m3~0_155) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93| (ite (<= v_~m2~0_148 v_~s~0_617) 1 0)) (= (+ v_~m4~0_112 1) v_~m1~0_145) (= v_~b~0_409 (ite (= (ite (or (= v_~x~0_248 1) (not (= (mod v_~b~0_410 256) 0))) 1 0) 0) 0 1)) (= v_~m4~0_112 (+ v_~t~0_343 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_93| 0)) (= v_~t~0_341 (+ 1 v_~m1~0_145))) InVars {~b~0=v_~b~0_410, ~m2~0=v_~m2~0_148, ~x~0=v_~x~0_248, ~s~0=v_~s~0_617, ~t~0=v_~t~0_343} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_95|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_32|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_65|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_93|, ~m3~0=v_~m3~0_155, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_49|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_65|, ~b~0=v_~b~0_409, ~m4~0=v_~m4~0_112, ~m2~0=v_~m2~0_148, ~m1~0=v_~m1~0_145, ~x~0=v_~x~0_248, ~s~0=v_~s~0_616, ~t~0=v_~t~0_341, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_81|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread4Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~m3~0, thread1Thread1of1ForFork3_#t~post1#1, thread2Thread1of1ForFork1_#res#1.base, ~b~0, ~m4~0, ~m1~0, ~s~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] [2022-12-06 00:07:20,830 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 00:07:20,831 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 807 [2022-12-06 00:07:20,831 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 193 transitions, 3994 flow [2022-12-06 00:07:20,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) 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 00:07:20,831 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:20,831 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:20,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 00:07:20,832 INFO L420 AbstractCegarLoop]: === Iteration 26 === 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 00:07:20,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:20,832 INFO L85 PathProgramCache]: Analyzing trace with hash 2034178397, now seen corresponding path program 1 times [2022-12-06 00:07:20,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:20,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386795322] [2022-12-06 00:07:20,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:20,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:21,006 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 00:07:21,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:21,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386795322] [2022-12-06 00:07:21,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386795322] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:21,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:21,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:07:21,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840663771] [2022-12-06 00:07:21,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:21,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:07:21,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:21,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:07:21,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:07:21,009 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 00:07:21,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 193 transitions, 3994 flow. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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 00:07:21,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:21,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 00:07:21,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:21,251 INFO L130 PetriNetUnfolder]: 553/1050 cut-off events. [2022-12-06 00:07:21,251 INFO L131 PetriNetUnfolder]: For 14061/14061 co-relation queries the response was YES. [2022-12-06 00:07:21,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8411 conditions, 1050 events. 553/1050 cut-off events. For 14061/14061 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5497 event pairs, 34 based on Foata normal form. 4/1054 useless extension candidates. Maximal degree in co-relation 6615. Up to 1013 conditions per place. [2022-12-06 00:07:21,256 INFO L137 encePairwiseOnDemand]: 28/39 looper letters, 192 selfloop transitions, 7 changer transitions 9/208 dead transitions. [2022-12-06 00:07:21,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 208 transitions, 4516 flow [2022-12-06 00:07:21,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:07:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:07:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-12-06 00:07:21,258 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19230769230769232 [2022-12-06 00:07:21,258 INFO L175 Difference]: Start difference. First operand has 110 places, 193 transitions, 3994 flow. Second operand 8 states and 60 transitions. [2022-12-06 00:07:21,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 208 transitions, 4516 flow [2022-12-06 00:07:21,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 208 transitions, 4325 flow, removed 48 selfloop flow, removed 4 redundant places. [2022-12-06 00:07:21,300 INFO L231 Difference]: Finished difference. Result has 116 places, 190 transitions, 3749 flow [2022-12-06 00:07:21,300 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=3806, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3749, PETRI_PLACES=116, PETRI_TRANSITIONS=190} [2022-12-06 00:07:21,301 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 77 predicate places. [2022-12-06 00:07:21,301 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:21,301 INFO L89 Accepts]: Start accepts. Operand has 116 places, 190 transitions, 3749 flow [2022-12-06 00:07:21,302 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:21,302 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:21,302 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 190 transitions, 3749 flow [2022-12-06 00:07:21,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 190 transitions, 3749 flow [2022-12-06 00:07:21,336 INFO L130 PetriNetUnfolder]: 125/373 cut-off events. [2022-12-06 00:07:21,336 INFO L131 PetriNetUnfolder]: For 5431/5449 co-relation queries the response was YES. [2022-12-06 00:07:21,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2912 conditions, 373 events. 125/373 cut-off events. For 5431/5449 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2115 event pairs, 7 based on Foata normal form. 0/373 useless extension candidates. Maximal degree in co-relation 2874. Up to 161 conditions per place. [2022-12-06 00:07:21,339 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 190 transitions, 3749 flow [2022-12-06 00:07:21,339 INFO L188 LiptonReduction]: Number of co-enabled transitions 590 [2022-12-06 00:07:21,345 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] $Ultimate##0-->L105: Formula: (and (= (+ v_~t~0_55 1) v_~t~0_54) (= v_~m4~0_7 v_~t~0_55)) InVars {~t~0=v_~t~0_55} OutVars{~m4~0=v_~m4~0_7, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_1|, ~t~0=v_~t~0_54} AuxVars[] AssignedVars[~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~t~0] and [553] $Ultimate##0-->thread2EXIT: Formula: (and (= v_~t~0_308 v_~m1~0_135) (= (+ v_~s~0_589 1) v_~s~0_588) (= (ite (<= v_~m2~0_134 v_~s~0_589) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_83|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_83| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_83| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_83|) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_55|) (= v_~b~0_381 (ite (= (ite (or (= v_~x~0_234 1) (not (= (mod v_~b~0_382 256) 0))) 1 0) 0) 0 1)) (= v_~t~0_307 (+ v_~t~0_308 1)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_55| 0)) InVars {~b~0=v_~b~0_382, ~m2~0=v_~m2~0_134, ~x~0=v_~x~0_234, ~s~0=v_~s~0_589, ~t~0=v_~t~0_308} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_83|, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_39|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_55|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_85|, ~b~0=v_~b~0_381, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_55|, ~m2~0=v_~m2~0_134, ~m1~0=v_~m1~0_135, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_83|, ~x~0=v_~x~0_234, ~s~0=v_~s~0_588, ~t~0=v_~t~0_307} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~post1#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, ~m1~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~s~0, ~t~0] [2022-12-06 00:07:21,438 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [383] $Ultimate##0-->L67: Formula: (and (= v_~t~0_46 (+ v_~t~0_47 1)) (= v_~m2~0_11 v_~t~0_47)) InVars {~t~0=v_~t~0_47} OutVars{thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_46} AuxVars[] AssignedVars[~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0] and [562] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_69| 0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97| 0)) (= (+ v_~s~0_625 1) v_~s~0_624) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_69|) (= v_~t~0_355 v_~m4~0_116) (= (ite (<= v_~m2~0_152 v_~s~0_625) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= v_~t~0_353 (+ 1 v_~m1~0_149)) (= v_~b~0_417 (ite (= (ite (or (= v_~x~0_252 1) (not (= (mod v_~b~0_418 256) 0))) 1 0) 0) 0 1)) (= v_~t~0_353 (+ v_~t~0_355 2))) InVars {~b~0=v_~b~0_418, ~m2~0=v_~m2~0_152, ~x~0=v_~x~0_252, ~s~0=v_~s~0_625, ~t~0=v_~t~0_355} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_99|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_36|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_69|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97|, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_53|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_69|, ~b~0=v_~b~0_417, ~m4~0=v_~m4~0_116, ~m2~0=v_~m2~0_152, ~m1~0=v_~m1~0_149, ~x~0=v_~x~0_252, ~s~0=v_~s~0_624, ~t~0=v_~t~0_353} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~post1#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, ~b~0, thread4Thread1of1ForFork0_#t~post7#1, ~m4~0, thread2Thread1of1ForFork1_#res#1.offset, ~m1~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~s~0, ~t~0] [2022-12-06 00:07:21,518 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:07:21,518 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-06 00:07:21,518 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 188 transitions, 3689 flow [2022-12-06 00:07:21,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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 00:07:21,518 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:21,518 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:21,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 00:07:21,519 INFO L420 AbstractCegarLoop]: === Iteration 27 === 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 00:07:21,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:21,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1659521228, now seen corresponding path program 1 times [2022-12-06 00:07:21,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:21,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953000357] [2022-12-06 00:07:21,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:21,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:21,650 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 00:07:21,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:21,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953000357] [2022-12-06 00:07:21,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953000357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:21,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:21,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:21,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591545623] [2022-12-06 00:07:21,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:21,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:07:21,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:21,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:07:21,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:07:21,652 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 00:07:21,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 188 transitions, 3689 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 00:07:21,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:21,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 00:07:21,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:21,855 INFO L130 PetriNetUnfolder]: 545/1030 cut-off events. [2022-12-06 00:07:21,855 INFO L131 PetriNetUnfolder]: For 12857/12857 co-relation queries the response was YES. [2022-12-06 00:07:21,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7901 conditions, 1030 events. 545/1030 cut-off events. For 12857/12857 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5400 event pairs, 34 based on Foata normal form. 2/1032 useless extension candidates. Maximal degree in co-relation 7848. Up to 1010 conditions per place. [2022-12-06 00:07:21,861 INFO L137 encePairwiseOnDemand]: 29/37 looper letters, 188 selfloop transitions, 6 changer transitions 3/197 dead transitions. [2022-12-06 00:07:21,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 197 transitions, 4170 flow [2022-12-06 00:07:21,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:21,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:21,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-06 00:07:21,864 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2594594594594595 [2022-12-06 00:07:21,864 INFO L175 Difference]: Start difference. First operand has 106 places, 188 transitions, 3689 flow. Second operand 5 states and 48 transitions. [2022-12-06 00:07:21,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 197 transitions, 4170 flow [2022-12-06 00:07:21,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 197 transitions, 4106 flow, removed 27 selfloop flow, removed 6 redundant places. [2022-12-06 00:07:21,906 INFO L231 Difference]: Finished difference. Result has 106 places, 189 transitions, 3668 flow [2022-12-06 00:07:21,906 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3625, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3668, PETRI_PLACES=106, PETRI_TRANSITIONS=189} [2022-12-06 00:07:21,907 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 67 predicate places. [2022-12-06 00:07:21,907 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:21,907 INFO L89 Accepts]: Start accepts. Operand has 106 places, 189 transitions, 3668 flow [2022-12-06 00:07:21,908 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:21,908 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:21,908 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 189 transitions, 3668 flow [2022-12-06 00:07:21,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 189 transitions, 3668 flow [2022-12-06 00:07:21,956 INFO L130 PetriNetUnfolder]: 125/373 cut-off events. [2022-12-06 00:07:21,956 INFO L131 PetriNetUnfolder]: For 5312/5360 co-relation queries the response was YES. [2022-12-06 00:07:21,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2848 conditions, 373 events. 125/373 cut-off events. For 5312/5360 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2145 event pairs, 7 based on Foata normal form. 6/378 useless extension candidates. Maximal degree in co-relation 2816. Up to 162 conditions per place. [2022-12-06 00:07:21,960 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 189 transitions, 3668 flow [2022-12-06 00:07:21,960 INFO L188 LiptonReduction]: Number of co-enabled transitions 580 [2022-12-06 00:07:21,961 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [563] $Ultimate##0-->thread2EXIT: Formula: (and (= (+ v_~t~0_361 1) v_~m4~0_118) (= v_~t~0_361 v_~m2~0_154) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_71|) (= v_~t~0_359 (+ 1 v_~m1~0_151)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_71| 0) (= (ite (= (ite (or (not (= (mod v_~b~0_422 256) 0)) (= v_~x~0_254 1)) 1 0) 0) 0 1) v_~b~0_421) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_99| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_99|) (= v_~t~0_359 (+ v_~t~0_361 3)) (= (ite (<= v_~m2~0_154 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_99|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_99| 0))) InVars {~b~0=v_~b~0_422, ~x~0=v_~x~0_254, ~s~0=v_~s~0_629, ~t~0=v_~t~0_361} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_101|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_38|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_71|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_99|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_48|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_99|, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_55|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_71|, ~b~0=v_~b~0_421, ~m4~0=v_~m4~0_118, ~m2~0=v_~m2~0_154, ~m1~0=v_~m1~0_151, ~x~0=v_~x~0_254, ~s~0=v_~s~0_628, ~t~0=v_~t~0_359} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread4Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~post1#1, thread2Thread1of1ForFork1_#res#1.base, ~b~0, ~m4~0, ~m2~0, ~m1~0, ~s~0, ~t~0] and [469] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_317 1) v_~s~0_316) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_37| 0) (= v_~b~0_139 (ite (= (ite (or (not (= 0 (mod v_~b~0_140 256))) (= v_~x~0_89 1)) 1 0) 0) 0 1)) (= (ite (<= v_~m4~0_31 v_~s~0_317) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= |v_thread4Thread1of1ForFork0_#res#1.base_37| 0)) InVars {~b~0=v_~b~0_140, ~m4~0=v_~m4~0_31, ~x~0=v_~x~0_89, ~s~0=v_~s~0_317} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_37|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_41|, ~b~0=v_~b~0_139, ~m4~0=v_~m4~0_31, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_37|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, ~x~0=v_~x~0_89, ~s~0=v_~s~0_316} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:22,171 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:22,171 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 264 [2022-12-06 00:07:22,171 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 189 transitions, 3676 flow [2022-12-06 00:07:22,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 00:07:22,172 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:22,172 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:22,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 00:07:22,172 INFO L420 AbstractCegarLoop]: === Iteration 28 === 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 00:07:22,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:22,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1200532855, now seen corresponding path program 1 times [2022-12-06 00:07:22,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:22,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679320341] [2022-12-06 00:07:22,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:22,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:22,313 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 00:07:22,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:22,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679320341] [2022-12-06 00:07:22,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679320341] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:22,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:22,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:22,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423228193] [2022-12-06 00:07:22,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:22,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:22,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:22,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:22,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:22,315 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 00:07:22,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 189 transitions, 3676 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 00:07:22,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:22,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 00:07:22,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:22,504 INFO L130 PetriNetUnfolder]: 542/1025 cut-off events. [2022-12-06 00:07:22,504 INFO L131 PetriNetUnfolder]: For 12614/12614 co-relation queries the response was YES. [2022-12-06 00:07:22,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7753 conditions, 1025 events. 542/1025 cut-off events. For 12614/12614 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5379 event pairs, 34 based on Foata normal form. 4/1029 useless extension candidates. Maximal degree in co-relation 7710. Up to 1008 conditions per place. [2022-12-06 00:07:22,510 INFO L137 encePairwiseOnDemand]: 29/37 looper letters, 186 selfloop transitions, 4 changer transitions 6/196 dead transitions. [2022-12-06 00:07:22,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 196 transitions, 4102 flow [2022-12-06 00:07:22,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:07:22,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:07:22,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-12-06 00:07:22,510 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22072072072072071 [2022-12-06 00:07:22,510 INFO L175 Difference]: Start difference. First operand has 105 places, 189 transitions, 3676 flow. Second operand 6 states and 49 transitions. [2022-12-06 00:07:22,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 196 transitions, 4102 flow [2022-12-06 00:07:22,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 196 transitions, 4070 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:22,547 INFO L231 Difference]: Finished difference. Result has 109 places, 187 transitions, 3612 flow [2022-12-06 00:07:22,547 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3644, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3612, PETRI_PLACES=109, PETRI_TRANSITIONS=187} [2022-12-06 00:07:22,548 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 70 predicate places. [2022-12-06 00:07:22,548 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:22,548 INFO L89 Accepts]: Start accepts. Operand has 109 places, 187 transitions, 3612 flow [2022-12-06 00:07:22,549 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:22,549 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:22,549 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 187 transitions, 3612 flow [2022-12-06 00:07:22,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 187 transitions, 3612 flow [2022-12-06 00:07:22,583 INFO L130 PetriNetUnfolder]: 124/370 cut-off events. [2022-12-06 00:07:22,583 INFO L131 PetriNetUnfolder]: For 5280/5322 co-relation queries the response was YES. [2022-12-06 00:07:22,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2809 conditions, 370 events. 124/370 cut-off events. For 5280/5322 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2131 event pairs, 7 based on Foata normal form. 6/375 useless extension candidates. Maximal degree in co-relation 2742. Up to 160 conditions per place. [2022-12-06 00:07:22,586 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 187 transitions, 3612 flow [2022-12-06 00:07:22,586 INFO L188 LiptonReduction]: Number of co-enabled transitions 576 [2022-12-06 00:07:22,587 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:22,588 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 00:07:22,588 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 187 transitions, 3612 flow [2022-12-06 00:07:22,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 00:07:22,588 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:22,588 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:22,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 00:07:22,588 INFO L420 AbstractCegarLoop]: === Iteration 29 === 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 00:07:22,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:22,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1560708329, now seen corresponding path program 1 times [2022-12-06 00:07:22,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:22,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576929285] [2022-12-06 00:07:22,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:22,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:22,717 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 00:07:22,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:22,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576929285] [2022-12-06 00:07:22,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576929285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:22,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:22,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:22,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658957250] [2022-12-06 00:07:22,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:22,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:07:22,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:22,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:07:22,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:07:22,720 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 00:07:22,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 187 transitions, 3612 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 00:07:22,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:22,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 00:07:22,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:22,956 INFO L130 PetriNetUnfolder]: 534/1013 cut-off events. [2022-12-06 00:07:22,957 INFO L131 PetriNetUnfolder]: For 12074/12074 co-relation queries the response was YES. [2022-12-06 00:07:22,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7604 conditions, 1013 events. 534/1013 cut-off events. For 12074/12074 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5284 event pairs, 28 based on Foata normal form. 4/1017 useless extension candidates. Maximal degree in co-relation 7470. Up to 878 conditions per place. [2022-12-06 00:07:22,962 INFO L137 encePairwiseOnDemand]: 22/36 looper letters, 152 selfloop transitions, 41 changer transitions 2/195 dead transitions. [2022-12-06 00:07:22,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 195 transitions, 4017 flow [2022-12-06 00:07:22,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:22,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:22,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-12-06 00:07:22,963 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3388888888888889 [2022-12-06 00:07:22,963 INFO L175 Difference]: Start difference. First operand has 105 places, 187 transitions, 3612 flow. Second operand 5 states and 61 transitions. [2022-12-06 00:07:22,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 195 transitions, 4017 flow [2022-12-06 00:07:22,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 195 transitions, 3999 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-12-06 00:07:22,999 INFO L231 Difference]: Finished difference. Result has 106 places, 183 transitions, 3649 flow [2022-12-06 00:07:22,999 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3535, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3649, PETRI_PLACES=106, PETRI_TRANSITIONS=183} [2022-12-06 00:07:23,000 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 67 predicate places. [2022-12-06 00:07:23,000 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:23,000 INFO L89 Accepts]: Start accepts. Operand has 106 places, 183 transitions, 3649 flow [2022-12-06 00:07:23,001 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:23,001 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:23,001 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 183 transitions, 3649 flow [2022-12-06 00:07:23,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 183 transitions, 3649 flow [2022-12-06 00:07:23,035 INFO L130 PetriNetUnfolder]: 121/366 cut-off events. [2022-12-06 00:07:23,036 INFO L131 PetriNetUnfolder]: For 5644/5644 co-relation queries the response was YES. [2022-12-06 00:07:23,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2854 conditions, 366 events. 121/366 cut-off events. For 5644/5644 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2072 event pairs, 7 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 2749. Up to 158 conditions per place. [2022-12-06 00:07:23,039 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 183 transitions, 3649 flow [2022-12-06 00:07:23,039 INFO L188 LiptonReduction]: Number of co-enabled transitions 568 [2022-12-06 00:07:23,039 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:23,040 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 00:07:23,040 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 183 transitions, 3649 flow [2022-12-06 00:07:23,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 00:07:23,040 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:23,040 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:23,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 00:07:23,040 INFO L420 AbstractCegarLoop]: === Iteration 30 === 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 00:07:23,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:23,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1594426689, now seen corresponding path program 1 times [2022-12-06 00:07:23,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:23,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112881983] [2022-12-06 00:07:23,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:23,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:23,161 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 00:07:23,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:23,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112881983] [2022-12-06 00:07:23,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112881983] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:23,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:23,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:23,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122593278] [2022-12-06 00:07:23,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:23,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:07:23,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:23,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:07:23,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:07:23,162 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 00:07:23,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 183 transitions, 3649 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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 00:07:23,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:23,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 00:07:23,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:23,385 INFO L130 PetriNetUnfolder]: 521/994 cut-off events. [2022-12-06 00:07:23,385 INFO L131 PetriNetUnfolder]: For 13816/13816 co-relation queries the response was YES. [2022-12-06 00:07:23,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7629 conditions, 994 events. 521/994 cut-off events. For 13816/13816 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5146 event pairs, 38 based on Foata normal form. 8/1002 useless extension candidates. Maximal degree in co-relation 6866. Up to 956 conditions per place. [2022-12-06 00:07:23,393 INFO L137 encePairwiseOnDemand]: 24/34 looper letters, 172 selfloop transitions, 18 changer transitions 2/192 dead transitions. [2022-12-06 00:07:23,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 192 transitions, 4118 flow [2022-12-06 00:07:23,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:07:23,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:07:23,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-12-06 00:07:23,394 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2549019607843137 [2022-12-06 00:07:23,394 INFO L175 Difference]: Start difference. First operand has 106 places, 183 transitions, 3649 flow. Second operand 6 states and 52 transitions. [2022-12-06 00:07:23,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 192 transitions, 4118 flow [2022-12-06 00:07:23,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 192 transitions, 4029 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-12-06 00:07:23,438 INFO L231 Difference]: Finished difference. Result has 107 places, 180 transitions, 3550 flow [2022-12-06 00:07:23,438 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3457, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3550, PETRI_PLACES=107, PETRI_TRANSITIONS=180} [2022-12-06 00:07:23,438 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 68 predicate places. [2022-12-06 00:07:23,438 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:23,438 INFO L89 Accepts]: Start accepts. Operand has 107 places, 180 transitions, 3550 flow [2022-12-06 00:07:23,439 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:23,439 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:23,440 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 180 transitions, 3550 flow [2022-12-06 00:07:23,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 180 transitions, 3550 flow [2022-12-06 00:07:23,474 INFO L130 PetriNetUnfolder]: 116/355 cut-off events. [2022-12-06 00:07:23,474 INFO L131 PetriNetUnfolder]: For 5500/5500 co-relation queries the response was YES. [2022-12-06 00:07:23,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2730 conditions, 355 events. 116/355 cut-off events. For 5500/5500 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2008 event pairs, 7 based on Foata normal form. 0/355 useless extension candidates. Maximal degree in co-relation 2630. Up to 156 conditions per place. [2022-12-06 00:07:23,477 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 180 transitions, 3550 flow [2022-12-06 00:07:23,478 INFO L188 LiptonReduction]: Number of co-enabled transitions 562 [2022-12-06 00:07:23,478 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [530] $Ultimate##0-->L67: Formula: (and (= v_~t~0_197 (+ v_~m2~0_98 1)) (= v_~t~0_199 v_~m3~0_105) (= v_~m2~0_98 (+ v_~t~0_199 1))) InVars {~t~0=v_~t~0_199} OutVars{~m3~0=v_~m3~0_105, ~m2~0=v_~m2~0_98, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_14|, ~t~0=v_~t~0_197, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_31|} AuxVars[] AssignedVars[~m3~0, ~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [469] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_317 1) v_~s~0_316) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_37| 0) (= v_~b~0_139 (ite (= (ite (or (not (= 0 (mod v_~b~0_140 256))) (= v_~x~0_89 1)) 1 0) 0) 0 1)) (= (ite (<= v_~m4~0_31 v_~s~0_317) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= |v_thread4Thread1of1ForFork0_#res#1.base_37| 0)) InVars {~b~0=v_~b~0_140, ~m4~0=v_~m4~0_31, ~x~0=v_~x~0_89, ~s~0=v_~s~0_317} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_37|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_41|, ~b~0=v_~b~0_139, ~m4~0=v_~m4~0_31, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_37|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, ~x~0=v_~x~0_89, ~s~0=v_~s~0_316} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:23,594 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] $Ultimate##0-->L105: Formula: (and (= (+ v_~t~0_55 1) v_~t~0_54) (= v_~m4~0_7 v_~t~0_55)) InVars {~t~0=v_~t~0_55} OutVars{~m4~0=v_~m4~0_7, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_1|, ~t~0=v_~t~0_54} AuxVars[] AssignedVars[~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~t~0] and [565] $Ultimate##0-->thread4EXIT: Formula: (and (= (+ v_~s~0_639 1) v_~s~0_638) (= v_~m2~0_158 (+ v_~t~0_370 1)) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= |v_thread4Thread1of1ForFork0_#res#1.offset_71| 0) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51| (ite (<= v_~m4~0_122 v_~s~0_639) 1 0)) (= (ite (= (ite (or (not (= (mod v_~b~0_432 256) 0)) (= v_~x~0_258 1)) 1 0) 0) 0 1) v_~b~0_431) (= v_~t~0_370 v_~m3~0_159) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.base_71| 0) (= v_~t~0_369 (+ v_~m2~0_158 1))) InVars {~b~0=v_~b~0_432, ~m4~0=v_~m4~0_122, ~x~0=v_~x~0_258, ~s~0=v_~s~0_639, ~t~0=v_~t~0_370} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_71|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_52|, ~m3~0=v_~m3~0_159, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_75|, ~b~0=v_~b~0_431, ~m4~0=v_~m4~0_122, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~m2~0=v_~m2~0_158, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_71|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|, ~x~0=v_~x~0_258, ~s~0=v_~s~0_638, ~t~0=v_~t~0_369, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_85|} AuxVars[] AssignedVars[~m3~0, thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~m2~0, thread4Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_#t~post3#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] [2022-12-06 00:07:23,679 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] $Ultimate##0-->L105: Formula: (and (= (+ v_~t~0_55 1) v_~t~0_54) (= v_~m4~0_7 v_~t~0_55)) InVars {~t~0=v_~t~0_55} OutVars{~m4~0=v_~m4~0_7, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_1|, ~t~0=v_~t~0_54} AuxVars[] AssignedVars[~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~t~0] and [526] $Ultimate##0-->thread4EXIT: Formula: (and (= v_~b~0_291 (ite (= (ite (or (= v_~x~0_190 1) (not (= 0 (mod v_~b~0_292 256)))) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (= (+ v_~s~0_495 1) v_~s~0_494) (= |v_thread4Thread1of1ForFork0_#res#1.offset_57| 0) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (= v_~t~0_182 v_~m3~0_97) (= v_~t~0_181 (+ v_~t~0_182 1)) (= |v_thread4Thread1of1ForFork0_#res#1.base_57| 0) (= (ite (<= v_~m4~0_82 v_~s~0_495) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|)) InVars {~b~0=v_~b~0_292, ~m4~0=v_~m4~0_82, ~x~0=v_~x~0_190, ~s~0=v_~s~0_495, ~t~0=v_~t~0_182} OutVars{~m3~0=v_~m3~0_97, thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_57|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_61|, ~b~0=v_~b~0_291, ~m4~0=v_~m4~0_82, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_57|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~x~0=v_~x~0_190, ~s~0=v_~s~0_494, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_23|, ~t~0=v_~t~0_181} AuxVars[] AssignedVars[~m3~0, thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] [2022-12-06 00:07:23,742 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] $Ultimate##0-->L105: Formula: (and (= (+ v_~t~0_55 1) v_~t~0_54) (= v_~m4~0_7 v_~t~0_55)) InVars {~t~0=v_~t~0_55} OutVars{~m4~0=v_~m4~0_7, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_1|, ~t~0=v_~t~0_54} AuxVars[] AssignedVars[~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~t~0] and [530] $Ultimate##0-->L67: Formula: (and (= v_~t~0_197 (+ v_~m2~0_98 1)) (= v_~t~0_199 v_~m3~0_105) (= v_~m2~0_98 (+ v_~t~0_199 1))) InVars {~t~0=v_~t~0_199} OutVars{~m3~0=v_~m3~0_105, ~m2~0=v_~m2~0_98, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_14|, ~t~0=v_~t~0_197, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_31|} AuxVars[] AssignedVars[~m3~0, ~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] [2022-12-06 00:07:23,764 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:07:23,765 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 327 [2022-12-06 00:07:23,765 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 180 transitions, 3565 flow [2022-12-06 00:07:23,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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 00:07:23,765 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:23,765 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:23,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 00:07:23,766 INFO L420 AbstractCegarLoop]: === Iteration 31 === 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 00:07:23,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:23,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1332428577, now seen corresponding path program 1 times [2022-12-06 00:07:23,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:23,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806749579] [2022-12-06 00:07:23,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:23,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:23,896 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 00:07:23,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:23,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806749579] [2022-12-06 00:07:23,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806749579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:23,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:23,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:23,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389708924] [2022-12-06 00:07:23,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:23,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:23,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:23,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:23,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:23,898 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 00:07:23,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 180 transitions, 3565 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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 00:07:23,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:23,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 00:07:23,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:24,136 INFO L130 PetriNetUnfolder]: 376/787 cut-off events. [2022-12-06 00:07:24,137 INFO L131 PetriNetUnfolder]: For 13605/13605 co-relation queries the response was YES. [2022-12-06 00:07:24,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5715 conditions, 787 events. 376/787 cut-off events. For 13605/13605 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4237 event pairs, 23 based on Foata normal form. 72/859 useless extension candidates. Maximal degree in co-relation 4039. Up to 337 conditions per place. [2022-12-06 00:07:24,142 INFO L137 encePairwiseOnDemand]: 18/37 looper letters, 70 selfloop transitions, 95 changer transitions 11/176 dead transitions. [2022-12-06 00:07:24,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 176 transitions, 3435 flow [2022-12-06 00:07:24,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:07:24,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:07:24,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-12-06 00:07:24,143 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3783783783783784 [2022-12-06 00:07:24,143 INFO L175 Difference]: Start difference. First operand has 106 places, 180 transitions, 3565 flow. Second operand 6 states and 84 transitions. [2022-12-06 00:07:24,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 176 transitions, 3435 flow [2022-12-06 00:07:24,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 176 transitions, 3261 flow, removed 31 selfloop flow, removed 10 redundant places. [2022-12-06 00:07:24,179 INFO L231 Difference]: Finished difference. Result has 104 places, 145 transitions, 2996 flow [2022-12-06 00:07:24,179 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2401, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2996, PETRI_PLACES=104, PETRI_TRANSITIONS=145} [2022-12-06 00:07:24,179 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 65 predicate places. [2022-12-06 00:07:24,179 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:24,179 INFO L89 Accepts]: Start accepts. Operand has 104 places, 145 transitions, 2996 flow [2022-12-06 00:07:24,180 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:24,180 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:24,181 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 145 transitions, 2996 flow [2022-12-06 00:07:24,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 145 transitions, 2996 flow [2022-12-06 00:07:24,212 INFO L130 PetriNetUnfolder]: 64/260 cut-off events. [2022-12-06 00:07:24,213 INFO L131 PetriNetUnfolder]: For 3875/3925 co-relation queries the response was YES. [2022-12-06 00:07:24,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2098 conditions, 260 events. 64/260 cut-off events. For 3875/3925 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1465 event pairs, 3 based on Foata normal form. 3/262 useless extension candidates. Maximal degree in co-relation 2003. Up to 105 conditions per place. [2022-12-06 00:07:24,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 145 transitions, 2996 flow [2022-12-06 00:07:24,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 440 [2022-12-06 00:07:24,216 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [525] $Ultimate##0-->L45: Formula: (and (= v_~t~0_177 v_~m3~0_95) (= (+ v_~t~0_177 1) v_~m1~0_109) (= v_~t~0_175 (+ v_~t~0_177 2))) InVars {~t~0=v_~t~0_177} OutVars{~m3~0=v_~m3~0_95, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_21|, ~m1~0=v_~m1~0_109, ~t~0=v_~t~0_175, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_21|} AuxVars[] AssignedVars[~m3~0, thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [469] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_317 1) v_~s~0_316) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_37| 0) (= v_~b~0_139 (ite (= (ite (or (not (= 0 (mod v_~b~0_140 256))) (= v_~x~0_89 1)) 1 0) 0) 0 1)) (= (ite (<= v_~m4~0_31 v_~s~0_317) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= |v_thread4Thread1of1ForFork0_#res#1.base_37| 0)) InVars {~b~0=v_~b~0_140, ~m4~0=v_~m4~0_31, ~x~0=v_~x~0_89, ~s~0=v_~s~0_317} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_37|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_41|, ~b~0=v_~b~0_139, ~m4~0=v_~m4~0_31, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_37|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, ~x~0=v_~x~0_89, ~s~0=v_~s~0_316} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:24,287 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] $Ultimate##0-->L105: Formula: (and (= (+ v_~t~0_55 1) v_~t~0_54) (= v_~m4~0_7 v_~t~0_55)) InVars {~t~0=v_~t~0_55} OutVars{~m4~0=v_~m4~0_7, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_1|, ~t~0=v_~t~0_54} AuxVars[] AssignedVars[~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~t~0] and [570] $Ultimate##0-->thread4EXIT: Formula: (and (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.base_79| 0) (= v_~b~0_447 (ite (= (ite (or (not (= (mod v_~b~0_448 256) 0)) (= v_~x~0_266 1)) 1 0) 0) 0 1)) (= (+ v_~t~0_396 1) v_~m1~0_155) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|) (= |v_thread4Thread1of1ForFork0_#res#1.offset_79| 0) (= v_~t~0_395 (+ v_~t~0_396 2)) (= (+ v_~s~0_655 1) v_~s~0_654) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59| (ite (<= v_~m4~0_132 v_~s~0_655) 1 0)) (= v_~t~0_396 v_~m3~0_167)) InVars {~b~0=v_~b~0_448, ~m4~0=v_~m4~0_132, ~x~0=v_~x~0_266, ~s~0=v_~s~0_655, ~t~0=v_~t~0_396} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_79|, ~m3~0=v_~m3~0_167, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_59|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_83|, ~b~0=v_~b~0_447, ~m4~0=v_~m4~0_132, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|, ~m1~0=v_~m1~0_155, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_79|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_59|, ~x~0=v_~x~0_266, ~s~0=v_~s~0_654, ~t~0=v_~t~0_395, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_93|} AuxVars[] AssignedVars[~m3~0, thread4Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork3_#t~post1#1, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~m1~0, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] [2022-12-06 00:07:24,357 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] $Ultimate##0-->L45: Formula: (and (= (+ v_~t~0_51 1) v_~t~0_50) (= v_~m1~0_9 v_~t~0_51)) InVars {~t~0=v_~t~0_51} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_50} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~t~0] and [469] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_317 1) v_~s~0_316) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_37| 0) (= v_~b~0_139 (ite (= (ite (or (not (= 0 (mod v_~b~0_140 256))) (= v_~x~0_89 1)) 1 0) 0) 0 1)) (= (ite (<= v_~m4~0_31 v_~s~0_317) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= |v_thread4Thread1of1ForFork0_#res#1.base_37| 0)) InVars {~b~0=v_~b~0_140, ~m4~0=v_~m4~0_31, ~x~0=v_~x~0_89, ~s~0=v_~s~0_317} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_37|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_41|, ~b~0=v_~b~0_139, ~m4~0=v_~m4~0_31, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_37|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, ~x~0=v_~x~0_89, ~s~0=v_~s~0_316} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:24,410 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] $Ultimate##0-->L45: Formula: (and (= (+ v_~t~0_51 1) v_~t~0_50) (= v_~m1~0_9 v_~t~0_51)) InVars {~t~0=v_~t~0_51} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_50} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~t~0] and [504] L86-->thread3EXIT: Formula: (and (= v_~s~0_388 (+ v_~s~0_389 1)) (= |v_thread3Thread1of1ForFork2_#res#1.base_27| 0) (= v_~b~0_199 (ite (= (ite (or (not (= (mod v_~b~0_200 256) 0)) (= v_~x~0_128 1)) 1 0) 0) 0 1)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) (= (ite (<= v_~m3~0_59 v_~s~0_389) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_27|)) InVars {~m3~0=v_~m3~0_59, ~b~0=v_~b~0_200, ~x~0=v_~x~0_128, ~s~0=v_~s~0_389} OutVars{~m3~0=v_~m3~0_59, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_27|, ~b~0=v_~b~0_199, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_27|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, ~x~0=v_~x~0_128, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_47|, ~s~0=v_~s~0_388} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0] [2022-12-06 00:07:24,464 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] $Ultimate##0-->L105: Formula: (and (= (+ v_~t~0_55 1) v_~t~0_54) (= v_~m4~0_7 v_~t~0_55)) InVars {~t~0=v_~t~0_55} OutVars{~m4~0=v_~m4~0_7, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_1|, ~t~0=v_~t~0_54} AuxVars[] AssignedVars[~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~t~0] and [572] $Ultimate##0-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_#res#1.offset_83| 0) (= v_~t~0_406 v_~m1~0_159) (= v_~s~0_662 (+ v_~s~0_663 1)) (= v_~b~0_455 (ite (= (ite (or (= v_~x~0_270 1) (not (= (mod v_~b~0_456 256) 0))) 1 0) 0) 0 1)) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_63| 0)) (= (ite (<= v_~m4~0_136 v_~s~0_663) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_63| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) (= |v_thread4Thread1of1ForFork0_#res#1.base_83| 0) (= v_~t~0_405 (+ v_~t~0_406 1))) InVars {~b~0=v_~b~0_456, ~m4~0=v_~m4~0_136, ~x~0=v_~x~0_270, ~s~0=v_~s~0_663, ~t~0=v_~t~0_406} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_83|, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_63|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_87|, ~b~0=v_~b~0_455, ~m4~0=v_~m4~0_136, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|, ~m1~0=v_~m1~0_159, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_83|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_63|, ~x~0=v_~x~0_270, ~s~0=v_~s~0_662, ~t~0=v_~t~0_405} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork3_#t~post1#1, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~m1~0, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~t~0] [2022-12-06 00:07:24,526 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:07:24,527 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 348 [2022-12-06 00:07:24,527 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 145 transitions, 2987 flow [2022-12-06 00:07:24,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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 00:07:24,527 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:24,527 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:24,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 00:07:24,527 INFO L420 AbstractCegarLoop]: === Iteration 32 === 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 00:07:24,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:24,528 INFO L85 PathProgramCache]: Analyzing trace with hash -512969655, now seen corresponding path program 1 times [2022-12-06 00:07:24,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:24,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633250385] [2022-12-06 00:07:24,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:24,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:24,656 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 00:07:24,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:24,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633250385] [2022-12-06 00:07:24,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633250385] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:24,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:24,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:24,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565913579] [2022-12-06 00:07:24,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:24,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:24,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:24,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:24,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:24,658 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 00:07:24,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 145 transitions, 2987 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 00:07:24,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:24,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 00:07:24,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:24,821 INFO L130 PetriNetUnfolder]: 352/731 cut-off events. [2022-12-06 00:07:24,822 INFO L131 PetriNetUnfolder]: For 9249/9249 co-relation queries the response was YES. [2022-12-06 00:07:24,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5754 conditions, 731 events. 352/731 cut-off events. For 9249/9249 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3795 event pairs, 31 based on Foata normal form. 2/733 useless extension candidates. Maximal degree in co-relation 5291. Up to 696 conditions per place. [2022-12-06 00:07:24,825 INFO L137 encePairwiseOnDemand]: 25/38 looper letters, 136 selfloop transitions, 17 changer transitions 3/156 dead transitions. [2022-12-06 00:07:24,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 156 transitions, 3390 flow [2022-12-06 00:07:24,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:07:24,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:07:24,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2022-12-06 00:07:24,826 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21428571428571427 [2022-12-06 00:07:24,826 INFO L175 Difference]: Start difference. First operand has 104 places, 145 transitions, 2987 flow. Second operand 7 states and 57 transitions. [2022-12-06 00:07:24,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 156 transitions, 3390 flow [2022-12-06 00:07:24,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 156 transitions, 3258 flow, removed 37 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:24,859 INFO L231 Difference]: Finished difference. Result has 110 places, 146 transitions, 2913 flow [2022-12-06 00:07:24,859 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=2858, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2913, PETRI_PLACES=110, PETRI_TRANSITIONS=146} [2022-12-06 00:07:24,859 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 71 predicate places. [2022-12-06 00:07:24,859 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:24,859 INFO L89 Accepts]: Start accepts. Operand has 110 places, 146 transitions, 2913 flow [2022-12-06 00:07:24,860 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:24,860 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:24,861 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 146 transitions, 2913 flow [2022-12-06 00:07:24,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 146 transitions, 2913 flow [2022-12-06 00:07:24,885 INFO L130 PetriNetUnfolder]: 63/254 cut-off events. [2022-12-06 00:07:24,885 INFO L131 PetriNetUnfolder]: For 3745/3745 co-relation queries the response was YES. [2022-12-06 00:07:24,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1997 conditions, 254 events. 63/254 cut-off events. For 3745/3745 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1423 event pairs, 3 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 1904. Up to 104 conditions per place. [2022-12-06 00:07:24,887 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 146 transitions, 2913 flow [2022-12-06 00:07:24,887 INFO L188 LiptonReduction]: Number of co-enabled transitions 442 [2022-12-06 00:07:24,904 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [469] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_317 1) v_~s~0_316) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_37| 0) (= v_~b~0_139 (ite (= (ite (or (not (= 0 (mod v_~b~0_140 256))) (= v_~x~0_89 1)) 1 0) 0) 0 1)) (= (ite (<= v_~m4~0_31 v_~s~0_317) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= |v_thread4Thread1of1ForFork0_#res#1.base_37| 0)) InVars {~b~0=v_~b~0_140, ~m4~0=v_~m4~0_31, ~x~0=v_~x~0_89, ~s~0=v_~s~0_317} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_37|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_41|, ~b~0=v_~b~0_139, ~m4~0=v_~m4~0_31, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_37|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, ~x~0=v_~x~0_89, ~s~0=v_~s~0_316} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0] and [478] L67-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| 0)) (= v_~b~0_159 (ite (= (ite (or (= v_~x~0_98 1) (not (= (mod v_~b~0_160 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= (ite (<= v_~m2~0_57 v_~s~0_341) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~s~0_341 1) v_~s~0_340)) InVars {~b~0=v_~b~0_160, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_98, ~s~0=v_~s~0_341} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~b~0=v_~b~0_159, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|, ~x~0=v_~x~0_98, ~s~0=v_~s~0_340} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-06 00:07:25,000 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [469] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_317 1) v_~s~0_316) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_37| 0) (= v_~b~0_139 (ite (= (ite (or (not (= 0 (mod v_~b~0_140 256))) (= v_~x~0_89 1)) 1 0) 0) 0 1)) (= (ite (<= v_~m4~0_31 v_~s~0_317) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= |v_thread4Thread1of1ForFork0_#res#1.base_37| 0)) InVars {~b~0=v_~b~0_140, ~m4~0=v_~m4~0_31, ~x~0=v_~x~0_89, ~s~0=v_~s~0_317} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_37|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_41|, ~b~0=v_~b~0_139, ~m4~0=v_~m4~0_31, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_37|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, ~x~0=v_~x~0_89, ~s~0=v_~s~0_316} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0] and [504] L86-->thread3EXIT: Formula: (and (= v_~s~0_388 (+ v_~s~0_389 1)) (= |v_thread3Thread1of1ForFork2_#res#1.base_27| 0) (= v_~b~0_199 (ite (= (ite (or (not (= (mod v_~b~0_200 256) 0)) (= v_~x~0_128 1)) 1 0) 0) 0 1)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) (= (ite (<= v_~m3~0_59 v_~s~0_389) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_27|)) InVars {~m3~0=v_~m3~0_59, ~b~0=v_~b~0_200, ~x~0=v_~x~0_128, ~s~0=v_~s~0_389} OutVars{~m3~0=v_~m3~0_59, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_27|, ~b~0=v_~b~0_199, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_27|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, ~x~0=v_~x~0_128, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_47|, ~s~0=v_~s~0_388} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0] [2022-12-06 00:07:25,094 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] $Ultimate##0-->thread4EXIT: Formula: (and (= v_~s~0_658 (+ v_~s~0_659 1)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_81| 0) (= (+ v_~t~0_401 2) v_~m1~0_157) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_61| 0)) (= (+ v_~m3~0_169 1) v_~m1~0_157) (= v_~t~0_401 v_~m4~0_134) (= (ite (<= v_~m4~0_134 v_~s~0_659) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= v_~t~0_399 (+ 1 v_~m1~0_157)) (= (ite (= (ite (or (not (= (mod v_~b~0_452 256) 0)) (= v_~x~0_268 1)) 1 0) 0) 0 1) v_~b~0_451) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_61| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= |v_thread4Thread1of1ForFork0_#res#1.base_81| 0)) InVars {~b~0=v_~b~0_452, ~x~0=v_~x~0_268, ~s~0=v_~s~0_659, ~t~0=v_~t~0_401} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_81|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_50|, ~m3~0=v_~m3~0_169, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_61|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_85|, ~b~0=v_~b~0_451, ~m4~0=v_~m4~0_134, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|, ~m1~0=v_~m1~0_157, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_81|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_61|, ~x~0=v_~x~0_268, ~s~0=v_~s~0_658, ~t~0=v_~t~0_399, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_95|} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post7#1, ~m3~0, thread1Thread1of1ForFork3_#t~post1#1, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, ~m4~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~m1~0, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [504] L86-->thread3EXIT: Formula: (and (= v_~s~0_388 (+ v_~s~0_389 1)) (= |v_thread3Thread1of1ForFork2_#res#1.base_27| 0) (= v_~b~0_199 (ite (= (ite (or (not (= (mod v_~b~0_200 256) 0)) (= v_~x~0_128 1)) 1 0) 0) 0 1)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) (= (ite (<= v_~m3~0_59 v_~s~0_389) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_27|)) InVars {~m3~0=v_~m3~0_59, ~b~0=v_~b~0_200, ~x~0=v_~x~0_128, ~s~0=v_~s~0_389} OutVars{~m3~0=v_~m3~0_59, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_27|, ~b~0=v_~b~0_199, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_27|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, ~x~0=v_~x~0_128, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_47|, ~s~0=v_~s~0_388} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0] [2022-12-06 00:07:25,334 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] $Ultimate##0-->L45: Formula: (and (= (+ v_~t~0_51 1) v_~t~0_50) (= v_~m1~0_9 v_~t~0_51)) InVars {~t~0=v_~t~0_51} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_50} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~t~0] and [469] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_317 1) v_~s~0_316) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_37| 0) (= v_~b~0_139 (ite (= (ite (or (not (= 0 (mod v_~b~0_140 256))) (= v_~x~0_89 1)) 1 0) 0) 0 1)) (= (ite (<= v_~m4~0_31 v_~s~0_317) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= |v_thread4Thread1of1ForFork0_#res#1.base_37| 0)) InVars {~b~0=v_~b~0_140, ~m4~0=v_~m4~0_31, ~x~0=v_~x~0_89, ~s~0=v_~s~0_317} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_37|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_41|, ~b~0=v_~b~0_139, ~m4~0=v_~m4~0_31, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_37|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, ~x~0=v_~x~0_89, ~s~0=v_~s~0_316} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:25,410 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] $Ultimate##0-->L45: Formula: (and (= (+ v_~t~0_51 1) v_~t~0_50) (= v_~m1~0_9 v_~t~0_51)) InVars {~t~0=v_~t~0_51} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_50} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~t~0] and [575] L105-->thread2EXIT: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| 0)) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_67| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_75|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_103| (ite (<= v_~m2~0_164 (+ v_~s~0_676 1)) 1 0)) (= (+ 2 v_~s~0_676) v_~s~0_674) (= v_~b~0_467 (ite (= (ite (let ((.cse0 (= v_~x~0_276 1))) (or (not (= (mod (ite (= (ite (or (not (= (mod v_~b~0_469 256) 0)) .cse0) 1 0) 0) 0 1) 256) 0)) .cse0)) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_75| 0) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_67| 0)) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67| (ite (<= v_~m4~0_140 v_~s~0_676) 1 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_87| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_103| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103|) (= |v_thread4Thread1of1ForFork0_#res#1.base_87| 0)) InVars {~b~0=v_~b~0_469, ~m4~0=v_~m4~0_140, ~m2~0=v_~m2~0_164, ~x~0=v_~x~0_276, ~s~0=v_~s~0_676} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_87|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_105|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_75|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_103|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_75|, ~b~0=v_~b~0_467, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_91|, ~m4~0=v_~m4~0_140, ~m2~0=v_~m2~0_164, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_87|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_67|, ~x~0=v_~x~0_276, ~s~0=v_~s~0_674} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, ~b~0, thread4Thread1of1ForFork0_#t~post8#1, thread2Thread1of1ForFork1_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:25,543 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] $Ultimate##0-->L45: Formula: (and (= (+ v_~t~0_51 1) v_~t~0_50) (= v_~m1~0_9 v_~t~0_51)) InVars {~t~0=v_~t~0_51} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_50} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~t~0] and [576] L105-->thread3EXIT: Formula: (and (= (ite (<= (+ v_~m3~0_173 1) v_~s~0_680) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= |v_thread4Thread1of1ForFork0_#res#1.base_89| 0) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_49|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_49| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= |v_thread3Thread1of1ForFork2_#res#1.base_49| 0) (= |v_thread4Thread1of1ForFork0_#res#1.offset_89| 0) (= (+ 2 v_~s~0_682) v_~s~0_680) (= v_~b~0_473 (ite (= (ite (let ((.cse0 (= v_~x~0_278 1))) (or .cse0 (not (= (mod (ite (= (ite (or (not (= (mod v_~b~0_475 256) 0)) .cse0) 1 0) 0) 0 1) 256) 0)))) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_69| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_69|) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_69| 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_69| (ite (<= v_~m4~0_142 v_~s~0_682) 1 0))) InVars {~m3~0=v_~m3~0_173, ~b~0=v_~b~0_475, ~m4~0=v_~m4~0_142, ~x~0=v_~x~0_278, ~s~0=v_~s~0_682} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_89|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_49|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_69|, ~m3~0=v_~m3~0_173, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_49|, ~b~0=v_~b~0_473, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_93|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_49|, ~m4~0=v_~m4~0_142, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_69|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_89|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_69|, ~x~0=v_~x~0_278, ~s~0=v_~s~0_680} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread4Thread1of1ForFork0_#t~post8#1, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0] [2022-12-06 00:07:25,701 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [569] $Ultimate##0-->L67: Formula: (and (= v_~t~0_391 v_~m4~0_130) (= v_~m2~0_162 (+ v_~t~0_391 2)) (= v_~m2~0_162 (+ v_~m3~0_165 1)) (= v_~t~0_389 (+ v_~m2~0_162 1))) InVars {~t~0=v_~t~0_391} OutVars{~m3~0=v_~m3~0_165, ~m4~0=v_~m4~0_130, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_48|, ~m2~0=v_~m2~0_162, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_56|, ~t~0=v_~t~0_389, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_91|} AuxVars[] AssignedVars[~m3~0, ~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [578] $Ultimate##0-->thread4EXIT: Formula: (and (= (ite (<= v_~m4~0_146 v_~s~0_693) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73|) (= v_~b~0_485 (ite (= (ite (or (= v_~x~0_282 1) (not (= (mod v_~b~0_486 256) 0))) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork0_#res#1.base_93| 0) (= (+ v_~s~0_693 1) v_~s~0_692) (= v_~t~0_424 v_~m1~0_167) (= |v_thread4Thread1of1ForFork0_#res#1.offset_93| 0) (= v_~t~0_423 (+ v_~t~0_424 1)) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_73| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_73| 0))) InVars {~b~0=v_~b~0_486, ~m4~0=v_~m4~0_146, ~x~0=v_~x~0_282, ~s~0=v_~s~0_693, ~t~0=v_~t~0_424} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_93|, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_71|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_97|, ~b~0=v_~b~0_485, ~m4~0=v_~m4~0_146, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73|, ~m1~0=v_~m1~0_167, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_93|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_73|, ~x~0=v_~x~0_282, ~s~0=v_~s~0_692, ~t~0=v_~t~0_423} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork3_#t~post1#1, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~m1~0, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~t~0] [2022-12-06 00:07:25,785 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [569] $Ultimate##0-->L67: Formula: (and (= v_~t~0_391 v_~m4~0_130) (= v_~m2~0_162 (+ v_~t~0_391 2)) (= v_~m2~0_162 (+ v_~m3~0_165 1)) (= v_~t~0_389 (+ v_~m2~0_162 1))) InVars {~t~0=v_~t~0_391} OutVars{~m3~0=v_~m3~0_165, ~m4~0=v_~m4~0_130, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_48|, ~m2~0=v_~m2~0_162, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_56|, ~t~0=v_~t~0_389, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_91|} AuxVars[] AssignedVars[~m3~0, ~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [579] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_75| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_75|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_77| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|) (= v_~b~0_489 (ite (= (ite (let ((.cse0 (= v_~x~0_284 1))) (or (not (= (mod (ite (= (ite (or .cse0 (not (= (mod v_~b~0_490 256) 0))) 1 0) 0) 0 1) 256) 0)) .cse0)) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_105| (ite (<= v_~m2~0_166 (+ v_~s~0_697 1)) 1 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_95| 0) (= v_~t~0_427 (+ v_~t~0_428 1)) (= v_~t~0_428 v_~m1~0_169) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_75| 0)) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_77|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| 0)) (= (+ 2 v_~s~0_697) v_~s~0_696) (= (ite (<= v_~m4~0_148 v_~s~0_697) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_75|) (= |v_thread4Thread1of1ForFork0_#res#1.base_95| 0)) InVars {~b~0=v_~b~0_490, ~m4~0=v_~m4~0_148, ~m2~0=v_~m2~0_166, ~x~0=v_~x~0_284, ~s~0=v_~s~0_697, ~t~0=v_~t~0_428} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_95|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_107|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_77|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_105|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_73|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_77|, ~b~0=v_~b~0_489, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_99|, ~m4~0=v_~m4~0_148, ~m2~0=v_~m2~0_166, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_75|, ~m1~0=v_~m1~0_169, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_95|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_75|, ~x~0=v_~x~0_284, ~s~0=v_~s~0_696, ~t~0=v_~t~0_427} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~post1#1, thread2Thread1of1ForFork1_#res#1.base, ~b~0, thread4Thread1of1ForFork0_#t~post8#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~m1~0, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~t~0] [2022-12-06 00:07:25,981 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [569] $Ultimate##0-->L67: Formula: (and (= v_~t~0_391 v_~m4~0_130) (= v_~m2~0_162 (+ v_~t~0_391 2)) (= v_~m2~0_162 (+ v_~m3~0_165 1)) (= v_~t~0_389 (+ v_~m2~0_162 1))) InVars {~t~0=v_~t~0_391} OutVars{~m3~0=v_~m3~0_165, ~m4~0=v_~m4~0_130, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_48|, ~m2~0=v_~m2~0_162, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_56|, ~t~0=v_~t~0_389, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_91|} AuxVars[] AssignedVars[~m3~0, ~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [580] $Ultimate##0-->thread3EXIT: Formula: (and (= (ite (<= (+ v_~m3~0_177 1) v_~s~0_700) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_77| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_97| 0) (= |v_thread4Thread1of1ForFork0_#res#1.base_97| 0) (= (+ 2 v_~s~0_701) v_~s~0_700) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_53|) (= v_~b~0_493 (ite (= (ite (let ((.cse0 (= v_~x~0_286 1))) (or (not (= (mod (ite (= (ite (or (not (= (mod v_~b~0_494 256) 0)) .cse0) 1 0) 0) 0 1) 256) 0)) .cse0)) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_53| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_77| (ite (<= v_~m4~0_150 v_~s~0_701) 1 0)) (= v_~t~0_431 (+ v_~t~0_432 1)) (= |v_thread3Thread1of1ForFork2_#res#1.base_53| 0) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_77| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_77|) (= v_~t~0_432 v_~m1~0_171) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_53| 0))) InVars {~m3~0=v_~m3~0_177, ~b~0=v_~b~0_494, ~m4~0=v_~m4~0_150, ~x~0=v_~x~0_286, ~s~0=v_~s~0_701, ~t~0=v_~t~0_432} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_97|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_53|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_73|, ~m3~0=v_~m3~0_177, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_75|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_53|, ~b~0=v_~b~0_493, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_101|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_53|, ~m4~0=v_~m4~0_150, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_77|, ~m1~0=v_~m1~0_171, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_97|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_77|, ~x~0=v_~x~0_286, ~s~0=v_~s~0_700, ~t~0=v_~t~0_431} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, thread1Thread1of1ForFork3_#t~post1#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread4Thread1of1ForFork0_#t~post8#1, thread3Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~m1~0, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~t~0] [2022-12-06 00:07:26,204 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [567] $Ultimate##0-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_#res#1.base_75| 0) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_55| (ite (<= v_~m4~0_126 v_~s~0_647) 1 0)) (= v_~b~0_439 (ite (= (ite (or (= v_~x~0_262 1) (not (= (mod v_~b~0_440 256) 0))) 1 0) 0) 0 1)) (= v_~t~0_379 v_~m4~0_126) (= v_~t~0_377 (+ v_~m2~0_160 1)) (= (+ v_~s~0_647 1) v_~s~0_646) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_55| 0)) (= (+ v_~m3~0_161 1) v_~m2~0_160) (= |v_thread4Thread1of1ForFork0_#res#1.offset_75| 0) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_55| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_55|) (= v_~m2~0_160 (+ v_~t~0_379 2))) InVars {~b~0=v_~b~0_440, ~x~0=v_~x~0_262, ~s~0=v_~s~0_647, ~t~0=v_~t~0_379} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_75|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_44|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_54|, ~m3~0=v_~m3~0_161, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_79|, ~b~0=v_~b~0_439, ~m4~0=v_~m4~0_126, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_55|, ~m2~0=v_~m2~0_160, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_75|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_55|, ~x~0=v_~x~0_262, ~s~0=v_~s~0_646, ~t~0=v_~t~0_377, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_87|} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork1_#t~post3#1, ~m3~0, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, ~m4~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~m2~0, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [504] L86-->thread3EXIT: Formula: (and (= v_~s~0_388 (+ v_~s~0_389 1)) (= |v_thread3Thread1of1ForFork2_#res#1.base_27| 0) (= v_~b~0_199 (ite (= (ite (or (not (= (mod v_~b~0_200 256) 0)) (= v_~x~0_128 1)) 1 0) 0) 0 1)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) (= (ite (<= v_~m3~0_59 v_~s~0_389) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_27|)) InVars {~m3~0=v_~m3~0_59, ~b~0=v_~b~0_200, ~x~0=v_~x~0_128, ~s~0=v_~s~0_389} OutVars{~m3~0=v_~m3~0_59, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_27|, ~b~0=v_~b~0_199, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_27|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, ~x~0=v_~x~0_128, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_47|, ~s~0=v_~s~0_388} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0] [2022-12-06 00:07:26,396 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [569] $Ultimate##0-->L67: Formula: (and (= v_~t~0_391 v_~m4~0_130) (= v_~m2~0_162 (+ v_~t~0_391 2)) (= v_~m2~0_162 (+ v_~m3~0_165 1)) (= v_~t~0_389 (+ v_~m2~0_162 1))) InVars {~t~0=v_~t~0_391} OutVars{~m3~0=v_~m3~0_165, ~m4~0=v_~m4~0_130, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_48|, ~m2~0=v_~m2~0_162, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_56|, ~t~0=v_~t~0_389, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_91|} AuxVars[] AssignedVars[~m3~0, ~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [504] L86-->thread3EXIT: Formula: (and (= v_~s~0_388 (+ v_~s~0_389 1)) (= |v_thread3Thread1of1ForFork2_#res#1.base_27| 0) (= v_~b~0_199 (ite (= (ite (or (not (= (mod v_~b~0_200 256) 0)) (= v_~x~0_128 1)) 1 0) 0) 0 1)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) (= (ite (<= v_~m3~0_59 v_~s~0_389) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_27|)) InVars {~m3~0=v_~m3~0_59, ~b~0=v_~b~0_200, ~x~0=v_~x~0_128, ~s~0=v_~s~0_389} OutVars{~m3~0=v_~m3~0_59, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_27|, ~b~0=v_~b~0_199, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_27|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, ~x~0=v_~x~0_128, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_47|, ~s~0=v_~s~0_388} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0] [2022-12-06 00:07:26,462 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 00:07:26,463 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1604 [2022-12-06 00:07:26,463 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 145 transitions, 2976 flow [2022-12-06 00:07:26,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 00:07:26,463 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:26,463 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:26,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 00:07:26,464 INFO L420 AbstractCegarLoop]: === Iteration 33 === 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 00:07:26,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:26,464 INFO L85 PathProgramCache]: Analyzing trace with hash -913880562, now seen corresponding path program 1 times [2022-12-06 00:07:26,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:26,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788230745] [2022-12-06 00:07:26,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:26,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:07:26,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:26,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788230745] [2022-12-06 00:07:26,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788230745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:26,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:26,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:26,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492912913] [2022-12-06 00:07:26,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:26,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:07:26,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:26,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:07:26,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:07:26,622 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 00:07:26,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 145 transitions, 2976 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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 00:07:26,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:26,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 00:07:26,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:26,799 INFO L130 PetriNetUnfolder]: 343/716 cut-off events. [2022-12-06 00:07:26,799 INFO L131 PetriNetUnfolder]: For 9301/9301 co-relation queries the response was YES. [2022-12-06 00:07:26,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5440 conditions, 716 events. 343/716 cut-off events. For 9301/9301 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3750 event pairs, 30 based on Foata normal form. 2/716 useless extension candidates. Maximal degree in co-relation 5164. Up to 693 conditions per place. [2022-12-06 00:07:26,804 INFO L137 encePairwiseOnDemand]: 26/43 looper letters, 133 selfloop transitions, 13 changer transitions 2/148 dead transitions. [2022-12-06 00:07:26,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 148 transitions, 3173 flow [2022-12-06 00:07:26,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:26,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:26,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-12-06 00:07:26,805 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24651162790697675 [2022-12-06 00:07:26,805 INFO L175 Difference]: Start difference. First operand has 109 places, 145 transitions, 2976 flow. Second operand 5 states and 53 transitions. [2022-12-06 00:07:26,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 148 transitions, 3173 flow [2022-12-06 00:07:26,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 148 transitions, 3074 flow, removed 36 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:26,846 INFO L231 Difference]: Finished difference. Result has 111 places, 141 transitions, 2745 flow [2022-12-06 00:07:26,847 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2757, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2745, PETRI_PLACES=111, PETRI_TRANSITIONS=141} [2022-12-06 00:07:26,847 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 72 predicate places. [2022-12-06 00:07:26,847 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:26,847 INFO L89 Accepts]: Start accepts. Operand has 111 places, 141 transitions, 2745 flow [2022-12-06 00:07:26,848 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:26,849 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:26,849 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 141 transitions, 2745 flow [2022-12-06 00:07:26,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 141 transitions, 2745 flow [2022-12-06 00:07:26,877 INFO L130 PetriNetUnfolder]: 61/249 cut-off events. [2022-12-06 00:07:26,878 INFO L131 PetriNetUnfolder]: For 3655/3724 co-relation queries the response was YES. [2022-12-06 00:07:26,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1913 conditions, 249 events. 61/249 cut-off events. For 3655/3724 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1401 event pairs, 3 based on Foata normal form. 2/250 useless extension candidates. Maximal degree in co-relation 1842. Up to 99 conditions per place. [2022-12-06 00:07:26,880 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 141 transitions, 2745 flow [2022-12-06 00:07:26,880 INFO L188 LiptonReduction]: Number of co-enabled transitions 432 [2022-12-06 00:07:26,886 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [383] $Ultimate##0-->L67: Formula: (and (= v_~t~0_46 (+ v_~t~0_47 1)) (= v_~m2~0_11 v_~t~0_47)) InVars {~t~0=v_~t~0_47} OutVars{thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_46} AuxVars[] AssignedVars[~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0] and [504] L86-->thread3EXIT: Formula: (and (= v_~s~0_388 (+ v_~s~0_389 1)) (= |v_thread3Thread1of1ForFork2_#res#1.base_27| 0) (= v_~b~0_199 (ite (= (ite (or (not (= (mod v_~b~0_200 256) 0)) (= v_~x~0_128 1)) 1 0) 0) 0 1)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) (= (ite (<= v_~m3~0_59 v_~s~0_389) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_27|)) InVars {~m3~0=v_~m3~0_59, ~b~0=v_~b~0_200, ~x~0=v_~x~0_128, ~s~0=v_~s~0_389} OutVars{~m3~0=v_~m3~0_59, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_27|, ~b~0=v_~b~0_199, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_27|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, ~x~0=v_~x~0_128, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_47|, ~s~0=v_~s~0_388} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0] [2022-12-06 00:07:26,958 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] $Ultimate##0-->thread4EXIT: Formula: (and (= v_~s~0_658 (+ v_~s~0_659 1)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_81| 0) (= (+ v_~t~0_401 2) v_~m1~0_157) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_61| 0)) (= (+ v_~m3~0_169 1) v_~m1~0_157) (= v_~t~0_401 v_~m4~0_134) (= (ite (<= v_~m4~0_134 v_~s~0_659) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= v_~t~0_399 (+ 1 v_~m1~0_157)) (= (ite (= (ite (or (not (= (mod v_~b~0_452 256) 0)) (= v_~x~0_268 1)) 1 0) 0) 0 1) v_~b~0_451) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_61| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= |v_thread4Thread1of1ForFork0_#res#1.base_81| 0)) InVars {~b~0=v_~b~0_452, ~x~0=v_~x~0_268, ~s~0=v_~s~0_659, ~t~0=v_~t~0_401} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_81|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_50|, ~m3~0=v_~m3~0_169, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_61|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_85|, ~b~0=v_~b~0_451, ~m4~0=v_~m4~0_134, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|, ~m1~0=v_~m1~0_157, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_81|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_61|, ~x~0=v_~x~0_268, ~s~0=v_~s~0_658, ~t~0=v_~t~0_399, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_95|} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post7#1, ~m3~0, thread1Thread1of1ForFork3_#t~post1#1, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, ~m4~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~m1~0, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [586] $Ultimate##0-->thread3EXIT: Formula: (and (= v_~t~0_461 (+ v_~t~0_462 1)) (= (+ v_~s~0_727 1) v_~s~0_726) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_61| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_61|) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_61| 0)) (= v_~t~0_462 v_~m2~0_178) (= |v_thread3Thread1of1ForFork2_#res#1.base_61| 0) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_61|) (= v_~b~0_519 (ite (= (ite (or (= v_~x~0_298 1) (not (= (mod v_~b~0_520 256) 0))) 1 0) 0) 0 1)) (= (ite (<= v_~m3~0_189 v_~s~0_727) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_61|)) InVars {~m3~0=v_~m3~0_189, ~b~0=v_~b~0_520, ~x~0=v_~x~0_298, ~s~0=v_~s~0_727, ~t~0=v_~t~0_462} OutVars{~m3~0=v_~m3~0_189, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_61|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_61|, ~b~0=v_~b~0_519, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_61|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_61|, ~m2~0=v_~m2~0_178, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_68|, ~x~0=v_~x~0_298, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_81|, ~s~0=v_~s~0_726, ~t~0=v_~t~0_461} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~m2~0, thread2Thread1of1ForFork1_#t~post3#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0, ~t~0] [2022-12-06 00:07:27,222 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [583] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse0 (+ v_~m3~0_183 1))) (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|) (= v_~m2~0_172 .cse0) (= |v_thread4Thread1of1ForFork0_#res#1.base_103| 0) (= |v_thread4Thread1of1ForFork0_#res#1.offset_103| 0) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_55| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_55|) (= v_~t~0_449 v_~m4~0_156) (= (+ v_~m2~0_172 1) v_~m1~0_177) (= (+ v_~t~0_449 2) v_~m2~0_172) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_55|) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83| (ite (<= v_~m4~0_156 v_~s~0_713) 1 0)) (= (+ 2 v_~s~0_713) v_~s~0_712) (= (ite (= (ite (let ((.cse1 (= v_~x~0_292 1))) (or (not (= (mod (ite (= (ite (or .cse1 (not (= (mod v_~b~0_506 256) 0))) 1 0) 0) 0 1) 256) 0)) .cse1)) 1 0) 0) 0 1) v_~b~0_505) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_55| 0)) (= |v_thread3Thread1of1ForFork2_#res#1.base_55| 0) (= v_~t~0_447 (+ 1 v_~m1~0_177)) (= (ite (<= .cse0 v_~s~0_712) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_55|))) InVars {~b~0=v_~b~0_506, ~x~0=v_~x~0_292, ~s~0=v_~s~0_713, ~t~0=v_~t~0_449} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_55|, thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_103|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_60|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_55|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_62|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_75|, ~m3~0=v_~m3~0_183, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_81|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_55|, ~b~0=v_~b~0_505, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_107|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_55|, ~m4~0=v_~m4~0_156, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|, ~m1~0=v_~m1~0_177, ~m2~0=v_~m2~0_172, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_103|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, ~x~0=v_~x~0_292, ~s~0=v_~s~0_712, ~t~0=v_~t~0_447, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_103|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post7#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread3Thread1of1ForFork2_#t~post6#1, ~m3~0, thread1Thread1of1ForFork3_#t~post1#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread4Thread1of1ForFork0_#t~post8#1, thread3Thread1of1ForFork2_#res#1.base, ~m4~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~m1~0, ~m2~0, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [516] L45-->thread2EXIT: Formula: (let ((.cse0 (= v_~x~0_168 1))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_79 v_~s~0_449) 1 0)) (not (= 0 |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_43|)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_43| |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_43|) (= v_~b~0_251 (ite (= (ite (or (not (= (mod v_~b~0_252 256) 0)) .cse0) 1 0) 0) 0 1)) (= v_~s~0_448 (+ v_~s~0_449 1)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_13| 0) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_13|) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_43| (ite (<= v_~m1~0_87 v_~s~0_449) 1 0)) .cse0)) InVars {~b~0=v_~b~0_252, ~m2~0=v_~m2~0_79, ~m1~0=v_~m1~0_87, ~s~0=v_~s~0_449} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_13|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_43|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_43|, ~b~0=v_~b~0_251, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_13|, ~m2~0=v_~m2~0_79, ~m1~0=v_~m1~0_87, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|, ~x~0=v_~x~0_168, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_43|, ~s~0=v_~s~0_448} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:27,577 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] $Ultimate##0-->thread4EXIT: Formula: (and (= v_~s~0_658 (+ v_~s~0_659 1)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_81| 0) (= (+ v_~t~0_401 2) v_~m1~0_157) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_61| 0)) (= (+ v_~m3~0_169 1) v_~m1~0_157) (= v_~t~0_401 v_~m4~0_134) (= (ite (<= v_~m4~0_134 v_~s~0_659) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= v_~t~0_399 (+ 1 v_~m1~0_157)) (= (ite (= (ite (or (not (= (mod v_~b~0_452 256) 0)) (= v_~x~0_268 1)) 1 0) 0) 0 1) v_~b~0_451) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_61| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= |v_thread4Thread1of1ForFork0_#res#1.base_81| 0)) InVars {~b~0=v_~b~0_452, ~x~0=v_~x~0_268, ~s~0=v_~s~0_659, ~t~0=v_~t~0_401} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_81|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_50|, ~m3~0=v_~m3~0_169, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_61|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_85|, ~b~0=v_~b~0_451, ~m4~0=v_~m4~0_134, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|, ~m1~0=v_~m1~0_157, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_81|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_61|, ~x~0=v_~x~0_268, ~s~0=v_~s~0_658, ~t~0=v_~t~0_399, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_95|} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post7#1, ~m3~0, thread1Thread1of1ForFork3_#t~post1#1, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, ~m4~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~m1~0, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [516] L45-->thread2EXIT: Formula: (let ((.cse0 (= v_~x~0_168 1))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_79 v_~s~0_449) 1 0)) (not (= 0 |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_43|)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_43| |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_43|) (= v_~b~0_251 (ite (= (ite (or (not (= (mod v_~b~0_252 256) 0)) .cse0) 1 0) 0) 0 1)) (= v_~s~0_448 (+ v_~s~0_449 1)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_13| 0) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_13|) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_43| (ite (<= v_~m1~0_87 v_~s~0_449) 1 0)) .cse0)) InVars {~b~0=v_~b~0_252, ~m2~0=v_~m2~0_79, ~m1~0=v_~m1~0_87, ~s~0=v_~s~0_449} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_13|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_43|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_43|, ~b~0=v_~b~0_251, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_13|, ~m2~0=v_~m2~0_79, ~m1~0=v_~m1~0_87, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|, ~x~0=v_~x~0_168, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_43|, ~s~0=v_~s~0_448} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:27,819 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:07:27,820 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 973 [2022-12-06 00:07:27,820 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 140 transitions, 2740 flow [2022-12-06 00:07:27,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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 00:07:27,820 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:27,820 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 00:07:27,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-06 00:07:27,820 INFO L420 AbstractCegarLoop]: === Iteration 34 === 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 00:07:27,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:27,821 INFO L85 PathProgramCache]: Analyzing trace with hash -235520068, now seen corresponding path program 1 times [2022-12-06 00:07:27,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:27,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711060707] [2022-12-06 00:07:27,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:27,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:27,935 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 00:07:27,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:27,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711060707] [2022-12-06 00:07:27,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711060707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:27,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:27,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:07:27,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252548606] [2022-12-06 00:07:27,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:27,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:07:27,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:27,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:07:27,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:07:27,937 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:07:27,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 140 transitions, 2740 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 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 00:07:27,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:27,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:07:27,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:28,068 INFO L130 PetriNetUnfolder]: 337/702 cut-off events. [2022-12-06 00:07:28,068 INFO L131 PetriNetUnfolder]: For 8816/8816 co-relation queries the response was YES. [2022-12-06 00:07:28,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5214 conditions, 702 events. 337/702 cut-off events. For 8816/8816 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3617 event pairs, 30 based on Foata normal form. 2/704 useless extension candidates. Maximal degree in co-relation 5051. Up to 694 conditions per place. [2022-12-06 00:07:28,072 INFO L137 encePairwiseOnDemand]: 30/41 looper letters, 131 selfloop transitions, 9 changer transitions 1/141 dead transitions. [2022-12-06 00:07:28,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 141 transitions, 2975 flow [2022-12-06 00:07:28,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:07:28,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:07:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-06 00:07:28,073 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36585365853658536 [2022-12-06 00:07:28,073 INFO L175 Difference]: Start difference. First operand has 107 places, 140 transitions, 2740 flow. Second operand 3 states and 45 transitions. [2022-12-06 00:07:28,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 141 transitions, 2975 flow [2022-12-06 00:07:28,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 141 transitions, 2860 flow, removed 7 selfloop flow, removed 7 redundant places. [2022-12-06 00:07:28,094 INFO L231 Difference]: Finished difference. Result has 102 places, 137 transitions, 2565 flow [2022-12-06 00:07:28,094 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2571, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2565, PETRI_PLACES=102, PETRI_TRANSITIONS=137} [2022-12-06 00:07:28,095 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 63 predicate places. [2022-12-06 00:07:28,095 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:28,095 INFO L89 Accepts]: Start accepts. Operand has 102 places, 137 transitions, 2565 flow [2022-12-06 00:07:28,095 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:28,096 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:28,096 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 137 transitions, 2565 flow [2022-12-06 00:07:28,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 137 transitions, 2565 flow [2022-12-06 00:07:28,116 INFO L130 PetriNetUnfolder]: 60/245 cut-off events. [2022-12-06 00:07:28,117 INFO L131 PetriNetUnfolder]: For 3009/3009 co-relation queries the response was YES. [2022-12-06 00:07:28,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1819 conditions, 245 events. 60/245 cut-off events. For 3009/3009 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1358 event pairs, 3 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 1783. Up to 98 conditions per place. [2022-12-06 00:07:28,118 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 137 transitions, 2565 flow [2022-12-06 00:07:28,118 INFO L188 LiptonReduction]: Number of co-enabled transitions 424 [2022-12-06 00:07:28,128 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [469] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_317 1) v_~s~0_316) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_37| 0) (= v_~b~0_139 (ite (= (ite (or (not (= 0 (mod v_~b~0_140 256))) (= v_~x~0_89 1)) 1 0) 0) 0 1)) (= (ite (<= v_~m4~0_31 v_~s~0_317) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= |v_thread4Thread1of1ForFork0_#res#1.base_37| 0)) InVars {~b~0=v_~b~0_140, ~m4~0=v_~m4~0_31, ~x~0=v_~x~0_89, ~s~0=v_~s~0_317} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_37|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_41|, ~b~0=v_~b~0_139, ~m4~0=v_~m4~0_31, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_37|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, ~x~0=v_~x~0_89, ~s~0=v_~s~0_316} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0] and [478] L67-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| 0)) (= v_~b~0_159 (ite (= (ite (or (= v_~x~0_98 1) (not (= (mod v_~b~0_160 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= (ite (<= v_~m2~0_57 v_~s~0_341) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~s~0_341 1) v_~s~0_340)) InVars {~b~0=v_~b~0_160, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_98, ~s~0=v_~s~0_341} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~b~0=v_~b~0_159, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|, ~x~0=v_~x~0_98, ~s~0=v_~s~0_340} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-06 00:07:28,251 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [469] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_317 1) v_~s~0_316) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_37| 0) (= v_~b~0_139 (ite (= (ite (or (not (= 0 (mod v_~b~0_140 256))) (= v_~x~0_89 1)) 1 0) 0) 0 1)) (= (ite (<= v_~m4~0_31 v_~s~0_317) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= |v_thread4Thread1of1ForFork0_#res#1.base_37| 0)) InVars {~b~0=v_~b~0_140, ~m4~0=v_~m4~0_31, ~x~0=v_~x~0_89, ~s~0=v_~s~0_317} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_37|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_41|, ~b~0=v_~b~0_139, ~m4~0=v_~m4~0_31, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_37|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, ~x~0=v_~x~0_89, ~s~0=v_~s~0_316} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0] and [504] L86-->thread3EXIT: Formula: (and (= v_~s~0_388 (+ v_~s~0_389 1)) (= |v_thread3Thread1of1ForFork2_#res#1.base_27| 0) (= v_~b~0_199 (ite (= (ite (or (not (= (mod v_~b~0_200 256) 0)) (= v_~x~0_128 1)) 1 0) 0) 0 1)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) (= (ite (<= v_~m3~0_59 v_~s~0_389) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_27|)) InVars {~m3~0=v_~m3~0_59, ~b~0=v_~b~0_200, ~x~0=v_~x~0_128, ~s~0=v_~s~0_389} OutVars{~m3~0=v_~m3~0_59, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_27|, ~b~0=v_~b~0_199, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_27|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, ~x~0=v_~x~0_128, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_47|, ~s~0=v_~s~0_388} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0] [2022-12-06 00:07:28,347 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:28,348 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 253 [2022-12-06 00:07:28,348 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 137 transitions, 2605 flow [2022-12-06 00:07:28,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 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 00:07:28,348 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:28,348 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:28,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-06 00:07:28,348 INFO L420 AbstractCegarLoop]: === Iteration 35 === 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 00:07:28,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:28,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1183784797, now seen corresponding path program 1 times [2022-12-06 00:07:28,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:28,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611742649] [2022-12-06 00:07:28,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:28,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:28,460 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 00:07:28,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:28,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611742649] [2022-12-06 00:07:28,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611742649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:28,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:28,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:07:28,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756000802] [2022-12-06 00:07:28,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:28,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:28,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:28,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:28,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:28,462 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 00:07:28,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 137 transitions, 2605 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:28,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:28,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 00:07:28,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:28,606 INFO L130 PetriNetUnfolder]: 335/700 cut-off events. [2022-12-06 00:07:28,606 INFO L131 PetriNetUnfolder]: For 7860/7860 co-relation queries the response was YES. [2022-12-06 00:07:28,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5107 conditions, 700 events. 335/700 cut-off events. For 7860/7860 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3611 event pairs, 30 based on Foata normal form. 4/704 useless extension candidates. Maximal degree in co-relation 5034. Up to 689 conditions per place. [2022-12-06 00:07:28,610 INFO L137 encePairwiseOnDemand]: 29/40 looper letters, 130 selfloop transitions, 8 changer transitions 3/141 dead transitions. [2022-12-06 00:07:28,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 141 transitions, 2896 flow [2022-12-06 00:07:28,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:28,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:28,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 00:07:28,610 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-06 00:07:28,611 INFO L175 Difference]: Start difference. First operand has 100 places, 137 transitions, 2605 flow. Second operand 4 states and 48 transitions. [2022-12-06 00:07:28,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 141 transitions, 2896 flow [2022-12-06 00:07:28,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 141 transitions, 2868 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:28,629 INFO L231 Difference]: Finished difference. Result has 101 places, 135 transitions, 2542 flow [2022-12-06 00:07:28,629 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2577, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2542, PETRI_PLACES=101, PETRI_TRANSITIONS=135} [2022-12-06 00:07:28,630 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 62 predicate places. [2022-12-06 00:07:28,630 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:28,630 INFO L89 Accepts]: Start accepts. Operand has 101 places, 135 transitions, 2542 flow [2022-12-06 00:07:28,630 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:28,630 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:28,631 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 135 transitions, 2542 flow [2022-12-06 00:07:28,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 135 transitions, 2542 flow [2022-12-06 00:07:28,650 INFO L130 PetriNetUnfolder]: 59/243 cut-off events. [2022-12-06 00:07:28,651 INFO L131 PetriNetUnfolder]: For 3041/3041 co-relation queries the response was YES. [2022-12-06 00:07:28,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1809 conditions, 243 events. 59/243 cut-off events. For 3041/3041 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1345 event pairs, 3 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 1719. Up to 98 conditions per place. [2022-12-06 00:07:28,652 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 135 transitions, 2542 flow [2022-12-06 00:07:28,652 INFO L188 LiptonReduction]: Number of co-enabled transitions 420 [2022-12-06 00:07:28,653 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:28,653 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 00:07:28,653 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 135 transitions, 2542 flow [2022-12-06 00:07:28,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:28,654 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:28,654 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:28,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-06 00:07:28,654 INFO L420 AbstractCegarLoop]: === Iteration 36 === 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 00:07:28,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:28,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1781517068, now seen corresponding path program 1 times [2022-12-06 00:07:28,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:28,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035816427] [2022-12-06 00:07:28,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:28,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:28,789 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 00:07:28,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:28,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035816427] [2022-12-06 00:07:28,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035816427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:28,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:28,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:28,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277704245] [2022-12-06 00:07:28,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:28,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:07:28,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:28,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:07:28,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:07:28,791 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 00:07:28,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 135 transitions, 2542 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 00:07:28,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:28,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 00:07:28,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:28,958 INFO L130 PetriNetUnfolder]: 333/698 cut-off events. [2022-12-06 00:07:28,959 INFO L131 PetriNetUnfolder]: For 7440/7440 co-relation queries the response was YES. [2022-12-06 00:07:28,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5073 conditions, 698 events. 333/698 cut-off events. For 7440/7440 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3606 event pairs, 26 based on Foata normal form. 2/700 useless extension candidates. Maximal degree in co-relation 4606. Up to 539 conditions per place. [2022-12-06 00:07:28,964 INFO L137 encePairwiseOnDemand]: 21/39 looper letters, 111 selfloop transitions, 37 changer transitions 4/152 dead transitions. [2022-12-06 00:07:28,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 152 transitions, 3041 flow [2022-12-06 00:07:28,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:28,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:28,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-12-06 00:07:28,967 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3230769230769231 [2022-12-06 00:07:28,967 INFO L175 Difference]: Start difference. First operand has 99 places, 135 transitions, 2542 flow. Second operand 5 states and 63 transitions. [2022-12-06 00:07:28,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 152 transitions, 3041 flow [2022-12-06 00:07:28,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 152 transitions, 3021 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:28,986 INFO L231 Difference]: Finished difference. Result has 101 places, 134 transitions, 2638 flow [2022-12-06 00:07:28,986 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2497, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2638, PETRI_PLACES=101, PETRI_TRANSITIONS=134} [2022-12-06 00:07:28,986 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 62 predicate places. [2022-12-06 00:07:28,986 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:28,986 INFO L89 Accepts]: Start accepts. Operand has 101 places, 134 transitions, 2638 flow [2022-12-06 00:07:28,987 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:28,987 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:28,987 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 134 transitions, 2638 flow [2022-12-06 00:07:28,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 134 transitions, 2638 flow [2022-12-06 00:07:29,008 INFO L130 PetriNetUnfolder]: 58/242 cut-off events. [2022-12-06 00:07:29,008 INFO L131 PetriNetUnfolder]: For 3326/3326 co-relation queries the response was YES. [2022-12-06 00:07:29,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 242 events. 58/242 cut-off events. For 3326/3326 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1354 event pairs, 3 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 1762. Up to 98 conditions per place. [2022-12-06 00:07:29,010 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 134 transitions, 2638 flow [2022-12-06 00:07:29,010 INFO L188 LiptonReduction]: Number of co-enabled transitions 418 [2022-12-06 00:07:29,011 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:29,011 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 00:07:29,011 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 134 transitions, 2638 flow [2022-12-06 00:07:29,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 00:07:29,012 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:29,012 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:29,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-06 00:07:29,012 INFO L420 AbstractCegarLoop]: === Iteration 37 === 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 00:07:29,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:29,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1916113570, now seen corresponding path program 1 times [2022-12-06 00:07:29,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:29,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099203762] [2022-12-06 00:07:29,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:29,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:29,131 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 00:07:29,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:29,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099203762] [2022-12-06 00:07:29,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099203762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:29,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:29,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:29,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500331487] [2022-12-06 00:07:29,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:29,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:07:29,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:29,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:07:29,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:07:29,132 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 00:07:29,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 134 transitions, 2638 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 00:07:29,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:29,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 00:07:29,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:29,294 INFO L130 PetriNetUnfolder]: 271/574 cut-off events. [2022-12-06 00:07:29,294 INFO L131 PetriNetUnfolder]: For 7217/7217 co-relation queries the response was YES. [2022-12-06 00:07:29,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4401 conditions, 574 events. 271/574 cut-off events. For 7217/7217 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2803 event pairs, 12 based on Foata normal form. 12/586 useless extension candidates. Maximal degree in co-relation 1748. Up to 424 conditions per place. [2022-12-06 00:07:29,298 INFO L137 encePairwiseOnDemand]: 22/38 looper letters, 105 selfloop transitions, 29 changer transitions 8/142 dead transitions. [2022-12-06 00:07:29,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 142 transitions, 2895 flow [2022-12-06 00:07:29,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:29,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:29,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-12-06 00:07:29,298 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32105263157894737 [2022-12-06 00:07:29,298 INFO L175 Difference]: Start difference. First operand has 101 places, 134 transitions, 2638 flow. Second operand 5 states and 61 transitions. [2022-12-06 00:07:29,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 142 transitions, 2895 flow [2022-12-06 00:07:29,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 142 transitions, 2693 flow, removed 2 selfloop flow, removed 8 redundant places. [2022-12-06 00:07:29,315 INFO L231 Difference]: Finished difference. Result has 98 places, 123 transitions, 2271 flow [2022-12-06 00:07:29,315 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=2253, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2271, PETRI_PLACES=98, PETRI_TRANSITIONS=123} [2022-12-06 00:07:29,315 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 59 predicate places. [2022-12-06 00:07:29,315 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:29,315 INFO L89 Accepts]: Start accepts. Operand has 98 places, 123 transitions, 2271 flow [2022-12-06 00:07:29,316 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:29,316 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:29,316 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 123 transitions, 2271 flow [2022-12-06 00:07:29,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 123 transitions, 2271 flow [2022-12-06 00:07:29,334 INFO L130 PetriNetUnfolder]: 51/196 cut-off events. [2022-12-06 00:07:29,335 INFO L131 PetriNetUnfolder]: For 2491/2491 co-relation queries the response was YES. [2022-12-06 00:07:29,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1485 conditions, 196 events. 51/196 cut-off events. For 2491/2491 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 943 event pairs, 3 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 1413. Up to 81 conditions per place. [2022-12-06 00:07:29,336 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 123 transitions, 2271 flow [2022-12-06 00:07:29,336 INFO L188 LiptonReduction]: Number of co-enabled transitions 320 [2022-12-06 00:07:29,337 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] $Ultimate##0-->L105: Formula: (and (= (+ v_~t~0_55 1) v_~t~0_54) (= v_~m4~0_7 v_~t~0_55)) InVars {~t~0=v_~t~0_55} OutVars{~m4~0=v_~m4~0_7, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_1|, ~t~0=v_~t~0_54} AuxVars[] AssignedVars[~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~t~0] and [504] L86-->thread3EXIT: Formula: (and (= v_~s~0_388 (+ v_~s~0_389 1)) (= |v_thread3Thread1of1ForFork2_#res#1.base_27| 0) (= v_~b~0_199 (ite (= (ite (or (not (= (mod v_~b~0_200 256) 0)) (= v_~x~0_128 1)) 1 0) 0) 0 1)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) (= (ite (<= v_~m3~0_59 v_~s~0_389) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_27|)) InVars {~m3~0=v_~m3~0_59, ~b~0=v_~b~0_200, ~x~0=v_~x~0_128, ~s~0=v_~s~0_389} OutVars{~m3~0=v_~m3~0_59, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_27|, ~b~0=v_~b~0_199, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_27|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, ~x~0=v_~x~0_128, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_47|, ~s~0=v_~s~0_388} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0] [2022-12-06 00:07:29,402 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] $Ultimate##0-->L105: Formula: (and (= (+ v_~t~0_55 1) v_~t~0_54) (= v_~m4~0_7 v_~t~0_55)) InVars {~t~0=v_~t~0_55} OutVars{~m4~0=v_~m4~0_7, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_1|, ~t~0=v_~t~0_54} AuxVars[] AssignedVars[~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~t~0] and [504] L86-->thread3EXIT: Formula: (and (= v_~s~0_388 (+ v_~s~0_389 1)) (= |v_thread3Thread1of1ForFork2_#res#1.base_27| 0) (= v_~b~0_199 (ite (= (ite (or (not (= (mod v_~b~0_200 256) 0)) (= v_~x~0_128 1)) 1 0) 0) 0 1)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) (= (ite (<= v_~m3~0_59 v_~s~0_389) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_27|)) InVars {~m3~0=v_~m3~0_59, ~b~0=v_~b~0_200, ~x~0=v_~x~0_128, ~s~0=v_~s~0_389} OutVars{~m3~0=v_~m3~0_59, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_27|, ~b~0=v_~b~0_199, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_27|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, ~x~0=v_~x~0_128, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_47|, ~s~0=v_~s~0_388} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0] [2022-12-06 00:07:29,468 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:29,469 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 154 [2022-12-06 00:07:29,469 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 123 transitions, 2291 flow [2022-12-06 00:07:29,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 00:07:29,469 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:29,469 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:29,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-06 00:07:29,469 INFO L420 AbstractCegarLoop]: === Iteration 38 === 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 00:07:29,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:29,470 INFO L85 PathProgramCache]: Analyzing trace with hash 519712221, now seen corresponding path program 1 times [2022-12-06 00:07:29,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:29,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192602173] [2022-12-06 00:07:29,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:29,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:29,594 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 00:07:29,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:29,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192602173] [2022-12-06 00:07:29,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192602173] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:29,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:29,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:07:29,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688746463] [2022-12-06 00:07:29,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:29,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:07:29,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:29,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:07:29,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:07:29,596 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 00:07:29,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 123 transitions, 2291 flow. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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 00:07:29,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:29,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 00:07:29,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:29,810 INFO L130 PetriNetUnfolder]: 151/376 cut-off events. [2022-12-06 00:07:29,810 INFO L131 PetriNetUnfolder]: For 5493/5493 co-relation queries the response was YES. [2022-12-06 00:07:29,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3053 conditions, 376 events. 151/376 cut-off events. For 5493/5493 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1962 event pairs, 3 based on Foata normal form. 52/428 useless extension candidates. Maximal degree in co-relation 1251. Up to 141 conditions per place. [2022-12-06 00:07:29,812 INFO L137 encePairwiseOnDemand]: 18/36 looper letters, 56 selfloop transitions, 41 changer transitions 33/130 dead transitions. [2022-12-06 00:07:29,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 130 transitions, 2371 flow [2022-12-06 00:07:29,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:07:29,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:07:29,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2022-12-06 00:07:29,813 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3159722222222222 [2022-12-06 00:07:29,813 INFO L175 Difference]: Start difference. First operand has 98 places, 123 transitions, 2291 flow. Second operand 8 states and 91 transitions. [2022-12-06 00:07:29,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 130 transitions, 2371 flow [2022-12-06 00:07:29,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 130 transitions, 2256 flow, removed 4 selfloop flow, removed 7 redundant places. [2022-12-06 00:07:29,829 INFO L231 Difference]: Finished difference. Result has 102 places, 83 transitions, 1448 flow [2022-12-06 00:07:29,829 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1711, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1448, PETRI_PLACES=102, PETRI_TRANSITIONS=83} [2022-12-06 00:07:29,829 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 63 predicate places. [2022-12-06 00:07:29,829 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:29,830 INFO L89 Accepts]: Start accepts. Operand has 102 places, 83 transitions, 1448 flow [2022-12-06 00:07:29,830 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:29,830 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:29,830 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 83 transitions, 1448 flow [2022-12-06 00:07:29,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 83 transitions, 1448 flow [2022-12-06 00:07:29,844 INFO L130 PetriNetUnfolder]: 17/103 cut-off events. [2022-12-06 00:07:29,844 INFO L131 PetriNetUnfolder]: For 1625/1651 co-relation queries the response was YES. [2022-12-06 00:07:29,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 103 events. 17/103 cut-off events. For 1625/1651 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 390 event pairs, 2 based on Foata normal form. 1/104 useless extension candidates. Maximal degree in co-relation 771. Up to 45 conditions per place. [2022-12-06 00:07:29,845 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 83 transitions, 1448 flow [2022-12-06 00:07:29,845 INFO L188 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-06 00:07:29,850 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [526] $Ultimate##0-->thread4EXIT: Formula: (and (= v_~b~0_291 (ite (= (ite (or (= v_~x~0_190 1) (not (= 0 (mod v_~b~0_292 256)))) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (= (+ v_~s~0_495 1) v_~s~0_494) (= |v_thread4Thread1of1ForFork0_#res#1.offset_57| 0) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (= v_~t~0_182 v_~m3~0_97) (= v_~t~0_181 (+ v_~t~0_182 1)) (= |v_thread4Thread1of1ForFork0_#res#1.base_57| 0) (= (ite (<= v_~m4~0_82 v_~s~0_495) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|)) InVars {~b~0=v_~b~0_292, ~m4~0=v_~m4~0_82, ~x~0=v_~x~0_190, ~s~0=v_~s~0_495, ~t~0=v_~t~0_182} OutVars{~m3~0=v_~m3~0_97, thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_57|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_61|, ~b~0=v_~b~0_291, ~m4~0=v_~m4~0_82, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_57|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~x~0=v_~x~0_190, ~s~0=v_~s~0_494, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_23|, ~t~0=v_~t~0_181} AuxVars[] AssignedVars[~m3~0, thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] and [478] L67-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| 0)) (= v_~b~0_159 (ite (= (ite (or (= v_~x~0_98 1) (not (= (mod v_~b~0_160 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= (ite (<= v_~m2~0_57 v_~s~0_341) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~s~0_341 1) v_~s~0_340)) InVars {~b~0=v_~b~0_160, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_98, ~s~0=v_~s~0_341} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~b~0=v_~b~0_159, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|, ~x~0=v_~x~0_98, ~s~0=v_~s~0_340} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-06 00:07:29,973 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [383] $Ultimate##0-->L67: Formula: (and (= v_~t~0_46 (+ v_~t~0_47 1)) (= v_~m2~0_11 v_~t~0_47)) InVars {~t~0=v_~t~0_47} OutVars{thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_46} AuxVars[] AssignedVars[~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0] and [591] L105-->thread3EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_#res#1.base_115| 0) (= v_~b~0_547 (ite (= (ite (let ((.cse0 (= v_~x~0_312 1))) (or .cse0 (not (= (mod (ite (= (ite (or .cse0 (not (= (mod v_~b~0_549 256) 0))) 1 0) 0) 0 1) 256) 0)))) 1 0) 0) 0 1)) (= (+ 2 v_~s~0_756) v_~s~0_754) (= |v_thread3Thread1of1ForFork2_#res#1.base_67| 0) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_95| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_67| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_67|) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_67|) (= (ite (<= v_~m4~0_170 v_~s~0_756) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_95| 0)) (= (ite (<= (+ v_~m3~0_197 1) v_~s~0_754) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_67|) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_67| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_115| 0)) InVars {~m3~0=v_~m3~0_197, ~b~0=v_~b~0_549, ~m4~0=v_~m4~0_170, ~x~0=v_~x~0_312, ~s~0=v_~s~0_756} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_67|, thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_115|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_67|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_87|, ~m3~0=v_~m3~0_197, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_67|, ~b~0=v_~b~0_547, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_119|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_67|, ~m4~0=v_~m4~0_170, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_115|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_95|, ~x~0=v_~x~0_312, ~s~0=v_~s~0_754} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread4Thread1of1ForFork0_#t~post8#1, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0] [2022-12-06 00:07:30,078 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [383] $Ultimate##0-->L67: Formula: (and (= v_~t~0_46 (+ v_~t~0_47 1)) (= v_~m2~0_11 v_~t~0_47)) InVars {~t~0=v_~t~0_47} OutVars{thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_46} AuxVars[] AssignedVars[~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0] and [504] L86-->thread3EXIT: Formula: (and (= v_~s~0_388 (+ v_~s~0_389 1)) (= |v_thread3Thread1of1ForFork2_#res#1.base_27| 0) (= v_~b~0_199 (ite (= (ite (or (not (= (mod v_~b~0_200 256) 0)) (= v_~x~0_128 1)) 1 0) 0) 0 1)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) (= (ite (<= v_~m3~0_59 v_~s~0_389) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_27|)) InVars {~m3~0=v_~m3~0_59, ~b~0=v_~b~0_200, ~x~0=v_~x~0_128, ~s~0=v_~s~0_389} OutVars{~m3~0=v_~m3~0_59, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_27|, ~b~0=v_~b~0_199, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_27|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, ~x~0=v_~x~0_128, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_47|, ~s~0=v_~s~0_388} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0] [2022-12-06 00:07:30,145 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [525] $Ultimate##0-->L45: Formula: (and (= v_~t~0_177 v_~m3~0_95) (= (+ v_~t~0_177 1) v_~m1~0_109) (= v_~t~0_175 (+ v_~t~0_177 2))) InVars {~t~0=v_~t~0_177} OutVars{~m3~0=v_~m3~0_95, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_21|, ~m1~0=v_~m1~0_109, ~t~0=v_~t~0_175, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_21|} AuxVars[] AssignedVars[~m3~0, thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [595] $Ultimate##0-->thread3EXIT: Formula: (and (= (ite (<= (+ v_~m3~0_205 1) v_~s~0_774) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_73|) (= v_~t~0_491 (+ v_~t~0_492 1)) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_99| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_73| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_73|) (= v_~t~0_492 v_~m2~0_190) (= v_~b~0_567 (ite (= (ite (let ((.cse0 (= v_~x~0_320 1))) (or (not (= (mod (ite (= (ite (or (not (= (mod v_~b~0_568 256) 0)) .cse0) 1 0) 0) 0 1) 256) 0)) .cse0)) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork2_#res#1.base_73| 0) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_99| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread4Thread1of1ForFork0_#res#1.base_119| 0) (= |v_thread4Thread1of1ForFork0_#res#1.offset_119| 0) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_73| 0)) (= (ite (<= v_~m4~0_178 v_~s~0_775) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_73|) (= v_~s~0_774 (+ 2 v_~s~0_775))) InVars {~m3~0=v_~m3~0_205, ~b~0=v_~b~0_568, ~m4~0=v_~m4~0_178, ~x~0=v_~x~0_320, ~s~0=v_~s~0_775, ~t~0=v_~t~0_492} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_73|, thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_119|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_73|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_74|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_93|, ~m3~0=v_~m3~0_205, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_73|, ~b~0=v_~b~0_567, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_123|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_73|, ~m4~0=v_~m4~0_178, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~m2~0=v_~m2~0_190, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_119|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_99|, ~x~0=v_~x~0_320, ~s~0=v_~s~0_774, ~t~0=v_~t~0_491} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread3Thread1of1ForFork2_#t~post6#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread4Thread1of1ForFork0_#t~post8#1, thread3Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~m2~0, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~t~0] [2022-12-06 00:07:30,284 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_43) (= v_~t~0_42 (+ v_~t~0_43 1))) InVars {~t~0=v_~t~0_43} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_1|, ~t~0=v_~t~0_42} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] and [478] L67-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| 0)) (= v_~b~0_159 (ite (= (ite (or (= v_~x~0_98 1) (not (= (mod v_~b~0_160 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= (ite (<= v_~m2~0_57 v_~s~0_341) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~s~0_341 1) v_~s~0_340)) InVars {~b~0=v_~b~0_160, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_98, ~s~0=v_~s~0_341} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~b~0=v_~b~0_159, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|, ~x~0=v_~x~0_98, ~s~0=v_~s~0_340} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-06 00:07:30,335 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] $Ultimate##0-->L105: Formula: (and (= (+ v_~t~0_55 1) v_~t~0_54) (= v_~m4~0_7 v_~t~0_55)) InVars {~t~0=v_~t~0_55} OutVars{~m4~0=v_~m4~0_7, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_1|, ~t~0=v_~t~0_54} AuxVars[] AssignedVars[~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~t~0] and [597] $Ultimate##0-->thread3EXIT: Formula: (and (= v_~m2~0_194 (+ v_~t~0_501 2)) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_101| 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_77| 0)) (= (ite (<= v_~m4~0_180 v_~s~0_783) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_101|) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_77|) (= (ite (<= (+ v_~m3~0_209 1) v_~s~0_782) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_77|) (= v_~t~0_499 (+ v_~t~0_501 3)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_77| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_77|) (= v_~b~0_575 (ite (= (ite (let ((.cse0 (= v_~x~0_324 1))) (or .cse0 (not (= (mod (ite (= (ite (or (not (= (mod v_~b~0_576 256) 0)) .cse0) 1 0) 0) 0 1) 256) 0)))) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_101| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_101|) (= v_~t~0_501 v_~m3~0_209) (= |v_thread3Thread1of1ForFork2_#res#1.base_77| 0) (= (+ 2 v_~s~0_783) v_~s~0_782) (= (+ v_~t~0_501 1) v_~m1~0_185) (= |v_thread4Thread1of1ForFork0_#res#1.base_121| 0) (= |v_thread4Thread1of1ForFork0_#res#1.offset_121| 0)) InVars {~b~0=v_~b~0_576, ~m4~0=v_~m4~0_180, ~x~0=v_~x~0_324, ~s~0=v_~s~0_783, ~t~0=v_~t~0_501} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_77|, thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_121|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_77|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_78|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_97|, ~m3~0=v_~m3~0_209, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_89|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_77|, ~b~0=v_~b~0_575, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_125|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_77|, ~m4~0=v_~m4~0_180, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_101|, ~m2~0=v_~m2~0_194, ~m1~0=v_~m1~0_185, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_121|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_101|, ~x~0=v_~x~0_324, ~s~0=v_~s~0_782, ~t~0=v_~t~0_499, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_117|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread3Thread1of1ForFork2_#t~post6#1, ~m3~0, thread1Thread1of1ForFork3_#t~post1#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread4Thread1of1ForFork0_#t~post8#1, thread3Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~m2~0, ~m1~0, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] [2022-12-06 00:07:30,526 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 00:07:30,526 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 697 [2022-12-06 00:07:30,526 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 81 transitions, 1413 flow [2022-12-06 00:07:30,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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 00:07:30,527 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:30,527 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:30,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-06 00:07:30,527 INFO L420 AbstractCegarLoop]: === Iteration 39 === 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 00:07:30,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:30,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1095204969, now seen corresponding path program 1 times [2022-12-06 00:07:30,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:30,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476240161] [2022-12-06 00:07:30,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:30,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:30,637 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 00:07:30,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:30,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476240161] [2022-12-06 00:07:30,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476240161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:30,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:30,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:07:30,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615702765] [2022-12-06 00:07:30,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:30,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:30,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:30,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:30,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:30,639 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 00:07:30,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 81 transitions, 1413 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:30,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:30,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 00:07:30,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:30,730 INFO L130 PetriNetUnfolder]: 104/261 cut-off events. [2022-12-06 00:07:30,730 INFO L131 PetriNetUnfolder]: For 3354/3354 co-relation queries the response was YES. [2022-12-06 00:07:30,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2072 conditions, 261 events. 104/261 cut-off events. For 3354/3354 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1126 event pairs, 4 based on Foata normal form. 2/263 useless extension candidates. Maximal degree in co-relation 1801. Up to 250 conditions per place. [2022-12-06 00:07:30,732 INFO L137 encePairwiseOnDemand]: 29/34 looper letters, 79 selfloop transitions, 3 changer transitions 3/85 dead transitions. [2022-12-06 00:07:30,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 85 transitions, 1592 flow [2022-12-06 00:07:30,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:30,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:30,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 00:07:30,733 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3014705882352941 [2022-12-06 00:07:30,733 INFO L175 Difference]: Start difference. First operand has 100 places, 81 transitions, 1413 flow. Second operand 4 states and 41 transitions. [2022-12-06 00:07:30,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 85 transitions, 1592 flow [2022-12-06 00:07:30,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 85 transitions, 1370 flow, removed 39 selfloop flow, removed 13 redundant places. [2022-12-06 00:07:30,747 INFO L231 Difference]: Finished difference. Result has 91 places, 79 transitions, 1161 flow [2022-12-06 00:07:30,747 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1191, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1161, PETRI_PLACES=91, PETRI_TRANSITIONS=79} [2022-12-06 00:07:30,747 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 52 predicate places. [2022-12-06 00:07:30,747 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:30,747 INFO L89 Accepts]: Start accepts. Operand has 91 places, 79 transitions, 1161 flow [2022-12-06 00:07:30,748 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:30,748 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:30,748 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 79 transitions, 1161 flow [2022-12-06 00:07:30,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 79 transitions, 1161 flow [2022-12-06 00:07:30,756 INFO L130 PetriNetUnfolder]: 16/98 cut-off events. [2022-12-06 00:07:30,757 INFO L131 PetriNetUnfolder]: For 1042/1066 co-relation queries the response was YES. [2022-12-06 00:07:30,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 98 events. 16/98 cut-off events. For 1042/1066 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 350 event pairs, 2 based on Foata normal form. 1/99 useless extension candidates. Maximal degree in co-relation 636. Up to 41 conditions per place. [2022-12-06 00:07:30,757 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 79 transitions, 1161 flow [2022-12-06 00:07:30,757 INFO L188 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-06 00:07:30,758 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] $Ultimate##0-->L45: Formula: (and (= (+ v_~t~0_51 1) v_~t~0_50) (= v_~m1~0_9 v_~t~0_51)) InVars {~t~0=v_~t~0_51} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_50} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~t~0] and [504] L86-->thread3EXIT: Formula: (and (= v_~s~0_388 (+ v_~s~0_389 1)) (= |v_thread3Thread1of1ForFork2_#res#1.base_27| 0) (= v_~b~0_199 (ite (= (ite (or (not (= (mod v_~b~0_200 256) 0)) (= v_~x~0_128 1)) 1 0) 0) 0 1)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) (= (ite (<= v_~m3~0_59 v_~s~0_389) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_27|)) InVars {~m3~0=v_~m3~0_59, ~b~0=v_~b~0_200, ~x~0=v_~x~0_128, ~s~0=v_~s~0_389} OutVars{~m3~0=v_~m3~0_59, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_27|, ~b~0=v_~b~0_199, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_27|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, ~x~0=v_~x~0_128, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_47|, ~s~0=v_~s~0_388} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0] [2022-12-06 00:07:30,810 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] $Ultimate##0-->L45: Formula: (and (= (+ v_~t~0_51 1) v_~t~0_50) (= v_~m1~0_9 v_~t~0_51)) InVars {~t~0=v_~t~0_51} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_50} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~t~0] and [594] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97| (ite (<= v_~m4~0_176 v_~s~0_770) 1 0)) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_97| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|) (= |v_thread4Thread1of1ForFork0_#res#1.base_117| 0) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_87|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_87| 0) (= v_~b~0_561 (ite (= (ite (let ((.cse0 (= v_~x~0_318 1))) (or (not (= (mod (ite (= (ite (or (not (= (mod v_~b~0_563 256) 0)) .cse0) 1 0) 0) 0 1) 256) 0)) .cse0)) 1 0) 0) 0 1)) (= v_~t~0_487 (+ v_~t~0_488 1)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_117| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_115| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_115|) (= v_~t~0_488 v_~m3~0_203) (= (+ 2 v_~s~0_770) v_~s~0_768) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_115| 0)) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_97| 0)) (= (ite (<= v_~m2~0_188 (+ v_~s~0_770 1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_115|)) InVars {~b~0=v_~b~0_563, ~m4~0=v_~m4~0_176, ~m2~0=v_~m2~0_188, ~x~0=v_~x~0_318, ~s~0=v_~s~0_770, ~t~0=v_~t~0_488} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_117|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_117|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_87|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_115|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_115|, ~m3~0=v_~m3~0_203, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_87|, ~b~0=v_~b~0_561, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_121|, ~m4~0=v_~m4~0_176, ~m2~0=v_~m2~0_188, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_117|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_97|, ~x~0=v_~x~0_318, ~s~0=v_~s~0_768, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_115|, ~t~0=v_~t~0_487} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~m3~0, thread2Thread1of1ForFork1_#res#1.base, ~b~0, thread4Thread1of1ForFork0_#t~post8#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] [2022-12-06 00:07:30,928 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] $Ultimate##0-->L45: Formula: (and (= (+ v_~t~0_51 1) v_~t~0_50) (= v_~m1~0_9 v_~t~0_51)) InVars {~t~0=v_~t~0_51} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_50} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~t~0] and [504] L86-->thread3EXIT: Formula: (and (= v_~s~0_388 (+ v_~s~0_389 1)) (= |v_thread3Thread1of1ForFork2_#res#1.base_27| 0) (= v_~b~0_199 (ite (= (ite (or (not (= (mod v_~b~0_200 256) 0)) (= v_~x~0_128 1)) 1 0) 0) 0 1)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) (= (ite (<= v_~m3~0_59 v_~s~0_389) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_27|)) InVars {~m3~0=v_~m3~0_59, ~b~0=v_~b~0_200, ~x~0=v_~x~0_128, ~s~0=v_~s~0_389} OutVars{~m3~0=v_~m3~0_59, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_27|, ~b~0=v_~b~0_199, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_27|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, ~x~0=v_~x~0_128, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_47|, ~s~0=v_~s~0_388} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0] [2022-12-06 00:07:30,986 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] $Ultimate##0-->L45: Formula: (and (= (+ v_~t~0_51 1) v_~t~0_50) (= v_~m1~0_9 v_~t~0_51)) InVars {~t~0=v_~t~0_51} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_50} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~t~0] and [469] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_317 1) v_~s~0_316) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_37| 0) (= v_~b~0_139 (ite (= (ite (or (not (= 0 (mod v_~b~0_140 256))) (= v_~x~0_89 1)) 1 0) 0) 0 1)) (= (ite (<= v_~m4~0_31 v_~s~0_317) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= |v_thread4Thread1of1ForFork0_#res#1.base_37| 0)) InVars {~b~0=v_~b~0_140, ~m4~0=v_~m4~0_31, ~x~0=v_~x~0_89, ~s~0=v_~s~0_317} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_37|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_41|, ~b~0=v_~b~0_139, ~m4~0=v_~m4~0_31, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_37|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, ~x~0=v_~x~0_89, ~s~0=v_~s~0_316} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:31,039 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:31,039 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 292 [2022-12-06 00:07:31,039 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 79 transitions, 1187 flow [2022-12-06 00:07:31,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:31,040 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:31,040 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:31,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-06 00:07:31,040 INFO L420 AbstractCegarLoop]: === Iteration 40 === 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 00:07:31,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:31,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1498723353, now seen corresponding path program 1 times [2022-12-06 00:07:31,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:31,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637038272] [2022-12-06 00:07:31,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:31,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:31,178 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 00:07:31,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:31,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637038272] [2022-12-06 00:07:31,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637038272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:31,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:31,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:31,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673708916] [2022-12-06 00:07:31,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:31,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:31,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:31,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:31,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:31,180 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 00:07:31,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 79 transitions, 1187 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 00:07:31,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:31,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 00:07:31,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:31,317 INFO L130 PetriNetUnfolder]: 100/253 cut-off events. [2022-12-06 00:07:31,317 INFO L131 PetriNetUnfolder]: For 1494/1494 co-relation queries the response was YES. [2022-12-06 00:07:31,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1759 conditions, 253 events. 100/253 cut-off events. For 1494/1494 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1070 event pairs, 4 based on Foata normal form. 2/255 useless extension candidates. Maximal degree in co-relation 1728. Up to 233 conditions per place. [2022-12-06 00:07:31,319 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 79 selfloop transitions, 5 changer transitions 3/87 dead transitions. [2022-12-06 00:07:31,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 87 transitions, 1418 flow [2022-12-06 00:07:31,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:07:31,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:07:31,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-12-06 00:07:31,320 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21904761904761905 [2022-12-06 00:07:31,320 INFO L175 Difference]: Start difference. First operand has 88 places, 79 transitions, 1187 flow. Second operand 6 states and 46 transitions. [2022-12-06 00:07:31,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 87 transitions, 1418 flow [2022-12-06 00:07:31,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 87 transitions, 1376 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-12-06 00:07:31,331 INFO L231 Difference]: Finished difference. Result has 89 places, 79 transitions, 1153 flow [2022-12-06 00:07:31,331 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1153, PETRI_PLACES=89, PETRI_TRANSITIONS=79} [2022-12-06 00:07:31,332 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 50 predicate places. [2022-12-06 00:07:31,332 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:31,332 INFO L89 Accepts]: Start accepts. Operand has 89 places, 79 transitions, 1153 flow [2022-12-06 00:07:31,332 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:31,332 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:31,333 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 79 transitions, 1153 flow [2022-12-06 00:07:31,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 79 transitions, 1153 flow [2022-12-06 00:07:31,343 INFO L130 PetriNetUnfolder]: 15/97 cut-off events. [2022-12-06 00:07:31,344 INFO L131 PetriNetUnfolder]: For 608/608 co-relation queries the response was YES. [2022-12-06 00:07:31,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 97 events. 15/97 cut-off events. For 608/608 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 354 event pairs, 2 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 604. Up to 41 conditions per place. [2022-12-06 00:07:31,345 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 79 transitions, 1153 flow [2022-12-06 00:07:31,345 INFO L188 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-06 00:07:31,346 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] $Ultimate##0-->L105: Formula: (and (= (+ v_~t~0_55 1) v_~t~0_54) (= v_~m4~0_7 v_~t~0_55)) InVars {~t~0=v_~t~0_55} OutVars{~m4~0=v_~m4~0_7, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_1|, ~t~0=v_~t~0_54} AuxVars[] AssignedVars[~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~t~0] and [383] $Ultimate##0-->L67: Formula: (and (= v_~t~0_46 (+ v_~t~0_47 1)) (= v_~m2~0_11 v_~t~0_47)) InVars {~t~0=v_~t~0_47} OutVars{thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_46} AuxVars[] AssignedVars[~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0] [2022-12-06 00:07:31,370 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] $Ultimate##0-->L67: Formula: (and (= v_~t~0_535 v_~m4~0_188) (= v_~t~0_533 (+ v_~m2~0_202 1)) (= v_~t~0_533 (+ v_~t~0_535 2))) InVars {~t~0=v_~t~0_535} OutVars{~m4~0=v_~m4~0_188, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_78|, ~m2~0=v_~m2~0_202, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_82|, ~t~0=v_~t~0_533} AuxVars[] AssignedVars[~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0] and [603] $Ultimate##0-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_107| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107|) (= |v_thread4Thread1of1ForFork0_#res#1.base_127| 0) (= (+ v_~s~0_807 1) v_~s~0_806) (= (ite (<= v_~m4~0_186 v_~s~0_807) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107|) (= v_~t~0_530 v_~m1~0_195) (= |v_thread4Thread1of1ForFork0_#res#1.offset_127| 0) (= v_~b~0_599 (ite (= (ite (or (= v_~x~0_336 1) (not (= (mod v_~b~0_600 256) 0))) 1 0) 0) 0 1)) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_107| 0)) (= v_~t~0_529 (+ v_~t~0_530 1))) InVars {~b~0=v_~b~0_600, ~m4~0=v_~m4~0_186, ~x~0=v_~x~0_336, ~s~0=v_~s~0_807, ~t~0=v_~t~0_530} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_127|, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_99|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_131|, ~b~0=v_~b~0_599, ~m4~0=v_~m4~0_186, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107|, ~m1~0=v_~m1~0_195, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_127|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_107|, ~x~0=v_~x~0_336, ~s~0=v_~s~0_806, ~t~0=v_~t~0_529} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork3_#t~post1#1, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~m1~0, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~t~0] [2022-12-06 00:07:31,472 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_43) (= v_~t~0_42 (+ v_~t~0_43 1))) InVars {~t~0=v_~t~0_43} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_1|, ~t~0=v_~t~0_42} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] and [395] $Ultimate##0-->L105: Formula: (and (= (+ v_~t~0_55 1) v_~t~0_54) (= v_~m4~0_7 v_~t~0_55)) InVars {~t~0=v_~t~0_55} OutVars{~m4~0=v_~m4~0_7, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_1|, ~t~0=v_~t~0_54} AuxVars[] AssignedVars[~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~t~0] [2022-12-06 00:07:31,494 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] $Ultimate##0-->L86: Formula: (and (= v_~m3~0_9 v_~t~0_43) (= v_~t~0_42 (+ v_~t~0_43 1))) InVars {~t~0=v_~t~0_43} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_1|, ~t~0=v_~t~0_42} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] and [383] $Ultimate##0-->L67: Formula: (and (= v_~t~0_46 (+ v_~t~0_47 1)) (= v_~m2~0_11 v_~t~0_47)) InVars {~t~0=v_~t~0_47} OutVars{thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_46} AuxVars[] AssignedVars[~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0] [2022-12-06 00:07:31,578 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] $Ultimate##0-->L105: Formula: (and (= v_~t~0_545 (+ v_~m4~0_192 1)) (= (+ v_~t~0_547 1) v_~m4~0_192) (= v_~t~0_547 v_~m3~0_221)) InVars {~t~0=v_~t~0_547} OutVars{~m3~0=v_~m3~0_221, ~m4~0=v_~m4~0_192, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_82|, ~t~0=v_~t~0_545, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_125|} AuxVars[] AssignedVars[~m3~0, ~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [600] $Ultimate##0-->thread3EXIT: Formula: (and (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_81|) (= (+ v_~s~0_795 1) v_~s~0_794) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_81| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_81| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_81|) (= (ite (<= v_~m3~0_215 v_~s~0_795) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_81|) (= |v_thread3Thread1of1ForFork2_#res#1.base_81| 0) (= (ite (= (ite (or (= v_~x~0_330 1) (not (= (mod v_~b~0_588 256) 0))) 1 0) 0) 0 1) v_~b~0_587) (= v_~t~0_516 v_~m1~0_189) (= v_~t~0_515 (+ v_~t~0_516 1))) InVars {~m3~0=v_~m3~0_215, ~b~0=v_~b~0_588, ~x~0=v_~x~0_330, ~s~0=v_~s~0_795, ~t~0=v_~t~0_516} OutVars{~m3~0=v_~m3~0_215, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_81|, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_93|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_81|, ~b~0=v_~b~0_587, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_81|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_81|, ~m1~0=v_~m1~0_189, ~x~0=v_~x~0_330, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_101|, ~s~0=v_~s~0_794, ~t~0=v_~t~0_515} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork3_#t~post1#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~m1~0, thread3Thread1of1ForFork2_#t~post6#1, ~s~0, ~t~0] [2022-12-06 00:07:31,646 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] $Ultimate##0-->L105: Formula: (and (= v_~t~0_545 (+ v_~m4~0_192 1)) (= (+ v_~t~0_547 1) v_~m4~0_192) (= v_~t~0_547 v_~m3~0_221)) InVars {~t~0=v_~t~0_547} OutVars{~m3~0=v_~m3~0_221, ~m4~0=v_~m4~0_192, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_82|, ~t~0=v_~t~0_545, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_125|} AuxVars[] AssignedVars[~m3~0, ~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [596] $Ultimate##0-->thread3EXIT: Formula: (and (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_75|) (= (ite (<= v_~m3~0_207 v_~s~0_779) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_75|) (= (+ v_~s~0_779 1) v_~s~0_778) (= v_~t~0_496 v_~m2~0_192) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_75| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_75|) (= (ite (= (ite (or (= v_~x~0_322 1) (not (= (mod v_~b~0_572 256) 0))) 1 0) 0) 0 1) v_~b~0_571) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_75| 0)) (= (+ v_~t~0_496 1) v_~t~0_495) (= |v_thread3Thread1of1ForFork2_#res#1.base_75| 0)) InVars {~m3~0=v_~m3~0_207, ~b~0=v_~b~0_572, ~x~0=v_~x~0_322, ~s~0=v_~s~0_779, ~t~0=v_~t~0_496} OutVars{~m3~0=v_~m3~0_207, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_75|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_75|, ~b~0=v_~b~0_571, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_75|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_75|, ~m2~0=v_~m2~0_192, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_76|, ~x~0=v_~x~0_322, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_95|, ~s~0=v_~s~0_778, ~t~0=v_~t~0_495} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~m2~0, thread2Thread1of1ForFork1_#t~post3#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0, ~t~0] [2022-12-06 00:07:31,716 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] $Ultimate##0-->L105: Formula: (and (= v_~t~0_545 (+ v_~m4~0_192 1)) (= (+ v_~t~0_547 1) v_~m4~0_192) (= v_~t~0_547 v_~m3~0_221)) InVars {~t~0=v_~t~0_547} OutVars{~m3~0=v_~m3~0_221, ~m4~0=v_~m4~0_192, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_82|, ~t~0=v_~t~0_545, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_125|} AuxVars[] AssignedVars[~m3~0, ~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [504] L86-->thread3EXIT: Formula: (and (= v_~s~0_388 (+ v_~s~0_389 1)) (= |v_thread3Thread1of1ForFork2_#res#1.base_27| 0) (= v_~b~0_199 (ite (= (ite (or (not (= (mod v_~b~0_200 256) 0)) (= v_~x~0_128 1)) 1 0) 0) 0 1)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) (= (ite (<= v_~m3~0_59 v_~s~0_389) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_27|)) InVars {~m3~0=v_~m3~0_59, ~b~0=v_~b~0_200, ~x~0=v_~x~0_128, ~s~0=v_~s~0_389} OutVars{~m3~0=v_~m3~0_59, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_27|, ~b~0=v_~b~0_199, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_27|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, ~x~0=v_~x~0_128, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_47|, ~s~0=v_~s~0_388} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0] [2022-12-06 00:07:31,776 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [607] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_206 (+ v_~t~0_553 1)) (= v_~t~0_553 v_~m3~0_223) (= v_~t~0_551 (+ v_~t~0_553 2))) InVars {~t~0=v_~t~0_553} OutVars{~m3~0=v_~m3~0_223, ~m2~0=v_~m2~0_206, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_86|, ~t~0=v_~t~0_551, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_127|} AuxVars[] AssignedVars[~m3~0, ~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [592] $Ultimate##0-->thread3EXIT: Formula: (and (= (ite (<= v_~m3~0_199 v_~s~0_761) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_69|) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_69|) (= (+ v_~s~0_761 1) v_~s~0_760) (= v_~t~0_479 (+ v_~t~0_480 1)) (= |v_thread3Thread1of1ForFork2_#res#1.base_69| 0) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| 0)) (= v_~t~0_480 v_~m4~0_172) (= (ite (= (ite (or (= v_~x~0_314 1) (not (= (mod v_~b~0_554 256) 0))) 1 0) 0) 0 1) v_~b~0_553) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_69|)) InVars {~m3~0=v_~m3~0_199, ~b~0=v_~b~0_554, ~x~0=v_~x~0_314, ~s~0=v_~s~0_761, ~t~0=v_~t~0_480} OutVars{~m3~0=v_~m3~0_199, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_69|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_69|, ~b~0=v_~b~0_553, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_69|, ~m4~0=v_~m4~0_172, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_72|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, ~x~0=v_~x~0_314, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_89|, ~s~0=v_~s~0_760, ~t~0=v_~t~0_479} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, ~m4~0, thread4Thread1of1ForFork0_#t~post7#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0, ~t~0] [2022-12-06 00:07:31,845 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [607] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_206 (+ v_~t~0_553 1)) (= v_~t~0_553 v_~m3~0_223) (= v_~t~0_551 (+ v_~t~0_553 2))) InVars {~t~0=v_~t~0_553} OutVars{~m3~0=v_~m3~0_223, ~m2~0=v_~m2~0_206, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_86|, ~t~0=v_~t~0_551, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_127|} AuxVars[] AssignedVars[~m3~0, ~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [602] $Ultimate##0-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_83| 0)) (= (+ v_~s~0_803 1) v_~s~0_802) (= v_~t~0_526 v_~m1~0_193) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_83| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_83|) (= |v_thread3Thread1of1ForFork2_#res#1.base_83| 0) (= v_~t~0_525 (+ v_~t~0_526 1)) (= v_~b~0_595 (ite (= (ite (or (= v_~x~0_334 1) (not (= 0 (mod v_~b~0_596 256)))) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_83| (ite (<= v_~m3~0_219 v_~s~0_803) 1 0)) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_83|)) InVars {~m3~0=v_~m3~0_219, ~b~0=v_~b~0_596, ~x~0=v_~x~0_334, ~s~0=v_~s~0_803, ~t~0=v_~t~0_526} OutVars{~m3~0=v_~m3~0_219, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_83|, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_97|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_83|, ~b~0=v_~b~0_595, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_83|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_83|, ~m1~0=v_~m1~0_193, ~x~0=v_~x~0_334, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_103|, ~s~0=v_~s~0_802, ~t~0=v_~t~0_525} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork3_#t~post1#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~m1~0, thread3Thread1of1ForFork2_#t~post6#1, ~s~0, ~t~0] [2022-12-06 00:07:31,923 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 00:07:31,923 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 591 [2022-12-06 00:07:31,924 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 76 transitions, 1080 flow [2022-12-06 00:07:31,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 00:07:31,924 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:31,924 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:31,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-06 00:07:31,924 INFO L420 AbstractCegarLoop]: === Iteration 41 === 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 00:07:31,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:31,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1831003871, now seen corresponding path program 1 times [2022-12-06 00:07:31,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:31,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498027171] [2022-12-06 00:07:31,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:31,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:32,047 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 00:07:32,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:32,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498027171] [2022-12-06 00:07:32,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498027171] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:32,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:32,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:32,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912161376] [2022-12-06 00:07:32,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:32,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:07:32,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:32,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:07:32,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:07:32,049 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 00:07:32,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 76 transitions, 1080 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 00:07:32,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:32,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 00:07:32,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:32,168 INFO L130 PetriNetUnfolder]: 91/232 cut-off events. [2022-12-06 00:07:32,168 INFO L131 PetriNetUnfolder]: For 2292/2292 co-relation queries the response was YES. [2022-12-06 00:07:32,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1618 conditions, 232 events. 91/232 cut-off events. For 2292/2292 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 992 event pairs, 4 based on Foata normal form. 2/234 useless extension candidates. Maximal degree in co-relation 1599. Up to 154 conditions per place. [2022-12-06 00:07:32,170 INFO L137 encePairwiseOnDemand]: 23/38 looper letters, 60 selfloop transitions, 20 changer transitions 2/82 dead transitions. [2022-12-06 00:07:32,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 82 transitions, 1239 flow [2022-12-06 00:07:32,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:32,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:32,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-12-06 00:07:32,171 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26842105263157895 [2022-12-06 00:07:32,171 INFO L175 Difference]: Start difference. First operand has 83 places, 76 transitions, 1080 flow. Second operand 5 states and 51 transitions. [2022-12-06 00:07:32,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 82 transitions, 1239 flow [2022-12-06 00:07:32,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 82 transitions, 1123 flow, removed 44 selfloop flow, removed 5 redundant places. [2022-12-06 00:07:32,179 INFO L231 Difference]: Finished difference. Result has 82 places, 74 transitions, 972 flow [2022-12-06 00:07:32,180 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=972, PETRI_PLACES=82, PETRI_TRANSITIONS=74} [2022-12-06 00:07:32,180 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 43 predicate places. [2022-12-06 00:07:32,180 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:32,180 INFO L89 Accepts]: Start accepts. Operand has 82 places, 74 transitions, 972 flow [2022-12-06 00:07:32,181 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:32,181 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:32,181 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 74 transitions, 972 flow [2022-12-06 00:07:32,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 74 transitions, 972 flow [2022-12-06 00:07:32,192 INFO L130 PetriNetUnfolder]: 14/91 cut-off events. [2022-12-06 00:07:32,192 INFO L131 PetriNetUnfolder]: For 547/552 co-relation queries the response was YES. [2022-12-06 00:07:32,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 91 events. 14/91 cut-off events. For 547/552 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 324 event pairs, 2 based on Foata normal form. 1/92 useless extension candidates. Maximal degree in co-relation 525. Up to 37 conditions per place. [2022-12-06 00:07:32,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 74 transitions, 972 flow [2022-12-06 00:07:32,193 INFO L188 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-06 00:07:32,195 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:32,196 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 00:07:32,197 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 972 flow [2022-12-06 00:07:32,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 00:07:32,197 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:32,197 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:32,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-06 00:07:32,197 INFO L420 AbstractCegarLoop]: === Iteration 42 === 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 00:07:32,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:32,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1947612677, now seen corresponding path program 1 times [2022-12-06 00:07:32,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:32,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370931533] [2022-12-06 00:07:32,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:32,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:32,330 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 00:07:32,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:32,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370931533] [2022-12-06 00:07:32,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370931533] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:32,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:32,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:32,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815932700] [2022-12-06 00:07:32,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:32,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:32,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:32,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:32,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:32,332 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 00:07:32,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 972 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 00:07:32,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:32,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 00:07:32,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:32,471 INFO L130 PetriNetUnfolder]: 89/230 cut-off events. [2022-12-06 00:07:32,471 INFO L131 PetriNetUnfolder]: For 1219/1219 co-relation queries the response was YES. [2022-12-06 00:07:32,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1494 conditions, 230 events. 89/230 cut-off events. For 1219/1219 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 982 event pairs, 2 based on Foata normal form. 2/232 useless extension candidates. Maximal degree in co-relation 1269. Up to 95 conditions per place. [2022-12-06 00:07:32,472 INFO L137 encePairwiseOnDemand]: 16/37 looper letters, 47 selfloop transitions, 36 changer transitions 4/87 dead transitions. [2022-12-06 00:07:32,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 87 transitions, 1206 flow [2022-12-06 00:07:32,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:07:32,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:07:32,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-12-06 00:07:32,473 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2927927927927928 [2022-12-06 00:07:32,473 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 972 flow. Second operand 6 states and 65 transitions. [2022-12-06 00:07:32,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 87 transitions, 1206 flow [2022-12-06 00:07:32,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 87 transitions, 1177 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:32,481 INFO L231 Difference]: Finished difference. Result has 83 places, 74 transitions, 1046 flow [2022-12-06 00:07:32,481 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1046, PETRI_PLACES=83, PETRI_TRANSITIONS=74} [2022-12-06 00:07:32,482 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 44 predicate places. [2022-12-06 00:07:32,482 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:32,482 INFO L89 Accepts]: Start accepts. Operand has 83 places, 74 transitions, 1046 flow [2022-12-06 00:07:32,482 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:32,483 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:32,483 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 74 transitions, 1046 flow [2022-12-06 00:07:32,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 74 transitions, 1046 flow [2022-12-06 00:07:32,492 INFO L130 PetriNetUnfolder]: 13/89 cut-off events. [2022-12-06 00:07:32,492 INFO L131 PetriNetUnfolder]: For 627/662 co-relation queries the response was YES. [2022-12-06 00:07:32,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 89 events. 13/89 cut-off events. For 627/662 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 305 event pairs, 2 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 551. Up to 35 conditions per place. [2022-12-06 00:07:32,493 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 74 transitions, 1046 flow [2022-12-06 00:07:32,493 INFO L188 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-06 00:07:32,494 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:32,496 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 00:07:32,496 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 1046 flow [2022-12-06 00:07:32,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 00:07:32,496 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:32,496 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:32,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-06 00:07:32,497 INFO L420 AbstractCegarLoop]: === Iteration 43 === 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 00:07:32,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:32,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1000574155, now seen corresponding path program 2 times [2022-12-06 00:07:32,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:32,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698359682] [2022-12-06 00:07:32,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:32,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:32,628 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 00:07:32,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:32,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698359682] [2022-12-06 00:07:32,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698359682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:32,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:32,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:32,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99079723] [2022-12-06 00:07:32,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:32,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:32,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:32,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:32,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:32,632 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 00:07:32,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 1046 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 00:07:32,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:32,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 00:07:32,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:32,755 INFO L130 PetriNetUnfolder]: 86/225 cut-off events. [2022-12-06 00:07:32,755 INFO L131 PetriNetUnfolder]: For 1345/1345 co-relation queries the response was YES. [2022-12-06 00:07:32,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1542 conditions, 225 events. 86/225 cut-off events. For 1345/1345 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 962 event pairs, 2 based on Foata normal form. 4/229 useless extension candidates. Maximal degree in co-relation 1029. Up to 144 conditions per place. [2022-12-06 00:07:32,757 INFO L137 encePairwiseOnDemand]: 22/37 looper letters, 62 selfloop transitions, 20 changer transitions 3/85 dead transitions. [2022-12-06 00:07:32,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 85 transitions, 1270 flow [2022-12-06 00:07:32,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:07:32,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:07:32,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-12-06 00:07:32,758 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2277992277992278 [2022-12-06 00:07:32,758 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 1046 flow. Second operand 7 states and 59 transitions. [2022-12-06 00:07:32,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 85 transitions, 1270 flow [2022-12-06 00:07:32,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 85 transitions, 1251 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 00:07:32,767 INFO L231 Difference]: Finished difference. Result has 88 places, 71 transitions, 999 flow [2022-12-06 00:07:32,768 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=999, PETRI_PLACES=88, PETRI_TRANSITIONS=71} [2022-12-06 00:07:32,768 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 49 predicate places. [2022-12-06 00:07:32,769 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:32,769 INFO L89 Accepts]: Start accepts. Operand has 88 places, 71 transitions, 999 flow [2022-12-06 00:07:32,769 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:32,769 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:32,769 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 71 transitions, 999 flow [2022-12-06 00:07:32,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 71 transitions, 999 flow [2022-12-06 00:07:32,779 INFO L130 PetriNetUnfolder]: 12/85 cut-off events. [2022-12-06 00:07:32,779 INFO L131 PetriNetUnfolder]: For 647/664 co-relation queries the response was YES. [2022-12-06 00:07:32,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 85 events. 12/85 cut-off events. For 647/664 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 278 event pairs, 2 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 520. Up to 33 conditions per place. [2022-12-06 00:07:32,780 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 71 transitions, 999 flow [2022-12-06 00:07:32,780 INFO L188 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-06 00:07:32,784 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [504] L86-->thread3EXIT: Formula: (and (= v_~s~0_388 (+ v_~s~0_389 1)) (= |v_thread3Thread1of1ForFork2_#res#1.base_27| 0) (= v_~b~0_199 (ite (= (ite (or (not (= (mod v_~b~0_200 256) 0)) (= v_~x~0_128 1)) 1 0) 0) 0 1)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) (= (ite (<= v_~m3~0_59 v_~s~0_389) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_27|)) InVars {~m3~0=v_~m3~0_59, ~b~0=v_~b~0_200, ~x~0=v_~x~0_128, ~s~0=v_~s~0_389} OutVars{~m3~0=v_~m3~0_59, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_27|, ~b~0=v_~b~0_199, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_27|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, ~x~0=v_~x~0_128, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_47|, ~s~0=v_~s~0_388} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0] and [478] L67-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| 0)) (= v_~b~0_159 (ite (= (ite (or (= v_~x~0_98 1) (not (= (mod v_~b~0_160 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= (ite (<= v_~m2~0_57 v_~s~0_341) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~s~0_341 1) v_~s~0_340)) InVars {~b~0=v_~b~0_160, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_98, ~s~0=v_~s~0_341} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~b~0=v_~b~0_159, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|, ~x~0=v_~x~0_98, ~s~0=v_~s~0_340} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-06 00:07:32,901 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [612] $Ultimate##0-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res#1.base_93| 0) (= v_~t~0_579 v_~m3~0_233) (= (ite (= (ite (or (= v_~x~0_348 1) (not (= (mod v_~b~0_624 256) 0))) 1 0) 0) 0 1) v_~b~0_623) (= v_~t~0_577 (+ v_~m4~0_200 1)) (= (ite (<= v_~m3~0_233 v_~s~0_831) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_93|) (= v_~m2~0_210 (+ v_~t~0_579 1)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_93| 0)) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_93|) (= (+ v_~s~0_831 1) v_~s~0_830) (= v_~t~0_577 (+ v_~t~0_579 3)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_93| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_93|)) InVars {~b~0=v_~b~0_624, ~x~0=v_~x~0_348, ~s~0=v_~s~0_831, ~t~0=v_~t~0_579} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_93|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_90|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_93|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_90|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_113|, ~m3~0=v_~m3~0_233, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_93|, ~b~0=v_~b~0_623, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_93|, ~m4~0=v_~m4~0_200, ~m2~0=v_~m2~0_210, ~x~0=v_~x~0_348, ~s~0=v_~s~0_830, ~t~0=v_~t~0_577, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_137|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#t~post7#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread3Thread1of1ForFork2_#t~post6#1, ~m3~0, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, ~m4~0, ~m2~0, ~s~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [478] L67-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| 0)) (= v_~b~0_159 (ite (= (ite (or (= v_~x~0_98 1) (not (= (mod v_~b~0_160 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= (ite (<= v_~m2~0_57 v_~s~0_341) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~s~0_341 1) v_~s~0_340)) InVars {~b~0=v_~b~0_160, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_98, ~s~0=v_~s~0_341} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~b~0=v_~b~0_159, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|, ~x~0=v_~x~0_98, ~s~0=v_~s~0_340} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-06 00:07:33,133 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [612] $Ultimate##0-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res#1.base_93| 0) (= v_~t~0_579 v_~m3~0_233) (= (ite (= (ite (or (= v_~x~0_348 1) (not (= (mod v_~b~0_624 256) 0))) 1 0) 0) 0 1) v_~b~0_623) (= v_~t~0_577 (+ v_~m4~0_200 1)) (= (ite (<= v_~m3~0_233 v_~s~0_831) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_93|) (= v_~m2~0_210 (+ v_~t~0_579 1)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_93| 0)) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_93|) (= (+ v_~s~0_831 1) v_~s~0_830) (= v_~t~0_577 (+ v_~t~0_579 3)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_93| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_93|)) InVars {~b~0=v_~b~0_624, ~x~0=v_~x~0_348, ~s~0=v_~s~0_831, ~t~0=v_~t~0_579} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_93|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_90|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_93|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_90|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_113|, ~m3~0=v_~m3~0_233, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_93|, ~b~0=v_~b~0_623, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_93|, ~m4~0=v_~m4~0_200, ~m2~0=v_~m2~0_210, ~x~0=v_~x~0_348, ~s~0=v_~s~0_830, ~t~0=v_~t~0_577, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_137|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#t~post7#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread3Thread1of1ForFork2_#t~post6#1, ~m3~0, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, ~m4~0, ~m2~0, ~s~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [376] $Ultimate##0-->L45: Formula: (and (= (+ v_~t~0_51 1) v_~t~0_50) (= v_~m1~0_9 v_~t~0_51)) InVars {~t~0=v_~t~0_51} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_50} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~t~0] [2022-12-06 00:07:33,232 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:07:33,232 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 463 [2022-12-06 00:07:33,233 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 69 transitions, 981 flow [2022-12-06 00:07:33,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 00:07:33,233 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:33,233 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:33,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-06 00:07:33,233 INFO L420 AbstractCegarLoop]: === Iteration 44 === 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 00:07:33,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:33,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1906810792, now seen corresponding path program 1 times [2022-12-06 00:07:33,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:33,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871213021] [2022-12-06 00:07:33,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:33,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:33,374 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 00:07:33,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:33,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871213021] [2022-12-06 00:07:33,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871213021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:33,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:33,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:33,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332647609] [2022-12-06 00:07:33,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:33,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:33,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:33,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:33,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:33,376 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 00:07:33,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 69 transitions, 981 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 00:07:33,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:33,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 00:07:33,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:33,507 INFO L130 PetriNetUnfolder]: 74/197 cut-off events. [2022-12-06 00:07:33,507 INFO L131 PetriNetUnfolder]: For 1455/1455 co-relation queries the response was YES. [2022-12-06 00:07:33,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1375 conditions, 197 events. 74/197 cut-off events. For 1455/1455 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 791 event pairs, 4 based on Foata normal form. 2/199 useless extension candidates. Maximal degree in co-relation 1145. Up to 92 conditions per place. [2022-12-06 00:07:33,509 INFO L137 encePairwiseOnDemand]: 17/38 looper letters, 45 selfloop transitions, 27 changer transitions 4/76 dead transitions. [2022-12-06 00:07:33,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 76 transitions, 1137 flow [2022-12-06 00:07:33,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:07:33,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:07:33,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-12-06 00:07:33,509 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2543859649122807 [2022-12-06 00:07:33,509 INFO L175 Difference]: Start difference. First operand has 86 places, 69 transitions, 981 flow. Second operand 6 states and 58 transitions. [2022-12-06 00:07:33,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 76 transitions, 1137 flow [2022-12-06 00:07:33,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 76 transitions, 988 flow, removed 16 selfloop flow, removed 12 redundant places. [2022-12-06 00:07:33,517 INFO L231 Difference]: Finished difference. Result has 79 places, 65 transitions, 825 flow [2022-12-06 00:07:33,517 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=825, PETRI_PLACES=79, PETRI_TRANSITIONS=65} [2022-12-06 00:07:33,517 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 40 predicate places. [2022-12-06 00:07:33,517 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:33,517 INFO L89 Accepts]: Start accepts. Operand has 79 places, 65 transitions, 825 flow [2022-12-06 00:07:33,517 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:33,518 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:33,518 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 65 transitions, 825 flow [2022-12-06 00:07:33,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 65 transitions, 825 flow [2022-12-06 00:07:33,525 INFO L130 PetriNetUnfolder]: 11/79 cut-off events. [2022-12-06 00:07:33,525 INFO L131 PetriNetUnfolder]: For 491/505 co-relation queries the response was YES. [2022-12-06 00:07:33,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 79 events. 11/79 cut-off events. For 491/505 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 240 event pairs, 2 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 432. Up to 30 conditions per place. [2022-12-06 00:07:33,525 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 65 transitions, 825 flow [2022-12-06 00:07:33,525 INFO L188 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-06 00:07:33,526 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:33,526 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 00:07:33,526 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 65 transitions, 825 flow [2022-12-06 00:07:33,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 00:07:33,527 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:33,527 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:33,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-06 00:07:33,527 INFO L420 AbstractCegarLoop]: === Iteration 45 === 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 00:07:33,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:33,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1878406570, now seen corresponding path program 1 times [2022-12-06 00:07:33,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:33,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191675643] [2022-12-06 00:07:33,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:33,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:33,633 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 00:07:33,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:33,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191675643] [2022-12-06 00:07:33,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191675643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:33,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:33,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:33,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100010770] [2022-12-06 00:07:33,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:33,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:07:33,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:33,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:07:33,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:07:33,634 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 00:07:33,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 65 transitions, 825 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 00:07:33,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:33,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 00:07:33,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:33,747 INFO L130 PetriNetUnfolder]: 68/183 cut-off events. [2022-12-06 00:07:33,747 INFO L131 PetriNetUnfolder]: For 981/981 co-relation queries the response was YES. [2022-12-06 00:07:33,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1170 conditions, 183 events. 68/183 cut-off events. For 981/981 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 722 event pairs, 0 based on Foata normal form. 2/185 useless extension candidates. Maximal degree in co-relation 793. Up to 115 conditions per place. [2022-12-06 00:07:33,748 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 54 selfloop transitions, 18 changer transitions 3/75 dead transitions. [2022-12-06 00:07:33,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 75 transitions, 1011 flow [2022-12-06 00:07:33,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:33,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:33,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-12-06 00:07:33,749 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29714285714285715 [2022-12-06 00:07:33,749 INFO L175 Difference]: Start difference. First operand has 78 places, 65 transitions, 825 flow. Second operand 5 states and 52 transitions. [2022-12-06 00:07:33,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 75 transitions, 1011 flow [2022-12-06 00:07:33,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 75 transitions, 946 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-12-06 00:07:33,756 INFO L231 Difference]: Finished difference. Result has 77 places, 61 transitions, 733 flow [2022-12-06 00:07:33,756 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=733, PETRI_PLACES=77, PETRI_TRANSITIONS=61} [2022-12-06 00:07:33,757 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 38 predicate places. [2022-12-06 00:07:33,757 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:33,757 INFO L89 Accepts]: Start accepts. Operand has 77 places, 61 transitions, 733 flow [2022-12-06 00:07:33,757 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:33,758 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:33,758 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 61 transitions, 733 flow [2022-12-06 00:07:33,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 61 transitions, 733 flow [2022-12-06 00:07:33,765 INFO L130 PetriNetUnfolder]: 10/74 cut-off events. [2022-12-06 00:07:33,766 INFO L131 PetriNetUnfolder]: For 403/404 co-relation queries the response was YES. [2022-12-06 00:07:33,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 74 events. 10/74 cut-off events. For 403/404 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 215 event pairs, 2 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 383. Up to 28 conditions per place. [2022-12-06 00:07:33,766 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 61 transitions, 733 flow [2022-12-06 00:07:33,766 INFO L188 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-06 00:07:33,767 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:33,767 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 00:07:33,768 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 61 transitions, 733 flow [2022-12-06 00:07:33,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 00:07:33,768 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:33,768 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:33,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-06 00:07:33,768 INFO L420 AbstractCegarLoop]: === Iteration 46 === 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 00:07:33,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:33,768 INFO L85 PathProgramCache]: Analyzing trace with hash -354768741, now seen corresponding path program 1 times [2022-12-06 00:07:33,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:33,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715816739] [2022-12-06 00:07:33,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:33,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:33,897 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 00:07:33,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:33,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715816739] [2022-12-06 00:07:33,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715816739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:33,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:33,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:33,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872569671] [2022-12-06 00:07:33,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:33,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:07:33,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:33,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:07:33,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:07:33,899 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 00:07:33,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 61 transitions, 733 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 00:07:33,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:33,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 00:07:33,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:33,982 INFO L130 PetriNetUnfolder]: 63/172 cut-off events. [2022-12-06 00:07:33,982 INFO L131 PetriNetUnfolder]: For 863/863 co-relation queries the response was YES. [2022-12-06 00:07:33,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 172 events. 63/172 cut-off events. For 863/863 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 620 event pairs, 7 based on Foata normal form. 2/174 useless extension candidates. Maximal degree in co-relation 800. Up to 145 conditions per place. [2022-12-06 00:07:33,984 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 53 selfloop transitions, 9 changer transitions 3/65 dead transitions. [2022-12-06 00:07:33,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 65 transitions, 855 flow [2022-12-06 00:07:33,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:33,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:33,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-06 00:07:33,984 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2529411764705882 [2022-12-06 00:07:33,985 INFO L175 Difference]: Start difference. First operand has 77 places, 61 transitions, 733 flow. Second operand 5 states and 43 transitions. [2022-12-06 00:07:33,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 65 transitions, 855 flow [2022-12-06 00:07:33,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 65 transitions, 829 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:33,991 INFO L231 Difference]: Finished difference. Result has 78 places, 58 transitions, 663 flow [2022-12-06 00:07:33,991 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=663, PETRI_PLACES=78, PETRI_TRANSITIONS=58} [2022-12-06 00:07:33,991 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 39 predicate places. [2022-12-06 00:07:33,991 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:33,991 INFO L89 Accepts]: Start accepts. Operand has 78 places, 58 transitions, 663 flow [2022-12-06 00:07:33,992 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:33,992 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:33,992 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 58 transitions, 663 flow [2022-12-06 00:07:33,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 58 transitions, 663 flow [2022-12-06 00:07:33,999 INFO L130 PetriNetUnfolder]: 9/71 cut-off events. [2022-12-06 00:07:33,999 INFO L131 PetriNetUnfolder]: For 384/397 co-relation queries the response was YES. [2022-12-06 00:07:34,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 71 events. 9/71 cut-off events. For 384/397 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 2 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 347. Up to 27 conditions per place. [2022-12-06 00:07:34,000 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 58 transitions, 663 flow [2022-12-06 00:07:34,000 INFO L188 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-06 00:07:34,001 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [609] $Ultimate##0-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_87| 0)) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_87|) (= (ite (<= v_~m3~0_227 v_~s~0_819) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_87|) (= v_~b~0_611 (ite (= (ite (or (not (= (mod v_~b~0_612 256) 0)) (= v_~x~0_342 1)) 1 0) 0) 0 1)) (= (+ v_~t~0_563 1) v_~m4~0_194) (= (+ v_~m4~0_194 1) v_~m1~0_199) (= v_~t~0_561 (+ 2 v_~m4~0_194)) (= v_~t~0_563 v_~m3~0_227) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_87| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_87|) (= (+ v_~s~0_819 1) v_~s~0_818) (= |v_thread3Thread1of1ForFork2_#res#1.base_87| 0)) InVars {~b~0=v_~b~0_612, ~x~0=v_~x~0_342, ~s~0=v_~s~0_819, ~t~0=v_~t~0_563} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_87|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_84|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_87|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_107|, ~m3~0=v_~m3~0_227, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_103|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_87|, ~b~0=v_~b~0_611, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_87|, ~m4~0=v_~m4~0_194, ~m1~0=v_~m1~0_199, ~x~0=v_~x~0_342, ~s~0=v_~s~0_818, ~t~0=v_~t~0_561, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_131|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#t~post7#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~m3~0, thread1Thread1of1ForFork3_#t~post1#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, ~m4~0, ~m1~0, ~s~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [469] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_317 1) v_~s~0_316) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_37| 0) (= v_~b~0_139 (ite (= (ite (or (not (= 0 (mod v_~b~0_140 256))) (= v_~x~0_89 1)) 1 0) 0) 0 1)) (= (ite (<= v_~m4~0_31 v_~s~0_317) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= |v_thread4Thread1of1ForFork0_#res#1.base_37| 0)) InVars {~b~0=v_~b~0_140, ~m4~0=v_~m4~0_31, ~x~0=v_~x~0_89, ~s~0=v_~s~0_317} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_37|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_41|, ~b~0=v_~b~0_139, ~m4~0=v_~m4~0_31, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_37|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, ~x~0=v_~x~0_89, ~s~0=v_~s~0_316} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:34,207 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:34,208 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-06 00:07:34,208 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 58 transitions, 666 flow [2022-12-06 00:07:34,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 00:07:34,208 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:34,208 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:34,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-06 00:07:34,208 INFO L420 AbstractCegarLoop]: === Iteration 47 === 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 00:07:34,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:34,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1775608943, now seen corresponding path program 1 times [2022-12-06 00:07:34,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:34,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954378726] [2022-12-06 00:07:34,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:34,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:34,329 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 00:07:34,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:34,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954378726] [2022-12-06 00:07:34,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954378726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:34,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:34,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:34,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743835992] [2022-12-06 00:07:34,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:34,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:34,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:34,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:34,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:34,331 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 00:07:34,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 58 transitions, 666 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 00:07:34,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:34,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 00:07:34,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:34,446 INFO L130 PetriNetUnfolder]: 60/167 cut-off events. [2022-12-06 00:07:34,446 INFO L131 PetriNetUnfolder]: For 801/801 co-relation queries the response was YES. [2022-12-06 00:07:34,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 167 events. 60/167 cut-off events. For 801/801 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 617 event pairs, 0 based on Foata normal form. 2/169 useless extension candidates. Maximal degree in co-relation 804. Up to 105 conditions per place. [2022-12-06 00:07:34,447 INFO L137 encePairwiseOnDemand]: 20/33 looper letters, 55 selfloop transitions, 14 changer transitions 2/71 dead transitions. [2022-12-06 00:07:34,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 71 transitions, 864 flow [2022-12-06 00:07:34,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:07:34,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:07:34,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-12-06 00:07:34,448 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23809523809523808 [2022-12-06 00:07:34,448 INFO L175 Difference]: Start difference. First operand has 77 places, 58 transitions, 666 flow. Second operand 7 states and 55 transitions. [2022-12-06 00:07:34,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 71 transitions, 864 flow [2022-12-06 00:07:34,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 71 transitions, 816 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-06 00:07:34,454 INFO L231 Difference]: Finished difference. Result has 78 places, 56 transitions, 610 flow [2022-12-06 00:07:34,455 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=610, PETRI_PLACES=78, PETRI_TRANSITIONS=56} [2022-12-06 00:07:34,455 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 39 predicate places. [2022-12-06 00:07:34,455 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:34,455 INFO L89 Accepts]: Start accepts. Operand has 78 places, 56 transitions, 610 flow [2022-12-06 00:07:34,455 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:34,456 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:34,456 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 56 transitions, 610 flow [2022-12-06 00:07:34,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 56 transitions, 610 flow [2022-12-06 00:07:34,463 INFO L130 PetriNetUnfolder]: 8/69 cut-off events. [2022-12-06 00:07:34,463 INFO L131 PetriNetUnfolder]: For 399/413 co-relation queries the response was YES. [2022-12-06 00:07:34,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 69 events. 8/69 cut-off events. For 399/413 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 2 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 321. Up to 25 conditions per place. [2022-12-06 00:07:34,464 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 56 transitions, 610 flow [2022-12-06 00:07:34,464 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-06 00:07:34,469 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [383] $Ultimate##0-->L67: Formula: (and (= v_~t~0_46 (+ v_~t~0_47 1)) (= v_~m2~0_11 v_~t~0_47)) InVars {~t~0=v_~t~0_47} OutVars{thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_46} AuxVars[] AssignedVars[~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0] and [469] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_317 1) v_~s~0_316) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_37| 0) (= v_~b~0_139 (ite (= (ite (or (not (= 0 (mod v_~b~0_140 256))) (= v_~x~0_89 1)) 1 0) 0) 0 1)) (= (ite (<= v_~m4~0_31 v_~s~0_317) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= |v_thread4Thread1of1ForFork0_#res#1.base_37| 0)) InVars {~b~0=v_~b~0_140, ~m4~0=v_~m4~0_31, ~x~0=v_~x~0_89, ~s~0=v_~s~0_317} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_37|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_41|, ~b~0=v_~b~0_139, ~m4~0=v_~m4~0_31, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_37|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, ~x~0=v_~x~0_89, ~s~0=v_~s~0_316} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:34,535 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [504] L86-->thread3EXIT: Formula: (and (= v_~s~0_388 (+ v_~s~0_389 1)) (= |v_thread3Thread1of1ForFork2_#res#1.base_27| 0) (= v_~b~0_199 (ite (= (ite (or (not (= (mod v_~b~0_200 256) 0)) (= v_~x~0_128 1)) 1 0) 0) 0 1)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) (= (ite (<= v_~m3~0_59 v_~s~0_389) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_27|)) InVars {~m3~0=v_~m3~0_59, ~b~0=v_~b~0_200, ~x~0=v_~x~0_128, ~s~0=v_~s~0_389} OutVars{~m3~0=v_~m3~0_59, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_27|, ~b~0=v_~b~0_199, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_27|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, ~x~0=v_~x~0_128, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_47|, ~s~0=v_~s~0_388} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0] and [469] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_317 1) v_~s~0_316) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_37| 0) (= v_~b~0_139 (ite (= (ite (or (not (= 0 (mod v_~b~0_140 256))) (= v_~x~0_89 1)) 1 0) 0) 0 1)) (= (ite (<= v_~m4~0_31 v_~s~0_317) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= |v_thread4Thread1of1ForFork0_#res#1.base_37| 0)) InVars {~b~0=v_~b~0_140, ~m4~0=v_~m4~0_31, ~x~0=v_~x~0_89, ~s~0=v_~s~0_317} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_37|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_41|, ~b~0=v_~b~0_139, ~m4~0=v_~m4~0_31, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_37|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, ~x~0=v_~x~0_89, ~s~0=v_~s~0_316} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:34,656 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [609] $Ultimate##0-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_87| 0)) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_87|) (= (ite (<= v_~m3~0_227 v_~s~0_819) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_87|) (= v_~b~0_611 (ite (= (ite (or (not (= (mod v_~b~0_612 256) 0)) (= v_~x~0_342 1)) 1 0) 0) 0 1)) (= (+ v_~t~0_563 1) v_~m4~0_194) (= (+ v_~m4~0_194 1) v_~m1~0_199) (= v_~t~0_561 (+ 2 v_~m4~0_194)) (= v_~t~0_563 v_~m3~0_227) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_87| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_87|) (= (+ v_~s~0_819 1) v_~s~0_818) (= |v_thread3Thread1of1ForFork2_#res#1.base_87| 0)) InVars {~b~0=v_~b~0_612, ~x~0=v_~x~0_342, ~s~0=v_~s~0_819, ~t~0=v_~t~0_563} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_87|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_84|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_87|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_107|, ~m3~0=v_~m3~0_227, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_103|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_87|, ~b~0=v_~b~0_611, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_87|, ~m4~0=v_~m4~0_194, ~m1~0=v_~m1~0_199, ~x~0=v_~x~0_342, ~s~0=v_~s~0_818, ~t~0=v_~t~0_561, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_131|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#t~post7#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~m3~0, thread1Thread1of1ForFork3_#t~post1#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, ~m4~0, ~m1~0, ~s~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [618] $Ultimate##0-->thread4EXIT: Formula: (and (= (ite (<= v_~m4~0_208 v_~s~0_861) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_113|) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_113| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_113|) (= |v_thread4Thread1of1ForFork0_#res#1.offset_133| 0) (= v_~t~0_603 (+ v_~t~0_604 1)) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_113| 0)) (= (ite (= (ite (or (= v_~x~0_360 1) (not (= (mod v_~b~0_654 256) 0))) 1 0) 0) 0 1) v_~b~0_653) (= v_~t~0_604 v_~m2~0_220) (= (+ v_~s~0_861 1) v_~s~0_860) (= |v_thread4Thread1of1ForFork0_#res#1.base_133| 0)) InVars {~b~0=v_~b~0_654, ~m4~0=v_~m4~0_208, ~x~0=v_~x~0_360, ~s~0=v_~s~0_861, ~t~0=v_~t~0_604} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_133|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_137|, ~b~0=v_~b~0_653, ~m4~0=v_~m4~0_208, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_113|, ~m2~0=v_~m2~0_220, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_133|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_98|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_113|, ~x~0=v_~x~0_360, ~s~0=v_~s~0_860, ~t~0=v_~t~0_603} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~m2~0, thread4Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_#t~post3#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~t~0] [2022-12-06 00:07:34,891 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [376] $Ultimate##0-->L45: Formula: (and (= (+ v_~t~0_51 1) v_~t~0_50) (= v_~m1~0_9 v_~t~0_51)) InVars {~t~0=v_~t~0_51} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_50} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~t~0] and [469] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_317 1) v_~s~0_316) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_37| 0) (= v_~b~0_139 (ite (= (ite (or (not (= 0 (mod v_~b~0_140 256))) (= v_~x~0_89 1)) 1 0) 0) 0 1)) (= (ite (<= v_~m4~0_31 v_~s~0_317) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= |v_thread4Thread1of1ForFork0_#res#1.base_37| 0)) InVars {~b~0=v_~b~0_140, ~m4~0=v_~m4~0_31, ~x~0=v_~x~0_89, ~s~0=v_~s~0_317} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_37|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_41|, ~b~0=v_~b~0_139, ~m4~0=v_~m4~0_31, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_37|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, ~x~0=v_~x~0_89, ~s~0=v_~s~0_316} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:34,964 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [610] $Ultimate##0-->thread3EXIT: Formula: (and (= (+ v_~m2~0_208 1) v_~t~0_567) (= (+ v_~s~0_823 1) v_~s~0_822) (= v_~b~0_615 (ite (= (ite (or (= v_~x~0_344 1) (not (= 0 (mod v_~b~0_616 256)))) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_89| (ite (<= v_~m3~0_229 v_~s~0_823) 1 0)) (= v_~m2~0_208 (+ v_~m4~0_196 1)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_89| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_89|) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_89|) (= |v_thread3Thread1of1ForFork2_#res#1.base_89| 0) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_89| 0)) (= v_~t~0_569 v_~m3~0_229) (= (+ v_~t~0_569 1) v_~m4~0_196)) InVars {~b~0=v_~b~0_616, ~x~0=v_~x~0_344, ~s~0=v_~s~0_823, ~t~0=v_~t~0_569} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_89|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_86|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_89|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_88|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_109|, ~m3~0=v_~m3~0_229, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_89|, ~b~0=v_~b~0_615, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_89|, ~m4~0=v_~m4~0_196, ~m2~0=v_~m2~0_208, ~x~0=v_~x~0_344, ~s~0=v_~s~0_822, ~t~0=v_~t~0_567, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_133|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#t~post7#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread3Thread1of1ForFork2_#t~post6#1, ~m3~0, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, ~m4~0, ~m2~0, ~s~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [469] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_317 1) v_~s~0_316) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_37| 0) (= v_~b~0_139 (ite (= (ite (or (not (= 0 (mod v_~b~0_140 256))) (= v_~x~0_89 1)) 1 0) 0) 0 1)) (= (ite (<= v_~m4~0_31 v_~s~0_317) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= |v_thread4Thread1of1ForFork0_#res#1.base_37| 0)) InVars {~b~0=v_~b~0_140, ~m4~0=v_~m4~0_31, ~x~0=v_~x~0_89, ~s~0=v_~s~0_317} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_37|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_41|, ~b~0=v_~b~0_139, ~m4~0=v_~m4~0_31, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_37|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, ~x~0=v_~x~0_89, ~s~0=v_~s~0_316} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:35,166 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 00:07:35,167 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 712 [2022-12-06 00:07:35,167 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 52 transitions, 544 flow [2022-12-06 00:07:35,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 00:07:35,167 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:35,167 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:35,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-06 00:07:35,167 INFO L420 AbstractCegarLoop]: === Iteration 48 === 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 00:07:35,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:35,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1510512262, now seen corresponding path program 1 times [2022-12-06 00:07:35,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:35,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872566145] [2022-12-06 00:07:35,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:35,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:35,274 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 00:07:35,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:35,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872566145] [2022-12-06 00:07:35,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872566145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:35,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:35,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:35,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545997322] [2022-12-06 00:07:35,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:35,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:07:35,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:35,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:07:35,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:07:35,275 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 00:07:35,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 52 transitions, 544 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 00:07:35,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:35,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 00:07:35,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:35,379 INFO L130 PetriNetUnfolder]: 51/148 cut-off events. [2022-12-06 00:07:35,379 INFO L131 PetriNetUnfolder]: For 867/867 co-relation queries the response was YES. [2022-12-06 00:07:35,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 148 events. 51/148 cut-off events. For 867/867 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 527 event pairs, 2 based on Foata normal form. 4/152 useless extension candidates. Maximal degree in co-relation 801. Up to 86 conditions per place. [2022-12-06 00:07:35,380 INFO L137 encePairwiseOnDemand]: 21/34 looper letters, 45 selfloop transitions, 11 changer transitions 3/59 dead transitions. [2022-12-06 00:07:35,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 59 transitions, 678 flow [2022-12-06 00:07:35,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:35,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:35,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-06 00:07:35,381 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2823529411764706 [2022-12-06 00:07:35,381 INFO L175 Difference]: Start difference. First operand has 72 places, 52 transitions, 544 flow. Second operand 5 states and 48 transitions. [2022-12-06 00:07:35,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 59 transitions, 678 flow [2022-12-06 00:07:35,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 59 transitions, 607 flow, removed 13 selfloop flow, removed 11 redundant places. [2022-12-06 00:07:35,386 INFO L231 Difference]: Finished difference. Result has 65 places, 48 transitions, 438 flow [2022-12-06 00:07:35,386 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=438, PETRI_PLACES=65, PETRI_TRANSITIONS=48} [2022-12-06 00:07:35,388 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 26 predicate places. [2022-12-06 00:07:35,388 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:35,388 INFO L89 Accepts]: Start accepts. Operand has 65 places, 48 transitions, 438 flow [2022-12-06 00:07:35,389 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:35,389 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:35,389 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 48 transitions, 438 flow [2022-12-06 00:07:35,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 48 transitions, 438 flow [2022-12-06 00:07:35,395 INFO L130 PetriNetUnfolder]: 6/61 cut-off events. [2022-12-06 00:07:35,395 INFO L131 PetriNetUnfolder]: For 213/214 co-relation queries the response was YES. [2022-12-06 00:07:35,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 61 events. 6/61 cut-off events. For 213/214 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 150 event pairs, 2 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 227. Up to 21 conditions per place. [2022-12-06 00:07:35,396 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 48 transitions, 438 flow [2022-12-06 00:07:35,396 INFO L188 LiptonReduction]: Number of co-enabled transitions 74 [2022-12-06 00:07:35,401 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [611] $Ultimate##0-->thread3EXIT: Formula: (and (= v_~b~0_619 (ite (= (ite (or (= v_~x~0_346 1) (not (= (mod v_~b~0_620 256) 0))) 1 0) 0) 0 1)) (= v_~t~0_573 (+ v_~m4~0_198 1)) (= |v_thread3Thread1of1ForFork2_#res#1.base_91| 0) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_91| 0)) (= (+ v_~s~0_827 1) v_~s~0_826) (= (+ v_~t~0_574 1) v_~m4~0_198) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_91| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_91|) (= (ite (<= v_~m3~0_231 v_~s~0_827) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_91|) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_91|) (= v_~t~0_574 v_~m3~0_231)) InVars {~b~0=v_~b~0_620, ~x~0=v_~x~0_346, ~s~0=v_~s~0_827, ~t~0=v_~t~0_574} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_91|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_88|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_91|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_111|, ~m3~0=v_~m3~0_231, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_91|, ~b~0=v_~b~0_619, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_91|, ~m4~0=v_~m4~0_198, ~x~0=v_~x~0_346, ~s~0=v_~s~0_826, ~t~0=v_~t~0_573, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_135|} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread4Thread1of1ForFork0_#t~post7#1, thread3Thread1of1ForFork2_#res#1.base, ~m4~0, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [469] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_317 1) v_~s~0_316) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_37| 0) (= v_~b~0_139 (ite (= (ite (or (not (= 0 (mod v_~b~0_140 256))) (= v_~x~0_89 1)) 1 0) 0) 0 1)) (= (ite (<= v_~m4~0_31 v_~s~0_317) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= |v_thread4Thread1of1ForFork0_#res#1.base_37| 0)) InVars {~b~0=v_~b~0_140, ~m4~0=v_~m4~0_31, ~x~0=v_~x~0_89, ~s~0=v_~s~0_317} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_37|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_41|, ~b~0=v_~b~0_139, ~m4~0=v_~m4~0_31, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_37|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, ~x~0=v_~x~0_89, ~s~0=v_~s~0_316} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:35,594 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:35,595 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 207 [2022-12-06 00:07:35,595 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 424 flow [2022-12-06 00:07:35,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 00:07:35,595 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:35,595 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:35,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-06 00:07:35,595 INFO L420 AbstractCegarLoop]: === Iteration 49 === 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 00:07:35,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:35,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1171341042, now seen corresponding path program 1 times [2022-12-06 00:07:35,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:35,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222109445] [2022-12-06 00:07:35,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:35,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:35,711 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 00:07:35,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:35,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222109445] [2022-12-06 00:07:35,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222109445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:35,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:35,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:35,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329521105] [2022-12-06 00:07:35,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:35,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:07:35,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:35,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:07:35,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:07:35,713 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 00:07:35,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 424 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 00:07:35,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:35,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 00:07:35,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:35,819 INFO L130 PetriNetUnfolder]: 44/131 cut-off events. [2022-12-06 00:07:35,819 INFO L131 PetriNetUnfolder]: For 477/477 co-relation queries the response was YES. [2022-12-06 00:07:35,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 131 events. 44/131 cut-off events. For 477/477 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 422 event pairs, 0 based on Foata normal form. 2/133 useless extension candidates. Maximal degree in co-relation 515. Up to 81 conditions per place. [2022-12-06 00:07:35,820 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 46 selfloop transitions, 8 changer transitions 2/56 dead transitions. [2022-12-06 00:07:35,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 56 transitions, 560 flow [2022-12-06 00:07:35,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:07:35,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:07:35,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-12-06 00:07:35,821 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29375 [2022-12-06 00:07:35,821 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 424 flow. Second operand 5 states and 47 transitions. [2022-12-06 00:07:35,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 56 transitions, 560 flow [2022-12-06 00:07:35,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 56 transitions, 505 flow, removed 11 selfloop flow, removed 8 redundant places. [2022-12-06 00:07:35,824 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 342 flow [2022-12-06 00:07:35,824 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=342, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2022-12-06 00:07:35,825 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 21 predicate places. [2022-12-06 00:07:35,825 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:35,825 INFO L89 Accepts]: Start accepts. Operand has 60 places, 43 transitions, 342 flow [2022-12-06 00:07:35,825 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:35,825 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:35,825 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 43 transitions, 342 flow [2022-12-06 00:07:35,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 43 transitions, 342 flow [2022-12-06 00:07:35,832 INFO L130 PetriNetUnfolder]: 5/56 cut-off events. [2022-12-06 00:07:35,832 INFO L131 PetriNetUnfolder]: For 153/154 co-relation queries the response was YES. [2022-12-06 00:07:35,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 56 events. 5/56 cut-off events. For 153/154 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 114 event pairs, 2 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 183. Up to 19 conditions per place. [2022-12-06 00:07:35,833 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 43 transitions, 342 flow [2022-12-06 00:07:35,833 INFO L188 LiptonReduction]: Number of co-enabled transitions 64 [2022-12-06 00:07:35,833 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:35,834 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 00:07:35,834 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 342 flow [2022-12-06 00:07:35,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 00:07:35,834 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:35,834 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:35,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-06 00:07:35,834 INFO L420 AbstractCegarLoop]: === Iteration 50 === 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 00:07:35,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:35,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1375886520, now seen corresponding path program 1 times [2022-12-06 00:07:35,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:35,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692951251] [2022-12-06 00:07:35,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:35,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:35,947 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 00:07:35,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:35,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692951251] [2022-12-06 00:07:35,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692951251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:35,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:35,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:07:35,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534601077] [2022-12-06 00:07:35,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:35,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:07:35,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:35,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:07:35,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:07:35,948 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 00:07:35,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 342 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 00:07:35,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:35,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 00:07:35,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:36,069 INFO L130 PetriNetUnfolder]: 37/106 cut-off events. [2022-12-06 00:07:36,069 INFO L131 PetriNetUnfolder]: For 346/346 co-relation queries the response was YES. [2022-12-06 00:07:36,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 542 conditions, 106 events. 37/106 cut-off events. For 346/346 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 318 event pairs, 2 based on Foata normal form. 4/110 useless extension candidates. Maximal degree in co-relation 497. Up to 39 conditions per place. [2022-12-06 00:07:36,069 INFO L137 encePairwiseOnDemand]: 19/31 looper letters, 32 selfloop transitions, 11 changer transitions 5/48 dead transitions. [2022-12-06 00:07:36,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 48 transitions, 429 flow [2022-12-06 00:07:36,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:07:36,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:07:36,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-06 00:07:36,070 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23655913978494625 [2022-12-06 00:07:36,070 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 342 flow. Second operand 6 states and 44 transitions. [2022-12-06 00:07:36,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 48 transitions, 429 flow [2022-12-06 00:07:36,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 48 transitions, 393 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-12-06 00:07:36,072 INFO L231 Difference]: Finished difference. Result has 57 places, 34 transitions, 239 flow [2022-12-06 00:07:36,072 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=239, PETRI_PLACES=57, PETRI_TRANSITIONS=34} [2022-12-06 00:07:36,073 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 18 predicate places. [2022-12-06 00:07:36,073 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:36,073 INFO L89 Accepts]: Start accepts. Operand has 57 places, 34 transitions, 239 flow [2022-12-06 00:07:36,073 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:36,073 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:36,073 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 34 transitions, 239 flow [2022-12-06 00:07:36,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 34 transitions, 239 flow [2022-12-06 00:07:36,076 INFO L130 PetriNetUnfolder]: 4/39 cut-off events. [2022-12-06 00:07:36,076 INFO L131 PetriNetUnfolder]: For 115/116 co-relation queries the response was YES. [2022-12-06 00:07:36,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 39 events. 4/39 cut-off events. For 115/116 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 2 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 128. Up to 15 conditions per place. [2022-12-06 00:07:36,077 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 34 transitions, 239 flow [2022-12-06 00:07:36,077 INFO L188 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-06 00:07:36,077 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:36,078 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 00:07:36,078 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 34 transitions, 239 flow [2022-12-06 00:07:36,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 00:07:36,078 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:36,078 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:36,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-06 00:07:36,078 INFO L420 AbstractCegarLoop]: === Iteration 51 === 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 00:07:36,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:36,079 INFO L85 PathProgramCache]: Analyzing trace with hash -367852711, now seen corresponding path program 1 times [2022-12-06 00:07:36,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:36,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325592581] [2022-12-06 00:07:36,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:36,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:36,209 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 00:07:36,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:36,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325592581] [2022-12-06 00:07:36,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325592581] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:36,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:36,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:07:36,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954927582] [2022-12-06 00:07:36,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:36,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:07:36,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:36,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:07:36,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:07:36,211 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 00:07:36,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 34 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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 00:07:36,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:36,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 00:07:36,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:36,330 INFO L130 PetriNetUnfolder]: 32/95 cut-off events. [2022-12-06 00:07:36,330 INFO L131 PetriNetUnfolder]: For 284/284 co-relation queries the response was YES. [2022-12-06 00:07:36,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 95 events. 32/95 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 254 event pairs, 0 based on Foata normal form. 2/97 useless extension candidates. Maximal degree in co-relation 332. Up to 47 conditions per place. [2022-12-06 00:07:36,331 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 35 selfloop transitions, 9 changer transitions 8/52 dead transitions. [2022-12-06 00:07:36,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 52 transitions, 439 flow [2022-12-06 00:07:36,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:07:36,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:07:36,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2022-12-06 00:07:36,332 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19540229885057472 [2022-12-06 00:07:36,332 INFO L175 Difference]: Start difference. First operand has 57 places, 34 transitions, 239 flow. Second operand 9 states and 51 transitions. [2022-12-06 00:07:36,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 52 transitions, 439 flow [2022-12-06 00:07:36,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 52 transitions, 389 flow, removed 0 selfloop flow, removed 10 redundant places. [2022-12-06 00:07:36,336 INFO L231 Difference]: Finished difference. Result has 58 places, 36 transitions, 253 flow [2022-12-06 00:07:36,337 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=253, PETRI_PLACES=58, PETRI_TRANSITIONS=36} [2022-12-06 00:07:36,337 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 19 predicate places. [2022-12-06 00:07:36,337 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:36,337 INFO L89 Accepts]: Start accepts. Operand has 58 places, 36 transitions, 253 flow [2022-12-06 00:07:36,337 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:36,338 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:36,338 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 36 transitions, 253 flow [2022-12-06 00:07:36,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 36 transitions, 253 flow [2022-12-06 00:07:36,342 INFO L130 PetriNetUnfolder]: 3/37 cut-off events. [2022-12-06 00:07:36,342 INFO L131 PetriNetUnfolder]: For 75/76 co-relation queries the response was YES. [2022-12-06 00:07:36,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 37 events. 3/37 cut-off events. For 75/76 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 122. Up to 13 conditions per place. [2022-12-06 00:07:36,342 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 36 transitions, 253 flow [2022-12-06 00:07:36,343 INFO L188 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-06 00:07:36,343 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] $Ultimate##0-->L105: Formula: (and (= v_~t~0_545 (+ v_~m4~0_192 1)) (= (+ v_~t~0_547 1) v_~m4~0_192) (= v_~t~0_547 v_~m3~0_221)) InVars {~t~0=v_~t~0_547} OutVars{~m3~0=v_~m3~0_221, ~m4~0=v_~m4~0_192, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_82|, ~t~0=v_~t~0_545, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_125|} AuxVars[] AssignedVars[~m3~0, ~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [383] $Ultimate##0-->L67: Formula: (and (= v_~t~0_46 (+ v_~t~0_47 1)) (= v_~m2~0_11 v_~t~0_47)) InVars {~t~0=v_~t~0_47} OutVars{thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_46} AuxVars[] AssignedVars[~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0] [2022-12-06 00:07:36,366 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [607] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_206 (+ v_~t~0_553 1)) (= v_~t~0_553 v_~m3~0_223) (= v_~t~0_551 (+ v_~t~0_553 2))) InVars {~t~0=v_~t~0_553} OutVars{~m3~0=v_~m3~0_223, ~m2~0=v_~m2~0_206, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_86|, ~t~0=v_~t~0_551, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_127|} AuxVars[] AssignedVars[~m3~0, ~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [395] $Ultimate##0-->L105: Formula: (and (= (+ v_~t~0_55 1) v_~t~0_54) (= v_~m4~0_7 v_~t~0_55)) InVars {~t~0=v_~t~0_55} OutVars{~m4~0=v_~m4~0_7, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_1|, ~t~0=v_~t~0_54} AuxVars[] AssignedVars[~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~t~0] [2022-12-06 00:07:36,398 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [383] $Ultimate##0-->L67: Formula: (and (= v_~t~0_46 (+ v_~t~0_47 1)) (= v_~m2~0_11 v_~t~0_47)) InVars {~t~0=v_~t~0_47} OutVars{thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_46} AuxVars[] AssignedVars[~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0] and [619] L86-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_#res#1.base_135| 0) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_115| 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_105| 0)) (= (ite (<= (+ v_~m4~0_210 1) v_~s~0_864) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_115|) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_115| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_115|) (= (+ 2 v_~s~0_866) v_~s~0_864) (= |v_thread4Thread1of1ForFork0_#res#1.offset_135| 0) (= (ite (<= v_~m3~0_245 v_~s~0_866) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_105|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_105| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_105|) (= (ite (= (ite (let ((.cse0 (= v_~x~0_362 1))) (or (not (= (mod (ite (= (ite (or .cse0 (not (= (mod v_~b~0_659 256) 0))) 1 0) 0) 0 1) 256) 0)) .cse0)) 1 0) 0) 0 1) v_~b~0_657) (= |v_thread3Thread1of1ForFork2_#res#1.base_105| 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_105| 0)) InVars {~m3~0=v_~m3~0_245, ~b~0=v_~b~0_659, ~m4~0=v_~m4~0_210, ~x~0=v_~x~0_362, ~s~0=v_~s~0_866} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_135|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_105|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_105|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_125|, ~m3~0=v_~m3~0_245, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_105|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_139|, ~b~0=v_~b~0_657, ~m4~0=v_~m4~0_210, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_105|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_115|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_135|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_115|, ~x~0=v_~x~0_362, ~s~0=v_~s~0_864} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0] [2022-12-06 00:07:36,528 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] $Ultimate##0-->L105: Formula: (and (= v_~t~0_545 (+ v_~m4~0_192 1)) (= (+ v_~t~0_547 1) v_~m4~0_192) (= v_~t~0_547 v_~m3~0_221)) InVars {~t~0=v_~t~0_547} OutVars{~m3~0=v_~m3~0_221, ~m4~0=v_~m4~0_192, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_82|, ~t~0=v_~t~0_545, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_125|} AuxVars[] AssignedVars[~m3~0, ~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [376] $Ultimate##0-->L45: Formula: (and (= (+ v_~t~0_51 1) v_~t~0_50) (= v_~m1~0_9 v_~t~0_51)) InVars {~t~0=v_~t~0_51} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_50} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~t~0] [2022-12-06 00:07:36,554 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [624] $Ultimate##0-->L67: Formula: (and (= v_~t~0_625 (+ 2 v_~m4~0_220)) (= v_~m2~0_226 (+ v_~m4~0_220 1)) (= v_~m4~0_220 (+ v_~t~0_627 1)) (= v_~t~0_627 v_~m3~0_253)) InVars {~t~0=v_~t~0_627} OutVars{~m3~0=v_~m3~0_253, ~m4~0=v_~m4~0_220, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_104|, ~m2~0=v_~m2~0_226, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_104|, ~t~0=v_~t~0_625, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_153|} AuxVars[] AssignedVars[~m3~0, ~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [376] $Ultimate##0-->L45: Formula: (and (= (+ v_~t~0_51 1) v_~t~0_50) (= v_~m1~0_9 v_~t~0_51)) InVars {~t~0=v_~t~0_51} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_50} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~t~0] [2022-12-06 00:07:36,584 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L105: Formula: (and (= v_~m2~0_228 (+ v_~t~0_633 1)) (= v_~t~0_633 v_~m3~0_255) (= (+ v_~t~0_633 2) v_~m4~0_222) (= v_~t~0_631 (+ v_~t~0_633 3))) InVars {~t~0=v_~t~0_633} OutVars{~m3~0=v_~m3~0_255, ~m4~0=v_~m4~0_222, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_106|, ~m2~0=v_~m2~0_228, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_106|, ~t~0=v_~t~0_631, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_155|} AuxVars[] AssignedVars[~m3~0, ~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [376] $Ultimate##0-->L45: Formula: (and (= (+ v_~t~0_51 1) v_~t~0_50) (= v_~m1~0_9 v_~t~0_51)) InVars {~t~0=v_~t~0_51} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_50} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~t~0] [2022-12-06 00:07:36,627 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [627] $Ultimate##0-->L45: Formula: (and (= v_~t~0_641 (+ 2 v_~m4~0_226)) (= v_~t~0_641 (+ 1 v_~m1~0_211)) (= v_~t~0_643 v_~m3~0_259) (= (+ v_~t~0_643 1) v_~m4~0_226)) InVars {~t~0=v_~t~0_643} OutVars{~m3~0=v_~m3~0_259, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_115|, ~m4~0=v_~m4~0_226, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_108|, ~m1~0=v_~m1~0_211, ~t~0=v_~t~0_641, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_157|} AuxVars[] AssignedVars[~m3~0, thread1Thread1of1ForFork3_#t~post1#1, ~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~m1~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [626] $Ultimate##0-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_125| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_125|) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_125| 0)) (= (+ 2 v_~s~0_893) v_~s~0_892) (= v_~t~0_637 (+ v_~t~0_638 1)) (= |v_thread3Thread1of1ForFork2_#res#1.offset_113| 0) (= |v_thread4Thread1of1ForFork0_#res#1.base_145| 0) (= v_~t~0_638 v_~m2~0_230) (= v_~b~0_685 (ite (= (ite (let ((.cse0 (= v_~x~0_372 1))) (or (not (= (mod (ite (= (ite (or .cse0 (not (= (mod v_~b~0_686 256) 0))) 1 0) 0) 0 1) 256) 0)) .cse0)) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_145| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_113| 0) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_113| 0)) (= (ite (<= v_~m3~0_257 v_~s~0_893) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_113|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_113| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_113|) (= (ite (<= (+ v_~m4~0_224 1) v_~s~0_892) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_125|)) InVars {~m3~0=v_~m3~0_257, ~b~0=v_~b~0_686, ~m4~0=v_~m4~0_224, ~x~0=v_~x~0_372, ~s~0=v_~s~0_893, ~t~0=v_~t~0_638} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_145|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_113|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_113|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_108|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_133|, ~m3~0=v_~m3~0_257, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_113|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_149|, ~b~0=v_~b~0_685, ~m4~0=v_~m4~0_224, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_113|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_125|, ~m2~0=v_~m2~0_230, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_145|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_125|, ~x~0=v_~x~0_372, ~s~0=v_~s~0_892, ~t~0=v_~t~0_637} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread3Thread1of1ForFork2_#t~post6#1, thread3Thread1of1ForFork2_#res#1.offset, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~m2~0, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~t~0] [2022-12-06 00:07:36,850 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] $Ultimate##0-->L105: Formula: (and (= (+ v_~t~0_55 1) v_~t~0_54) (= v_~m4~0_7 v_~t~0_55)) InVars {~t~0=v_~t~0_55} OutVars{~m4~0=v_~m4~0_7, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_1|, ~t~0=v_~t~0_54} AuxVars[] AssignedVars[~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~t~0] and [376] $Ultimate##0-->L45: Formula: (and (= (+ v_~t~0_51 1) v_~t~0_50) (= v_~m1~0_9 v_~t~0_51)) InVars {~t~0=v_~t~0_51} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_50} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m1~0, ~t~0] [2022-12-06 00:07:36,873 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [629] $Ultimate##0-->L45: Formula: (and (= v_~m2~0_234 (+ v_~t~0_655 1)) (= v_~t~0_655 v_~m3~0_263) (= (+ v_~t~0_655 3) v_~m1~0_215) (= v_~t~0_653 (+ v_~t~0_655 4)) (= (+ v_~t~0_655 2) v_~m4~0_230)) InVars {~t~0=v_~t~0_655} OutVars{~m3~0=v_~m3~0_263, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_119|, ~m4~0=v_~m4~0_230, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_112|, ~m1~0=v_~m1~0_215, ~m2~0=v_~m2~0_234, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_112|, ~t~0=v_~t~0_653, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_161|} AuxVars[] AssignedVars[~m3~0, thread1Thread1of1ForFork3_#t~post1#1, ~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~m1~0, ~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [614] L86-->thread2EXIT: Formula: (and (= v_~b~0_631 (ite (= (ite (let ((.cse0 (= v_~x~0_352 1))) (or (not (= (mod (ite (= (ite (or (not (= 0 (mod v_~b~0_633 256))) .cse0) 1 0) 0) 0 1) 256) 0)) .cse0)) 1 0) 0) 0 1)) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_93|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_97| (ite (<= v_~m3~0_237 v_~s~0_840) 1 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_97| 0)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_93| 0) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_97|) (= |v_thread3Thread1of1ForFork2_#res#1.base_97| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_121| (ite (<= v_~m2~0_214 (+ v_~s~0_840 1)) 1 0)) (= (+ 2 v_~s~0_840) v_~s~0_838) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_97| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_97|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_121| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_121| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_121|)) InVars {~m3~0=v_~m3~0_237, ~b~0=v_~b~0_633, ~m2~0=v_~m2~0_214, ~x~0=v_~x~0_352, ~s~0=v_~s~0_840} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_123|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_93|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_97|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_121|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_117|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_121|, ~m3~0=v_~m3~0_237, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_93|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_97|, ~b~0=v_~b~0_631, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_97|, ~m2~0=v_~m2~0_214, ~x~0=v_~x~0_352, ~s~0=v_~s~0_838} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0] [2022-12-06 00:07:37,056 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [628] $Ultimate##0-->L45: Formula: (and (= v_~t~0_647 (+ 3 v_~m4~0_228)) (= v_~m2~0_232 (+ v_~m4~0_228 1)) (= v_~m4~0_228 (+ v_~t~0_649 1)) (= v_~t~0_649 v_~m3~0_261) (= v_~t~0_647 (+ 1 v_~m1~0_213))) InVars {~t~0=v_~t~0_649} OutVars{~m3~0=v_~m3~0_261, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_117|, ~m4~0=v_~m4~0_228, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_110|, ~m1~0=v_~m1~0_213, ~m2~0=v_~m2~0_232, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_110|, ~t~0=v_~t~0_647, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_159|} AuxVars[] AssignedVars[~m3~0, thread1Thread1of1ForFork3_#t~post1#1, ~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~m1~0, ~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [619] L86-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_#res#1.base_135| 0) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_115| 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_105| 0)) (= (ite (<= (+ v_~m4~0_210 1) v_~s~0_864) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_115|) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_115| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_115|) (= (+ 2 v_~s~0_866) v_~s~0_864) (= |v_thread4Thread1of1ForFork0_#res#1.offset_135| 0) (= (ite (<= v_~m3~0_245 v_~s~0_866) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_105|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_105| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_105|) (= (ite (= (ite (let ((.cse0 (= v_~x~0_362 1))) (or (not (= (mod (ite (= (ite (or .cse0 (not (= (mod v_~b~0_659 256) 0))) 1 0) 0) 0 1) 256) 0)) .cse0)) 1 0) 0) 0 1) v_~b~0_657) (= |v_thread3Thread1of1ForFork2_#res#1.base_105| 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_105| 0)) InVars {~m3~0=v_~m3~0_245, ~b~0=v_~b~0_659, ~m4~0=v_~m4~0_210, ~x~0=v_~x~0_362, ~s~0=v_~s~0_866} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_135|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_105|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_105|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_125|, ~m3~0=v_~m3~0_245, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_105|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_139|, ~b~0=v_~b~0_657, ~m4~0=v_~m4~0_210, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_105|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_115|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_135|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_115|, ~x~0=v_~x~0_362, ~s~0=v_~s~0_864} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0] [2022-12-06 00:07:37,243 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [469] L105-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_317 1) v_~s~0_316) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_37| 0) (= v_~b~0_139 (ite (= (ite (or (not (= 0 (mod v_~b~0_140 256))) (= v_~x~0_89 1)) 1 0) 0) 0 1)) (= (ite (<= v_~m4~0_31 v_~s~0_317) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= |v_thread4Thread1of1ForFork0_#res#1.base_37| 0)) InVars {~b~0=v_~b~0_140, ~m4~0=v_~m4~0_31, ~x~0=v_~x~0_89, ~s~0=v_~s~0_317} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_37|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_41|, ~b~0=v_~b~0_139, ~m4~0=v_~m4~0_31, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_37|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, ~x~0=v_~x~0_89, ~s~0=v_~s~0_316} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0] and [516] L45-->thread2EXIT: Formula: (let ((.cse0 (= v_~x~0_168 1))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_79 v_~s~0_449) 1 0)) (not (= 0 |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_43|)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_43| |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_43|) (= v_~b~0_251 (ite (= (ite (or (not (= (mod v_~b~0_252 256) 0)) .cse0) 1 0) 0) 0 1)) (= v_~s~0_448 (+ v_~s~0_449 1)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_13| 0) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_13|) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_43| (ite (<= v_~m1~0_87 v_~s~0_449) 1 0)) .cse0)) InVars {~b~0=v_~b~0_252, ~m2~0=v_~m2~0_79, ~m1~0=v_~m1~0_87, ~s~0=v_~s~0_449} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_13|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_43|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_43|, ~b~0=v_~b~0_251, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_13|, ~m2~0=v_~m2~0_79, ~m1~0=v_~m1~0_87, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|, ~x~0=v_~x~0_168, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_43|, ~s~0=v_~s~0_448} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:37,363 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [631] $Ultimate##0-->L45: Formula: (and (= v_~t~0_667 v_~m4~0_234) (= v_~t~0_665 (+ 1 v_~m1~0_219)) (= v_~t~0_665 (+ v_~t~0_667 2))) InVars {~t~0=v_~t~0_667} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_123|, ~m4~0=v_~m4~0_234, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_116|, ~m1~0=v_~m1~0_219, ~t~0=v_~t~0_665} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~m1~0, ~t~0] and [383] $Ultimate##0-->L67: Formula: (and (= v_~t~0_46 (+ v_~t~0_47 1)) (= v_~m2~0_11 v_~t~0_47)) InVars {~t~0=v_~t~0_47} OutVars{thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_46} AuxVars[] AssignedVars[~m2~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0] [2022-12-06 00:07:37,398 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [635] $Ultimate##0-->L67: Formula: (and (= v_~t~0_681 v_~m4~0_242) (= (+ v_~t~0_681 1) v_~m1~0_227) (= (+ 1 v_~m1~0_227) v_~m2~0_244) (= v_~t~0_679 (+ 2 v_~m1~0_227))) InVars {~t~0=v_~t~0_681} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_129|, ~m4~0=v_~m4~0_242, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_122|, ~m2~0=v_~m2~0_244, ~m1~0=v_~m1~0_227, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_120|, ~t~0=v_~t~0_679} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~m2~0, ~m1~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0] and [634] L105-->thread2EXIT: Formula: (let ((.cse1 (= v_~x~0_380 1)) (.cse0 (+ v_~s~0_910 1))) (and (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_67| (ite (<= v_~m1~0_225 .cse0) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_127| 0)) .cse1 (= |v_thread2Thread1of1ForFork1_#res#1.offset_99| 0) (= (ite (<= v_~m4~0_240 v_~s~0_910) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_131|) (= |v_thread4Thread1of1ForFork0_#res#1.offset_151| 0) (= v_~b~0_701 (ite (= (ite (or .cse1 (not (= (mod (ite (= (ite (or (= v_~x~0_381 1) (not (= (mod v_~b~0_703 256) 0))) 1 0) 0) 0 1) 256) 0))) 1 0) 0) 0 1)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_67| |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_67|) (not (= 0 |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_67|)) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| 0)) (= |v_thread4Thread1of1ForFork0_#res#1.base_151| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127| (ite (<= v_~m2~0_242 .cse0) 1 0)) (= v_~s~0_908 (+ 2 v_~s~0_910)) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_99|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_127|) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_131|))) InVars {~b~0=v_~b~0_703, ~m4~0=v_~m4~0_240, ~m2~0=v_~m2~0_242, ~m1~0=v_~m1~0_225, ~x~0=v_~x~0_381, ~s~0=v_~s~0_910} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_151|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_129|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_99|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_127|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_99|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_67|, ~b~0=v_~b~0_701, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_155|, ~m4~0=v_~m4~0_240, ~m2~0=v_~m2~0_242, ~m1~0=v_~m1~0_225, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_131|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_151|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, ~x~0=v_~x~0_380, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_67|, ~s~0=v_~s~0_908} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~b~0, thread4Thread1of1ForFork0_#t~post8#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x~0, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:37,611 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [633] $Ultimate##0-->thread4EXIT: Formula: (let ((.cse0 (+ v_~m4~0_238 1))) (and (= (ite (<= .cse0 v_~s~0_904) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_129|) (= |v_thread4Thread1of1ForFork0_#res#1.offset_149| 0) (= (+ 2 v_~s~0_905) v_~s~0_904) (= v_~t~0_675 (+ 3 v_~m4~0_238)) (= v_~m2~0_240 .cse0) (= v_~m4~0_238 (+ v_~t~0_676 1)) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_129| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_129|) (= (ite (<= v_~m3~0_269 v_~s~0_905) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_119|) (= |v_thread3Thread1of1ForFork2_#res#1.base_119| 0) (= v_~t~0_676 v_~m3~0_269) (= |v_thread4Thread1of1ForFork0_#res#1.base_149| 0) (= (ite (= (ite (let ((.cse1 (= v_~x~0_378 1))) (or .cse1 (not (= 0 (mod (ite (= (ite (or (not (= (mod v_~b~0_698 256) 0)) .cse1) 1 0) 0) 0 1) 256))))) 1 0) 0) 0 1) v_~b~0_697) (= v_~t~0_675 (+ 1 v_~m1~0_223)) (= |v_thread3Thread1of1ForFork2_#res#1.offset_119| 0) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_119| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_119|) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_119| 0)))) InVars {~b~0=v_~b~0_698, ~x~0=v_~x~0_378, ~s~0=v_~s~0_905, ~t~0=v_~t~0_676} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_149|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_119|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_120|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_119|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_118|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_139|, ~m3~0=v_~m3~0_269, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_127|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_119|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_153|, ~b~0=v_~b~0_697, ~m4~0=v_~m4~0_238, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_119|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_129|, ~m1~0=v_~m1~0_223, ~m2~0=v_~m2~0_240, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_149|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_129|, ~x~0=v_~x~0_378, ~s~0=v_~s~0_904, ~t~0=v_~t~0_675, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_167|} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#t~post7#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread3Thread1of1ForFork2_#t~post6#1, ~m3~0, thread1Thread1of1ForFork3_#t~post1#1, thread3Thread1of1ForFork2_#res#1.offset, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, ~m4~0, thread3Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~m1~0, ~m2~0, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [516] L45-->thread2EXIT: Formula: (let ((.cse0 (= v_~x~0_168 1))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_79 v_~s~0_449) 1 0)) (not (= 0 |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_43|)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_43| |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_43|) (= v_~b~0_251 (ite (= (ite (or (not (= (mod v_~b~0_252 256) 0)) .cse0) 1 0) 0) 0 1)) (= v_~s~0_448 (+ v_~s~0_449 1)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_13| 0) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_13|) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_43| (ite (<= v_~m1~0_87 v_~s~0_449) 1 0)) .cse0)) InVars {~b~0=v_~b~0_252, ~m2~0=v_~m2~0_79, ~m1~0=v_~m1~0_87, ~s~0=v_~s~0_449} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_13|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_43|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_43|, ~b~0=v_~b~0_251, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_13|, ~m2~0=v_~m2~0_79, ~m1~0=v_~m1~0_87, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|, ~x~0=v_~x~0_168, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_43|, ~s~0=v_~s~0_448} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:37,971 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [630] $Ultimate##0-->thread4EXIT: Formula: (let ((.cse1 (+ v_~m4~0_232 1))) (and (= |v_thread3Thread1of1ForFork2_#res#1.base_115| 0) (= (ite (<= v_~m3~0_265 v_~s~0_897) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_115|) (= (+ v_~t~0_661 1) v_~m4~0_232) (= |v_thread4Thread1of1ForFork0_#res#1.offset_147| 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_115| 0) (= |v_thread4Thread1of1ForFork0_#res#1.base_147| 0) (= v_~b~0_689 (ite (= (ite (let ((.cse0 (= v_~x~0_374 1))) (or (not (= (mod (ite (= (ite (or (not (= (mod v_~b~0_690 256) 0)) .cse0) 1 0) 0) 0 1) 256) 0)) .cse0)) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_127| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_127|) (= v_~t~0_661 v_~m3~0_265) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_115| 0)) (= v_~m2~0_236 (+ 1 v_~m1~0_217)) (= v_~t~0_659 (+ 2 v_~m1~0_217)) (= (ite (<= .cse1 v_~s~0_896) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_127|) (= .cse1 v_~m1~0_217) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_115| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_115|) (= (+ 2 v_~s~0_897) v_~s~0_896))) InVars {~b~0=v_~b~0_690, ~x~0=v_~x~0_374, ~s~0=v_~s~0_897, ~t~0=v_~t~0_661} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_147|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_115|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_114|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_115|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_114|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_135|, ~m3~0=v_~m3~0_265, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_121|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_115|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_151|, ~b~0=v_~b~0_689, ~m4~0=v_~m4~0_232, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_115|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_127|, ~m2~0=v_~m2~0_236, ~m1~0=v_~m1~0_217, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_147|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_127|, ~x~0=v_~x~0_374, ~s~0=v_~s~0_896, ~t~0=v_~t~0_659, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_163|} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#t~post7#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread3Thread1of1ForFork2_#t~post6#1, ~m3~0, thread1Thread1of1ForFork3_#t~post1#1, thread3Thread1of1ForFork2_#res#1.offset, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, ~m4~0, thread3Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~m2~0, ~m1~0, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [516] L45-->thread2EXIT: Formula: (let ((.cse0 (= v_~x~0_168 1))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m2~0_79 v_~s~0_449) 1 0)) (not (= 0 |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_43|)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_43| |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_43|) (= v_~b~0_251 (ite (= (ite (or (not (= (mod v_~b~0_252 256) 0)) .cse0) 1 0) 0) 0 1)) (= v_~s~0_448 (+ v_~s~0_449 1)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_13| 0) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_13|) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_43| (ite (<= v_~m1~0_87 v_~s~0_449) 1 0)) .cse0)) InVars {~b~0=v_~b~0_252, ~m2~0=v_~m2~0_79, ~m1~0=v_~m1~0_87, ~s~0=v_~s~0_449} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_13|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_43|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_43|, ~b~0=v_~b~0_251, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_13|, ~m2~0=v_~m2~0_79, ~m1~0=v_~m1~0_87, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|, ~x~0=v_~x~0_168, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_43|, ~s~0=v_~s~0_448} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~b~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:38,327 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [632] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_125| (ite (<= v_~m2~0_238 (+ v_~s~0_901 1)) 1 0)) (= |v_thread3Thread1of1ForFork2_#res#1.offset_117| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_97| 0) (= v_~t~0_671 (+ v_~t~0_672 4)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|) (= v_~m2~0_238 (+ v_~t~0_672 1)) (= (ite (<= v_~m3~0_267 v_~s~0_901) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_117|) (= (+ v_~t~0_672 3) v_~m1~0_221) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_97|) (= v_~m4~0_236 (+ v_~t~0_672 2)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_117| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_117|) (= (+ 2 v_~s~0_901) v_~s~0_900) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| 0)) (= v_~t~0_672 v_~m3~0_267) (= v_~b~0_693 (ite (= (ite (let ((.cse0 (= v_~x~0_376 1))) (or .cse0 (not (= (mod (ite (= (ite (or (not (= (mod v_~b~0_694 256) 0)) .cse0) 1 0) 0) 0 1) 256) 0)))) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork2_#res#1.base_117| 0)) InVars {~b~0=v_~b~0_694, ~x~0=v_~x~0_376, ~s~0=v_~s~0_901, ~t~0=v_~t~0_672} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_117|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_127|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_118|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_97|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_117|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_125|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_116|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_137|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, ~m3~0=v_~m3~0_267, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_125|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_97|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_117|, ~b~0=v_~b~0_693, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_117|, ~m4~0=v_~m4~0_236, ~m2~0=v_~m2~0_238, ~m1~0=v_~m1~0_221, ~x~0=v_~x~0_376, ~s~0=v_~s~0_900, ~t~0=v_~t~0_671, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_165|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4#1, thread4Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread3Thread1of1ForFork2_#t~post6#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~m3~0, thread1Thread1of1ForFork3_#t~post1#1, thread2Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, ~m4~0, ~m2~0, ~m1~0, ~s~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [515] L45-->thread4EXIT: Formula: (let ((.cse0 (= v_~x~0_166 1))) (and (= |v_thread4Thread1of1ForFork0_#res#1.offset_47| 0) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_27| 0)) (not (= 0 |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_41|)) (= (+ v_~s~0_445 1) v_~s~0_444) .cse0 (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m1~0_85 v_~s~0_445) 1 0)) (= |v_thread4Thread1of1ForFork0_#res#1.base_47| 0) (= (ite (= (ite (or .cse0 (not (= (mod v_~b~0_248 256) 0))) 1 0) 0) 0 1) v_~b~0_247) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_41| |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_41|) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m4~0_65 v_~s~0_445) 1 0)) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_27| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_27|))) InVars {~b~0=v_~b~0_248, ~m4~0=v_~m4~0_65, ~m1~0=v_~m1~0_85, ~s~0=v_~s~0_445} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_47|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_41|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_51|, ~b~0=v_~b~0_247, ~m4~0=v_~m4~0_65, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_85, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_47|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_27|, ~x~0=v_~x~0_166, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_41|, ~s~0=v_~s~0_444} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x~0, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:38,703 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [608] $Ultimate##0-->thread3EXIT: Formula: (and (= (ite (= (ite (or (not (= (mod v_~b~0_608 256) 0)) (= v_~x~0_340 1)) 1 0) 0) 0 1) v_~b~0_607) (= v_~t~0_557 (+ v_~t~0_558 1)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_85| 0)) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_85|) (= (ite (<= v_~m3~0_225 v_~s~0_815) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_85|) (= |v_thread3Thread1of1ForFork2_#res#1.base_85| 0) (= v_~t~0_558 v_~m3~0_225) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_85| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_85|) (= (+ v_~s~0_815 1) v_~s~0_814)) InVars {~b~0=v_~b~0_608, ~x~0=v_~x~0_340, ~s~0=v_~s~0_815, ~t~0=v_~t~0_558} OutVars{~m3~0=v_~m3~0_225, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_85|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_85|, ~b~0=v_~b~0_607, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_85|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_85|, ~x~0=v_~x~0_340, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_105|, ~s~0=v_~s~0_814, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_129|, ~t~0=v_~t~0_557} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] and [636] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse0 (+ v_~s~0_915 1)) (.cse1 (= v_~x~0_384 1))) (and (= (ite (<= v_~m2~0_246 .cse0) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129|) (= v_~t~0_685 (+ 2 v_~m1~0_229)) (= v_~b~0_707 (ite (= 0 (ite (or (not (= (mod (ite (= 0 (ite (or (not (= (mod v_~b~0_708 256) 0)) (= v_~x~0_385 1)) 1 0)) 0 1) 256) 0)) .cse1) 1 0)) 0 1)) (= (ite (<= v_~m1~0_229 .cse0) 1 0) |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_69|) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_133| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_133|) (= |v_thread4Thread1of1ForFork0_#res#1.offset_153| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_101| 0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_129| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_129|) (= (ite (<= v_~m4~0_244 v_~s~0_915) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_133|) (= |v_thread4Thread1of1ForFork0_#res#1.base_153| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_101| 0) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_69| |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_69|) (= v_~t~0_686 v_~m4~0_244) (= (+ v_~t~0_686 1) v_~m1~0_229) (= v_~m2~0_246 (+ 1 v_~m1~0_229)) .cse1 (= (+ 2 v_~s~0_915) v_~s~0_914))) InVars {~b~0=v_~b~0_708, ~x~0=v_~x~0_385, ~s~0=v_~s~0_915, ~t~0=v_~t~0_686} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_153|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_131|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_124|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_101|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_122|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_129|, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_131|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_101|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_69|, ~b~0=v_~b~0_707, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_157|, ~m4~0=v_~m4~0_244, ~m2~0=v_~m2~0_246, ~m1~0=v_~m1~0_229, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_133|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_153|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_133|, ~x~0=v_~x~0_384, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_69|, ~s~0=v_~s~0_914, ~t~0=v_~t~0_685} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, thread4Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~post1#1, thread2Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~b~0, thread4Thread1of1ForFork0_#t~post8#1, ~m4~0, ~m2~0, ~m1~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x~0, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~s~0, ~t~0] [2022-12-06 00:07:39,046 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [608] $Ultimate##0-->thread3EXIT: Formula: (and (= (ite (= (ite (or (not (= (mod v_~b~0_608 256) 0)) (= v_~x~0_340 1)) 1 0) 0) 0 1) v_~b~0_607) (= v_~t~0_557 (+ v_~t~0_558 1)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_85| 0)) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_85|) (= (ite (<= v_~m3~0_225 v_~s~0_815) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_85|) (= |v_thread3Thread1of1ForFork2_#res#1.base_85| 0) (= v_~t~0_558 v_~m3~0_225) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_85| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_85|) (= (+ v_~s~0_815 1) v_~s~0_814)) InVars {~b~0=v_~b~0_608, ~x~0=v_~x~0_340, ~s~0=v_~s~0_815, ~t~0=v_~t~0_558} OutVars{~m3~0=v_~m3~0_225, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_85|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_85|, ~b~0=v_~b~0_607, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_85|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_85|, ~x~0=v_~x~0_340, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_105|, ~s~0=v_~s~0_814, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_129|, ~t~0=v_~t~0_557} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] and [515] L45-->thread4EXIT: Formula: (let ((.cse0 (= v_~x~0_166 1))) (and (= |v_thread4Thread1of1ForFork0_#res#1.offset_47| 0) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_27| 0)) (not (= 0 |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_41|)) (= (+ v_~s~0_445 1) v_~s~0_444) .cse0 (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m1~0_85 v_~s~0_445) 1 0)) (= |v_thread4Thread1of1ForFork0_#res#1.base_47| 0) (= (ite (= (ite (or .cse0 (not (= (mod v_~b~0_248 256) 0))) 1 0) 0) 0 1) v_~b~0_247) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_41| |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_41|) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m4~0_65 v_~s~0_445) 1 0)) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_27| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_27|))) InVars {~b~0=v_~b~0_248, ~m4~0=v_~m4~0_65, ~m1~0=v_~m1~0_85, ~s~0=v_~s~0_445} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_47|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_41|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_51|, ~b~0=v_~b~0_247, ~m4~0=v_~m4~0_65, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_85, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_47|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_27|, ~x~0=v_~x~0_166, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_41|, ~s~0=v_~s~0_444} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x~0, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 00:07:39,195 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [635] $Ultimate##0-->L67: Formula: (and (= v_~t~0_681 v_~m4~0_242) (= (+ v_~t~0_681 1) v_~m1~0_227) (= (+ 1 v_~m1~0_227) v_~m2~0_244) (= v_~t~0_679 (+ 2 v_~m1~0_227))) InVars {~t~0=v_~t~0_681} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_129|, ~m4~0=v_~m4~0_242, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_122|, ~m2~0=v_~m2~0_244, ~m1~0=v_~m1~0_227, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_120|, ~t~0=v_~t~0_679} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~m2~0, ~m1~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0] and [641] $Ultimate##0-->thread4EXIT: Formula: (let ((.cse0 (= v_~x~0_404 1))) (and (= |v_thread4Thread1of1ForFork0_#res#1.base_163| 0) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_129| 0)) (= (ite (<= v_~m3~0_279 v_~s~0_944) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_129|) (= v_~b~0_735 (ite (= (ite (or (not (= (mod (ite (= (ite (or (= v_~x~0_405 1) (not (= 0 (mod v_~b~0_737 256)))) 1 0) 0) 0 1) 256) 0)) .cse0) 1 0) 0) 0 1)) (= (+ v_~t~0_708 1) v_~t~0_707) (= |v_thread3Thread1of1ForFork2_#res#1.base_129| 0) (not (= 0 |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_79|)) (= (ite (<= (+ v_~m4~0_254 1) v_~s~0_942) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_143|) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_143|) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_79| (ite (<= (+ 1 v_~m1~0_239) v_~s~0_942) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_79| |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_79|) (= v_~t~0_708 v_~m3~0_279) .cse0 (= |v_thread3Thread1of1ForFork2_#res#1.offset_129| 0) (= |v_thread4Thread1of1ForFork0_#res#1.offset_163| 0) (not (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| 0)) (= (+ 2 v_~s~0_944) v_~s~0_942) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_129| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_129|))) InVars {~b~0=v_~b~0_737, ~m4~0=v_~m4~0_254, ~m1~0=v_~m1~0_239, ~x~0=v_~x~0_405, ~s~0=v_~s~0_944, ~t~0=v_~t~0_708} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_163|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_129|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_129|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_149|, ~m3~0=v_~m3~0_279, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_129|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_79|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_167|, ~b~0=v_~b~0_735, ~m4~0=v_~m4~0_254, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_129|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_143|, ~m1~0=v_~m1~0_239, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_163|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_143|, ~x~0=v_~x~0_404, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_79|, ~s~0=v_~s~0_942, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_177|, ~t~0=v_~t~0_707} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~m3~0, thread3Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#t~post8#1, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x~0, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~s~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] [2022-12-06 00:07:39,437 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [608] $Ultimate##0-->thread3EXIT: Formula: (and (= (ite (= (ite (or (not (= (mod v_~b~0_608 256) 0)) (= v_~x~0_340 1)) 1 0) 0) 0 1) v_~b~0_607) (= v_~t~0_557 (+ v_~t~0_558 1)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_85| 0)) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_85|) (= (ite (<= v_~m3~0_225 v_~s~0_815) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_85|) (= |v_thread3Thread1of1ForFork2_#res#1.base_85| 0) (= v_~t~0_558 v_~m3~0_225) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_85| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_85|) (= (+ v_~s~0_815 1) v_~s~0_814)) InVars {~b~0=v_~b~0_608, ~x~0=v_~x~0_340, ~s~0=v_~s~0_815, ~t~0=v_~t~0_558} OutVars{~m3~0=v_~m3~0_225, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_85|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_85|, ~b~0=v_~b~0_607, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_85|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_85|, ~x~0=v_~x~0_340, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_105|, ~s~0=v_~s~0_814, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_129|, ~t~0=v_~t~0_557} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#res#1.offset, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post6#1, ~s~0, thread3Thread1of1ForFork2_#t~post5#1, ~t~0] and [635] $Ultimate##0-->L67: Formula: (and (= v_~t~0_681 v_~m4~0_242) (= (+ v_~t~0_681 1) v_~m1~0_227) (= (+ 1 v_~m1~0_227) v_~m2~0_244) (= v_~t~0_679 (+ 2 v_~m1~0_227))) InVars {~t~0=v_~t~0_681} OutVars{thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_129|, ~m4~0=v_~m4~0_242, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_122|, ~m2~0=v_~m2~0_244, ~m1~0=v_~m1~0_227, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_120|, ~t~0=v_~t~0_679} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#t~post1#1, ~m4~0, thread4Thread1of1ForFork0_#t~post7#1, ~m2~0, ~m1~0, thread2Thread1of1ForFork1_#t~post3#1, ~t~0] [2022-12-06 00:07:39,513 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [640] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse1 (+ 2 v_~s~0_938)) (.cse0 (= v_~x~0_400 1))) (and (= (+ 2 v_~m1~0_237) v_~t~0_701) (= v_~t~0_703 v_~m3~0_277) (= |v_thread4Thread1of1ForFork0_#res#1.base_161| 0) .cse0 (= |v_thread3Thread1of1ForFork2_#res#1.base_127| 0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_137| 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_77| |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_77|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_127| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_127|) (= (+ 3 v_~s~0_938) v_~s~0_936) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_77| (ite (<= v_~m1~0_237 .cse1) 1 0)) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_141| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_141|) (= v_~m4~0_252 (+ v_~t~0_703 1)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_161| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_109| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_137|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137| (ite (<= v_~m2~0_254 .cse1) 1 0)) (= |v_thread2Thread1of1ForFork1_#res#1.base_109| 0) (= v_~m2~0_254 (+ 1 v_~m1~0_237)) (= (+ v_~t~0_703 2) v_~m1~0_237) (= (ite (<= v_~m3~0_277 v_~s~0_938) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_127|) (= (ite (= (ite (or .cse0 (not (= (mod (ite (= (ite (let ((.cse2 (= v_~x~0_401 1))) (or (not (= (mod (ite (= 0 (ite (or (not (= (mod v_~b~0_731 256) 0)) .cse2) 1 0)) 0 1) 256) 0)) .cse2)) 1 0) 0) 0 1) 256) 0))) 1 0) 0) 0 1) v_~b~0_729) (= |v_thread3Thread1of1ForFork2_#res#1.offset_127| 0) (= (ite (<= v_~m4~0_252 (+ v_~s~0_938 1)) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_141|))) InVars {~b~0=v_~b~0_731, ~x~0=v_~x~0_401, ~s~0=v_~s~0_938, ~t~0=v_~t~0_703} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_139|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_132|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_109|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_130|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_147|, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_139|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_165|, ~m4~0=v_~m4~0_252, ~m2~0=v_~m2~0_254, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_161|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_141|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_77|, ~s~0=v_~s~0_936, thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_161|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_127|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_127|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_137|, ~m3~0=v_~m3~0_277, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_109|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_127|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_77|, ~b~0=v_~b~0_729, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_127|, ~m1~0=v_~m1~0_237, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_141|, ~x~0=v_~x~0_400, ~t~0=v_~t~0_701, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_175|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread4Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread3Thread1of1ForFork2_#t~post6#1, thread1Thread1of1ForFork3_#t~post1#1, thread4Thread1of1ForFork0_#t~post8#1, ~m4~0, ~m2~0, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~s~0, thread4Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~m3~0, thread2Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~b~0, thread3Thread1of1ForFork2_#res#1.base, ~m1~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~x~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [492] L52-->thread1EXIT: Formula: (and (= v_~x~0_115 0) (= |v_thread1Thread1of1ForFork3_#res#1.base_37| 0) (= (+ v_~s~0_371 1) v_~s~0_370) (= |v_thread1Thread1of1ForFork3_#res#1.offset_37| 0)) InVars {~s~0=v_~s~0_371} OutVars{thread1Thread1of1ForFork3_#res#1.base=|v_thread1Thread1of1ForFork3_#res#1.base_37|, thread1Thread1of1ForFork3_#t~post2#1=|v_thread1Thread1of1ForFork3_#t~post2#1_43|, thread1Thread1of1ForFork3_#res#1.offset=|v_thread1Thread1of1ForFork3_#res#1.offset_37|, ~x~0=v_~x~0_115, ~s~0=v_~s~0_370} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#res#1.base, thread1Thread1of1ForFork3_#t~post2#1, thread1Thread1of1ForFork3_#res#1.offset, ~x~0, ~s~0] [2022-12-06 00:07:39,741 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [637] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse2 (+ 1 v_~m1~0_231)) (.cse0 (= v_~x~0_388 1))) (and (= |v_thread2Thread1of1ForFork1_#res#1.base_103| 0) (= v_~b~0_711 (ite (= (ite (or .cse0 (not (= (mod (ite (= 0 (ite (let ((.cse1 (= v_~x~0_389 1))) (or (not (= (mod (ite (= (ite (or (not (= (mod v_~b~0_713 256) 0)) .cse1) 1 0) 0) 0 1) 256) 0)) .cse1)) 1 0)) 0 1) 256) 0))) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_155| 0) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_71| |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_71|) (= |v_thread4Thread1of1ForFork0_#res#1.base_155| 0) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_71| (ite (<= .cse2 v_~s~0_918) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_131|) (not (= 0 |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_71|)) (= v_~t~0_689 .cse2) (= v_~t~0_690 v_~m3~0_271) (= v_~m4~0_246 (+ v_~t~0_690 1)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_103| 0) .cse0 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_121| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_121|) (= |v_thread3Thread1of1ForFork2_#res#1.base_121| 0) (= v_~t~0_689 (+ 3 v_~m4~0_246)) (= (ite (<= (+ 2 v_~m4~0_246) v_~s~0_918) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_135|) (= v_~m2~0_248 (+ v_~m4~0_246 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| (ite (<= (+ v_~m2~0_248 1) v_~s~0_918) 1 0)) (= (ite (<= v_~m3~0_271 v_~s~0_920) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_121|) (= |v_thread3Thread1of1ForFork2_#res#1.offset_121| 0) (= (+ 3 v_~s~0_920) v_~s~0_918) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_135| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_135|))) InVars {~b~0=v_~b~0_713, ~x~0=v_~x~0_389, ~s~0=v_~s~0_920, ~t~0=v_~t~0_690} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_133|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_126|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_103|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_124|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_141|, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_133|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_159|, ~m4~0=v_~m4~0_246, ~m2~0=v_~m2~0_248, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_155|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_135|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_71|, ~s~0=v_~s~0_918, thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_155|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_121|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_121|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_131|, ~m3~0=v_~m3~0_271, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_103|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_121|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_71|, ~b~0=v_~b~0_711, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_121|, ~m1~0=v_~m1~0_231, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_135|, ~x~0=v_~x~0_388, ~t~0=v_~t~0_689, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_169|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread4Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread3Thread1of1ForFork2_#t~post6#1, thread1Thread1of1ForFork3_#t~post1#1, thread4Thread1of1ForFork0_#t~post8#1, ~m4~0, ~m2~0, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~s~0, thread4Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~m3~0, thread2Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~b~0, thread3Thread1of1ForFork2_#res#1.base, ~m1~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~x~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [492] L52-->thread1EXIT: Formula: (and (= v_~x~0_115 0) (= |v_thread1Thread1of1ForFork3_#res#1.base_37| 0) (= (+ v_~s~0_371 1) v_~s~0_370) (= |v_thread1Thread1of1ForFork3_#res#1.offset_37| 0)) InVars {~s~0=v_~s~0_371} OutVars{thread1Thread1of1ForFork3_#res#1.base=|v_thread1Thread1of1ForFork3_#res#1.base_37|, thread1Thread1of1ForFork3_#t~post2#1=|v_thread1Thread1of1ForFork3_#t~post2#1_43|, thread1Thread1of1ForFork3_#res#1.offset=|v_thread1Thread1of1ForFork3_#res#1.offset_37|, ~x~0=v_~x~0_115, ~s~0=v_~s~0_370} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#res#1.base, thread1Thread1of1ForFork3_#t~post2#1, thread1Thread1of1ForFork3_#res#1.offset, ~x~0, ~s~0] [2022-12-06 00:07:39,953 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse1 (= v_~x~0_392 1)) (.cse0 (+ 1 v_~m1~0_233))) (and (= (+ v_~t~0_694 1) v_~m4~0_248) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_137| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_137|) (= (ite (<= v_~m3~0_273 v_~s~0_926) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_123|) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_73| (ite (<= .cse0 v_~s~0_924) 1 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_157| 0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_105| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_105| 0) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_123| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_123|) .cse1 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|) (= (+ v_~m4~0_248 1) v_~m1~0_233) (= |v_thread4Thread1of1ForFork0_#res#1.base_157| 0) (= (ite (<= (+ 2 v_~m4~0_248) v_~s~0_924) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_137|) (= |v_thread3Thread1of1ForFork2_#res#1.base_123| 0) (= (+ 2 v_~m1~0_233) v_~t~0_693) (= (+ 3 v_~s~0_926) v_~s~0_924) (= v_~t~0_694 v_~m3~0_273) (= |v_thread3Thread1of1ForFork2_#res#1.offset_123| 0) (= (ite (<= (+ v_~m2~0_250 1) v_~s~0_924) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_133|) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_73| |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_73|) (= v_~b~0_717 (ite (= (ite (or .cse1 (not (= (mod (ite (= (ite (let ((.cse2 (= v_~x~0_393 1))) (or .cse2 (not (= (mod (ite (= (ite (or (not (= (mod v_~b~0_719 256) 0)) .cse2) 1 0) 0) 0 1) 256) 0)))) 1 0) 0) 0 1) 256) 0))) 1 0) 0) 0 1)) (= v_~m2~0_250 .cse0))) InVars {~b~0=v_~b~0_719, ~x~0=v_~x~0_393, ~s~0=v_~s~0_926, ~t~0=v_~t~0_694} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_135|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_128|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_105|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_133|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_126|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_143|, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_135|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_161|, ~m4~0=v_~m4~0_248, ~m2~0=v_~m2~0_250, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_157|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_137|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_73|, ~s~0=v_~s~0_924, thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_157|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_123|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_123|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, ~m3~0=v_~m3~0_273, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_105|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_123|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_73|, ~b~0=v_~b~0_717, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_123|, ~m1~0=v_~m1~0_233, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_137|, ~x~0=v_~x~0_392, ~t~0=v_~t~0_693, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_171|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread4Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread3Thread1of1ForFork2_#t~post6#1, thread1Thread1of1ForFork3_#t~post1#1, thread4Thread1of1ForFork0_#t~post8#1, ~m4~0, ~m2~0, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~s~0, thread4Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~m3~0, thread2Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~b~0, thread3Thread1of1ForFork2_#res#1.base, ~m1~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~x~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [492] L52-->thread1EXIT: Formula: (and (= v_~x~0_115 0) (= |v_thread1Thread1of1ForFork3_#res#1.base_37| 0) (= (+ v_~s~0_371 1) v_~s~0_370) (= |v_thread1Thread1of1ForFork3_#res#1.offset_37| 0)) InVars {~s~0=v_~s~0_371} OutVars{thread1Thread1of1ForFork3_#res#1.base=|v_thread1Thread1of1ForFork3_#res#1.base_37|, thread1Thread1of1ForFork3_#t~post2#1=|v_thread1Thread1of1ForFork3_#t~post2#1_43|, thread1Thread1of1ForFork3_#res#1.offset=|v_thread1Thread1of1ForFork3_#res#1.offset_37|, ~x~0=v_~x~0_115, ~s~0=v_~s~0_370} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#res#1.base, thread1Thread1of1ForFork3_#t~post2#1, thread1Thread1of1ForFork3_#res#1.offset, ~x~0, ~s~0] [2022-12-06 00:07:40,167 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [639] $Ultimate##0-->thread4EXIT: Formula: (let ((.cse0 (+ 2 v_~s~0_932)) (.cse2 (= v_~x~0_396 1))) (and (not (= 0 |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_75|)) (= v_~t~0_697 (+ v_~t~0_698 4)) (= |v_thread2Thread1of1ForFork1_#res#1.base_107| 0) (= |v_thread4Thread1of1ForFork0_#res#1.base_159| 0) (= (ite (<= v_~m4~0_250 .cse0) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_139|) (= v_~m2~0_252 (+ v_~t~0_698 1)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_75| |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_75|) (= (+ v_~t~0_698 3) v_~m1~0_235) (= |v_thread3Thread1of1ForFork2_#res#1.offset_125| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_135| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_135|) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_75| (ite (<= v_~m1~0_235 .cse0) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_135| (ite (<= v_~m2~0_252 (+ v_~s~0_932 1)) 1 0)) (= |v_thread4Thread1of1ForFork0_#res#1.offset_159| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_125| 0) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_125| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_125|) (= v_~b~0_723 (ite (= (ite (or (not (= (mod (ite (= (ite (let ((.cse1 (= v_~x~0_397 1))) (or (not (= (mod (ite (= (ite (or (not (= (mod v_~b~0_725 256) 0)) .cse1) 1 0) 0) 0 1) 256) 0)) .cse1)) 1 0) 0) 0 1) 256) 0)) .cse2) 1 0) 0) 0 1)) (= v_~t~0_698 v_~m3~0_275) .cse2 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_125| (ite (<= v_~m3~0_275 v_~s~0_932) 1 0)) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_139| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_139|) (= (+ v_~t~0_698 2) v_~m4~0_250) (= |v_thread2Thread1of1ForFork1_#res#1.offset_107| 0) (= (+ 3 v_~s~0_932) v_~s~0_930))) InVars {~b~0=v_~b~0_725, ~x~0=v_~x~0_397, ~s~0=v_~s~0_932, ~t~0=v_~t~0_698} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_137|, thread4Thread1of1ForFork0_#t~post7#1=|v_thread4Thread1of1ForFork0_#t~post7#1_130|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_107|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_135|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_128|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_145|, thread1Thread1of1ForFork3_#t~post1#1=|v_thread1Thread1of1ForFork3_#t~post1#1_137|, thread4Thread1of1ForFork0_#t~post8#1=|v_thread4Thread1of1ForFork0_#t~post8#1_163|, ~m4~0=v_~m4~0_250, ~m2~0=v_~m2~0_252, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_159|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_139|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_75|, ~s~0=v_~s~0_930, thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_159|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_125|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_135|, ~m3~0=v_~m3~0_275, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_107|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_125|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_75|, ~b~0=v_~b~0_723, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_125|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_139|, ~m1~0=v_~m1~0_235, ~x~0=v_~x~0_396, ~t~0=v_~t~0_697, thread3Thread1of1ForFork2_#t~post5#1=|v_thread3Thread1of1ForFork2_#t~post5#1_173|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread4Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread3Thread1of1ForFork2_#t~post6#1, thread1Thread1of1ForFork3_#t~post1#1, thread4Thread1of1ForFork0_#t~post8#1, ~m4~0, ~m2~0, thread4Thread1of1ForFork0_#res#1.offset, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~s~0, thread4Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~m3~0, thread2Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~b~0, thread3Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~m1~0, ~x~0, ~t~0, thread3Thread1of1ForFork2_#t~post5#1] and [492] L52-->thread1EXIT: Formula: (and (= v_~x~0_115 0) (= |v_thread1Thread1of1ForFork3_#res#1.base_37| 0) (= (+ v_~s~0_371 1) v_~s~0_370) (= |v_thread1Thread1of1ForFork3_#res#1.offset_37| 0)) InVars {~s~0=v_~s~0_371} OutVars{thread1Thread1of1ForFork3_#res#1.base=|v_thread1Thread1of1ForFork3_#res#1.base_37|, thread1Thread1of1ForFork3_#t~post2#1=|v_thread1Thread1of1ForFork3_#t~post2#1_43|, thread1Thread1of1ForFork3_#res#1.offset=|v_thread1Thread1of1ForFork3_#res#1.offset_37|, ~x~0=v_~x~0_115, ~s~0=v_~s~0_370} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_#res#1.base, thread1Thread1of1ForFork3_#t~post2#1, thread1Thread1of1ForFork3_#res#1.offset, ~x~0, ~s~0] [2022-12-06 00:07:40,376 INFO L203 LiptonReduction]: Total number of compositions: 20 [2022-12-06 00:07:40,376 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4039 [2022-12-06 00:07:40,377 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 24 transitions, 187 flow [2022-12-06 00:07:40,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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 00:07:40,377 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:40,377 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:40,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-06 00:07:40,377 INFO L420 AbstractCegarLoop]: === Iteration 52 === 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 00:07:40,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:40,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1190175665, now seen corresponding path program 1 times [2022-12-06 00:07:40,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:40,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238963715] [2022-12-06 00:07:40,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:40,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:40,447 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 00:07:40,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:40,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238963715] [2022-12-06 00:07:40,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238963715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:40,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:40,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:07:40,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120362141] [2022-12-06 00:07:40,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:40,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:07:40,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:40,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:07:40,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:07:40,449 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 00:07:40,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 24 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:40,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:40,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 00:07:40,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:40,469 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-06 00:07:40,469 INFO L131 PetriNetUnfolder]: For 339/339 co-relation queries the response was YES. [2022-12-06 00:07:40,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 18 events. 3/18 cut-off events. For 339/339 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 19 event pairs, 0 based on Foata normal form. 4/22 useless extension candidates. Maximal degree in co-relation 112. Up to 10 conditions per place. [2022-12-06 00:07:40,470 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 0 selfloop transitions, 0 changer transitions 13/13 dead transitions. [2022-12-06 00:07:40,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 13 transitions, 120 flow [2022-12-06 00:07:40,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:07:40,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:07:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-12-06 00:07:40,470 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2361111111111111 [2022-12-06 00:07:40,471 INFO L175 Difference]: Start difference. First operand has 45 places, 24 transitions, 187 flow. Second operand 3 states and 17 transitions. [2022-12-06 00:07:40,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 13 transitions, 120 flow [2022-12-06 00:07:40,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 13 transitions, 70 flow, removed 15 selfloop flow, removed 13 redundant places. [2022-12-06 00:07:40,471 INFO L231 Difference]: Finished difference. Result has 25 places, 0 transitions, 0 flow [2022-12-06 00:07:40,471 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=25, PETRI_TRANSITIONS=0} [2022-12-06 00:07:40,471 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -14 predicate places. [2022-12-06 00:07:40,472 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:40,472 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 0 transitions, 0 flow [2022-12-06 00:07:40,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 00:07:40,472 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 00:07:40,472 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:07:40,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-06 00:07:40,472 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 00:07:40,472 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 00:07:40,473 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:07:40,473 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-06 00:07:40,473 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 00:07:40,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:40,475 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 00:07:40,476 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 00:07:40,476 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 00:07:40,476 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 00:07:40,476 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 00:07:40,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-06 00:07:40,477 INFO L458 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:40,479 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 00:07:40,479 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 00:07:40,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 12:07:40 BasicIcfg [2022-12-06 00:07:40,482 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 00:07:40,482 INFO L158 Benchmark]: Toolchain (without parser) took 48845.64ms. Allocated memory was 178.3MB in the beginning and 634.4MB in the end (delta: 456.1MB). Free memory was 138.3MB in the beginning and 427.1MB in the end (delta: -288.8MB). Peak memory consumption was 168.4MB. Max. memory is 8.0GB. [2022-12-06 00:07:40,483 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 178.3MB. Free memory is still 155.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:07:40,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.58ms. Allocated memory is still 178.3MB. Free memory was 137.8MB in the beginning and 123.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 00:07:40,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.07ms. Allocated memory is still 178.3MB. Free memory was 123.1MB in the beginning and 121.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:07:40,483 INFO L158 Benchmark]: Boogie Preprocessor took 38.80ms. Allocated memory is still 178.3MB. Free memory was 121.0MB in the beginning and 119.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:07:40,483 INFO L158 Benchmark]: RCFGBuilder took 650.19ms. Allocated memory is still 178.3MB. Free memory was 119.4MB in the beginning and 96.9MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-12-06 00:07:40,484 INFO L158 Benchmark]: TraceAbstraction took 47871.48ms. Allocated memory was 178.3MB in the beginning and 634.4MB in the end (delta: 456.1MB). Free memory was 95.8MB in the beginning and 427.1MB in the end (delta: -331.3MB). Peak memory consumption was 126.4MB. Max. memory is 8.0GB. [2022-12-06 00:07:40,485 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.13ms. Allocated memory is still 178.3MB. Free memory is still 155.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 222.58ms. Allocated memory is still 178.3MB. Free memory was 137.8MB in the beginning and 123.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.07ms. Allocated memory is still 178.3MB. Free memory was 123.1MB in the beginning and 121.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.80ms. Allocated memory is still 178.3MB. Free memory was 121.0MB in the beginning and 119.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 650.19ms. Allocated memory is still 178.3MB. Free memory was 119.4MB in the beginning and 96.9MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 47871.48ms. Allocated memory was 178.3MB in the beginning and 634.4MB in the end (delta: 456.1MB). Free memory was 95.8MB in the beginning and 427.1MB in the end (delta: -331.3MB). Peak memory consumption was 126.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 130 PlacesBefore, 39 PlacesAfterwards, 119 TransitionsBefore, 26 TransitionsAfterwards, 1302 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 58 TrivialYvCompositions, 33 ConcurrentYvCompositions, 2 ChoiceCompositions, 93 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 731, independent: 700, independent conditional: 700, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 731, independent: 700, independent conditional: 0, independent unconditional: 700, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 731, independent: 700, independent conditional: 0, independent unconditional: 700, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 731, independent: 700, independent conditional: 0, independent unconditional: 700, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 702, independent: 675, independent conditional: 0, independent unconditional: 675, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 702, independent: 638, independent conditional: 0, independent unconditional: 638, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 64, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 153, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 731, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 702, unknown conditional: 0, unknown unconditional: 702] , Statistics on independence cache: Total cache size (in pairs): 967, Positive cache size: 940, Positive conditional cache size: 0, Positive unconditional cache size: 940, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 39 PlacesBefore, 38 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 132, independent: 94, independent conditional: 94, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 132, independent: 94, independent conditional: 54, independent unconditional: 40, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 132, independent: 94, independent conditional: 0, independent unconditional: 94, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 132, independent: 94, independent conditional: 0, independent unconditional: 94, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 132, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 15, Positive conditional cache size: 0, Positive unconditional cache size: 15, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 54, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 336 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 6, unknown conditional: 5, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 19, Positive conditional cache size: 4, Positive unconditional cache size: 15, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 310 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 14, independent conditional: 12, independent unconditional: 2, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 14, independent conditional: 12, independent unconditional: 2, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 14, independent conditional: 12, independent unconditional: 2, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, independent: 13, independent conditional: 12, independent unconditional: 1, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 20, Positive conditional cache size: 4, Positive unconditional cache size: 16, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 260 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 20, Positive conditional cache size: 4, Positive unconditional cache size: 16, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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: 1.3s, 47 PlacesBefore, 45 PlacesAfterwards, 89 TransitionsBefore, 87 TransitionsAfterwards, 446 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 29, Positive conditional cache size: 10, Positive unconditional cache size: 19, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 129 TransitionsBefore, 129 TransitionsAfterwards, 546 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 29, Positive conditional cache size: 10, Positive unconditional cache size: 19, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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, 55 PlacesBefore, 55 PlacesAfterwards, 128 TransitionsBefore, 128 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 34, Positive conditional cache size: 15, Positive unconditional cache size: 19, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 132 TransitionsBefore, 132 TransitionsAfterwards, 508 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 34, Positive conditional cache size: 15, Positive unconditional cache size: 19, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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, 60 PlacesBefore, 60 PlacesAfterwards, 135 TransitionsBefore, 135 TransitionsAfterwards, 522 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 34, Positive conditional cache size: 15, Positive unconditional cache size: 19, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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, 67 PlacesBefore, 67 PlacesAfterwards, 154 TransitionsBefore, 154 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 34, Positive conditional cache size: 15, Positive unconditional cache size: 19, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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, 73 PlacesBefore, 73 PlacesAfterwards, 162 TransitionsBefore, 162 TransitionsAfterwards, 580 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 34, Positive conditional cache size: 15, Positive unconditional cache size: 19, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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, 79 PlacesBefore, 79 PlacesAfterwards, 204 TransitionsBefore, 204 TransitionsAfterwards, 782 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 34, Positive conditional cache size: 15, Positive unconditional cache size: 19, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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, 85 PlacesBefore, 85 PlacesAfterwards, 191 TransitionsBefore, 191 TransitionsAfterwards, 668 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 34, Positive conditional cache size: 15, Positive unconditional cache size: 19, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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, 88 PlacesBefore, 88 PlacesAfterwards, 198 TransitionsBefore, 198 TransitionsAfterwards, 678 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 34, Positive conditional cache size: 15, Positive unconditional cache size: 19, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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.7s, 90 PlacesBefore, 87 PlacesAfterwards, 187 TransitionsBefore, 185 TransitionsAfterwards, 648 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 14, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 45, Positive conditional cache size: 26, Positive unconditional cache size: 19, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 90 PlacesBefore, 90 PlacesAfterwards, 219 TransitionsBefore, 219 TransitionsAfterwards, 732 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 45, Positive conditional cache size: 26, Positive unconditional cache size: 19, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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, 94 PlacesBefore, 94 PlacesAfterwards, 218 TransitionsBefore, 218 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 46, Positive conditional cache size: 27, Positive unconditional cache size: 19, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 96 PlacesBefore, 93 PlacesAfterwards, 218 TransitionsBefore, 216 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 48, Positive conditional cache size: 29, Positive unconditional cache size: 19, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 95 PlacesBefore, 95 PlacesAfterwards, 213 TransitionsBefore, 213 TransitionsAfterwards, 720 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 48, Positive conditional cache size: 29, Positive unconditional cache size: 19, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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, 104 PlacesBefore, 104 PlacesAfterwards, 232 TransitionsBefore, 232 TransitionsAfterwards, 758 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 48, Positive conditional cache size: 29, Positive unconditional cache size: 19, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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, 108 PlacesBefore, 108 PlacesAfterwards, 227 TransitionsBefore, 227 TransitionsAfterwards, 736 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 48, Positive conditional cache size: 29, Positive unconditional cache size: 19, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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, 111 PlacesBefore, 111 PlacesAfterwards, 227 TransitionsBefore, 227 TransitionsAfterwards, 720 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 48, Positive conditional cache size: 29, Positive unconditional cache size: 19, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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, 117 PlacesBefore, 117 PlacesAfterwards, 225 TransitionsBefore, 225 TransitionsAfterwards, 712 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 48, Positive conditional cache size: 29, Positive unconditional cache size: 19, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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, 115 PlacesBefore, 115 PlacesAfterwards, 200 TransitionsBefore, 200 TransitionsAfterwards, 610 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 48, Positive conditional cache size: 29, Positive unconditional cache size: 19, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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.7s, 110 PlacesBefore, 110 PlacesAfterwards, 193 TransitionsBefore, 193 TransitionsAfterwards, 596 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 17, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 58, Positive conditional cache size: 39, Positive unconditional cache size: 19, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 110 PlacesBefore, 106 PlacesAfterwards, 190 TransitionsBefore, 188 TransitionsAfterwards, 590 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 63, Positive conditional cache size: 44, Positive unconditional cache size: 19, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 105 PlacesBefore, 105 PlacesAfterwards, 189 TransitionsBefore, 189 TransitionsAfterwards, 580 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 64, Positive conditional cache size: 45, Positive unconditional cache size: 19, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 105 PlacesBefore, 105 PlacesAfterwards, 187 TransitionsBefore, 187 TransitionsAfterwards, 576 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 64, Positive conditional cache size: 45, Positive unconditional cache size: 19, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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, 106 PlacesBefore, 106 PlacesAfterwards, 183 TransitionsBefore, 183 TransitionsAfterwards, 568 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 64, Positive conditional cache size: 45, Positive unconditional cache size: 19, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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.3s, 106 PlacesBefore, 106 PlacesAfterwards, 180 TransitionsBefore, 180 TransitionsAfterwards, 562 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 66, Positive conditional cache size: 46, Positive unconditional cache size: 20, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 104 PlacesBefore, 104 PlacesAfterwards, 145 TransitionsBefore, 145 TransitionsAfterwards, 440 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 9, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 68, Positive conditional cache size: 48, Positive unconditional cache size: 20, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 110 PlacesBefore, 109 PlacesAfterwards, 146 TransitionsBefore, 145 TransitionsAfterwards, 442 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 72, Positive conditional cache size: 52, Positive unconditional cache size: 20, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 108 PlacesBefore, 107 PlacesAfterwards, 141 TransitionsBefore, 140 TransitionsAfterwards, 432 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 75, Positive conditional cache size: 55, Positive unconditional cache size: 20, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 100 PlacesAfterwards, 137 TransitionsBefore, 137 TransitionsAfterwards, 424 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 75, Positive conditional cache size: 55, Positive unconditional cache size: 20, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 99 PlacesBefore, 99 PlacesAfterwards, 135 TransitionsBefore, 135 TransitionsAfterwards, 420 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 75, Positive conditional cache size: 55, Positive unconditional cache size: 20, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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, 101 PlacesBefore, 101 PlacesAfterwards, 134 TransitionsBefore, 134 TransitionsAfterwards, 418 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 75, Positive conditional cache size: 55, Positive unconditional cache size: 20, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 98 PlacesBefore, 98 PlacesAfterwards, 123 TransitionsBefore, 123 TransitionsAfterwards, 320 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 75, Positive conditional cache size: 55, Positive unconditional cache size: 20, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 101 PlacesBefore, 100 PlacesAfterwards, 83 TransitionsBefore, 81 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 80, Positive conditional cache size: 60, Positive unconditional cache size: 20, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 88 PlacesBefore, 88 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 82, Positive conditional cache size: 62, Positive unconditional cache size: 20, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 88 PlacesBefore, 83 PlacesAfterwards, 79 TransitionsBefore, 76 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 20, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 95, Positive conditional cache size: 72, Positive unconditional cache size: 23, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 80 PlacesBefore, 80 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 95, Positive conditional cache size: 72, Positive unconditional cache size: 23, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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, 83 PlacesBefore, 83 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 95, Positive conditional cache size: 72, Positive unconditional cache size: 23, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 88 PlacesBefore, 86 PlacesAfterwards, 71 TransitionsBefore, 69 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 97, Positive conditional cache size: 74, Positive unconditional cache size: 23, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 78 PlacesBefore, 78 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 108 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 97, Positive conditional cache size: 74, Positive unconditional cache size: 23, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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, 77 PlacesBefore, 77 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 97, Positive conditional cache size: 74, Positive unconditional cache size: 23, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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, 77 PlacesBefore, 77 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 98, Positive conditional cache size: 75, Positive unconditional cache size: 23, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 78 PlacesBefore, 72 PlacesAfterwards, 56 TransitionsBefore, 52 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 103, Positive conditional cache size: 80, Positive unconditional cache size: 23, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 65 PlacesBefore, 64 PlacesAfterwards, 48 TransitionsBefore, 47 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 104, Positive conditional cache size: 81, Positive unconditional cache size: 23, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 64 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 104, Positive conditional cache size: 81, Positive unconditional cache size: 23, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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, 57 PlacesBefore, 57 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 46 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 104, Positive conditional cache size: 81, Positive unconditional cache size: 23, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, 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: 4.0s, 55 PlacesBefore, 45 PlacesAfterwards, 36 TransitionsBefore, 24 TransitionsAfterwards, 46 CoEnabledTransitionPairs, 6 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 17 ConcurrentYvCompositions, 0 ChoiceCompositions, 20 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 41, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 41, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 41, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 0, independent unconditional: 24, 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: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 131, Positive conditional cache size: 106, Positive unconditional cache size: 25, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 131, Positive conditional cache size: 106, Positive unconditional cache size: 25, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 146]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 167 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: 47.8s, OverallIterations: 52, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 883 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 883 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10876 IncrementalHoareTripleChecker+Invalid, 11993 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1117 mSolverCounterUnsat, 0 mSDtfsCounter, 10876 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 320 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5299occurred in iteration=23, InterpolantAutomatonStates: 320, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 1164 NumberOfCodeBlocks, 1164 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 1112 ConstructedInterpolants, 0 QuantifiedInterpolants, 4397 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 52 InterpolantComputations, 52 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 00:07:40,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...