/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-multiply-verify.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:36:29,893 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:36:29,895 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:36:29,924 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:36:29,924 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:36:29,926 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:36:29,929 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:36:29,931 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:36:29,934 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:36:29,938 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:36:29,938 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:36:29,940 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:36:29,940 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:36:29,942 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:36:29,942 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:36:29,944 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:36:29,945 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:36:29,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:36:29,947 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:36:29,951 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:36:29,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:36:29,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:36:29,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:36:29,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:36:29,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:36:29,959 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:36:29,959 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:36:29,960 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:36:29,961 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:36:29,961 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:36:29,961 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:36:29,963 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:36:29,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:36:29,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:36:29,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:36:29,965 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:36:29,965 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:36:29,965 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:36:29,966 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:36:29,966 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:36:29,967 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:36:29,967 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:36:30,015 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:36:30,016 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:36:30,017 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:36:30,018 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:36:30,018 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:36:30,018 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:36:30,018 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:36:30,019 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:36:30,019 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:36:30,019 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:36:30,019 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:36:30,020 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:36:30,020 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:36:30,020 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:36:30,020 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:36:30,020 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:36:30,020 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:36:30,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:36:30,020 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:36:30,020 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:36:30,021 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:36:30,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:36:30,021 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:36:30,021 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:36:30,021 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:36:30,021 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:36:30,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:36:30,022 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:36:30,022 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 05:36:30,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:36:30,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:36:30,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:36:30,335 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:36:30,335 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:36:30,336 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-multiply-verify.wvr.c [2022-12-06 05:36:31,369 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:36:31,558 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:36:31,559 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-multiply-verify.wvr.c [2022-12-06 05:36:31,597 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73bd9d778/eb1af56927cd4e4cb88f7a91c69a8107/FLAG11cfaffc1 [2022-12-06 05:36:31,610 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73bd9d778/eb1af56927cd4e4cb88f7a91c69a8107 [2022-12-06 05:36:31,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:36:31,613 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:36:31,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:36:31,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:36:31,617 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:36:31,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:36:31" (1/1) ... [2022-12-06 05:36:31,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67e1b39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:31, skipping insertion in model container [2022-12-06 05:36:31,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:36:31" (1/1) ... [2022-12-06 05:36:31,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:36:31,647 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:36:31,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:36:31,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:36:31,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:36:31,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:36:31,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:36:31,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:36:31,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:36:31,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:36:31,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:36:31,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:36:31,822 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/popl20-more-multiply-verify.wvr.c[3042,3055] [2022-12-06 05:36:31,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:36:31,845 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:36:31,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:36:31,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:36:31,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:36:31,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:36:31,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:36:31,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:36:31,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:36:31,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:36:31,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:36:31,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:36:31,880 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/popl20-more-multiply-verify.wvr.c[3042,3055] [2022-12-06 05:36:31,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:36:31,894 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:36:31,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:31 WrapperNode [2022-12-06 05:36:31,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:36:31,896 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:36:31,896 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:36:31,896 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:36:31,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:31" (1/1) ... [2022-12-06 05:36:31,917 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:31" (1/1) ... [2022-12-06 05:36:31,948 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 179 [2022-12-06 05:36:31,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:36:31,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:36:31,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:36:31,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:36:31,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:31" (1/1) ... [2022-12-06 05:36:31,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:31" (1/1) ... [2022-12-06 05:36:31,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:31" (1/1) ... [2022-12-06 05:36:31,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:31" (1/1) ... [2022-12-06 05:36:31,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:31" (1/1) ... [2022-12-06 05:36:31,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:31" (1/1) ... [2022-12-06 05:36:31,982 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:31" (1/1) ... [2022-12-06 05:36:31,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:31" (1/1) ... [2022-12-06 05:36:31,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:36:31,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:36:31,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:36:31,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:36:31,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:31" (1/1) ... [2022-12-06 05:36:31,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:36:32,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:36:32,037 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 05:36:32,075 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 05:36:32,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:36:32,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:36:32,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:36:32,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:36:32,087 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:36:32,087 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:36:32,087 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:36:32,087 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:36:32,087 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:36:32,087 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:36:32,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:36:32,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:36:32,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:36:32,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:36:32,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:36:32,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:36:32,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:36:32,088 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 05:36:32,159 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:36:32,160 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:36:32,412 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:36:32,497 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:36:32,497 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 05:36:32,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:36:32 BoogieIcfgContainer [2022-12-06 05:36:32,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:36:32,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:36:32,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:36:32,502 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:36:32,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:36:31" (1/3) ... [2022-12-06 05:36:32,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cfd57cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:36:32, skipping insertion in model container [2022-12-06 05:36:32,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:31" (2/3) ... [2022-12-06 05:36:32,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cfd57cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:36:32, skipping insertion in model container [2022-12-06 05:36:32,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:36:32" (3/3) ... [2022-12-06 05:36:32,504 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-multiply-verify.wvr.c [2022-12-06 05:36:32,516 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:36:32,516 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:36:32,516 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:36:32,576 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 05:36:32,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 144 transitions, 312 flow [2022-12-06 05:36:32,665 INFO L130 PetriNetUnfolder]: 9/141 cut-off events. [2022-12-06 05:36:32,665 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:36:32,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 9/141 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 86 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2022-12-06 05:36:32,670 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 144 transitions, 312 flow [2022-12-06 05:36:32,681 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 131 transitions, 280 flow [2022-12-06 05:36:32,682 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:32,699 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 131 transitions, 280 flow [2022-12-06 05:36:32,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 131 transitions, 280 flow [2022-12-06 05:36:32,744 INFO L130 PetriNetUnfolder]: 9/131 cut-off events. [2022-12-06 05:36:32,745 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:36:32,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 9/131 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 85 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2022-12-06 05:36:32,747 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 131 transitions, 280 flow [2022-12-06 05:36:32,747 INFO L188 LiptonReduction]: Number of co-enabled transitions 1464 [2022-12-06 05:36:36,961 INFO L203 LiptonReduction]: Total number of compositions: 109 [2022-12-06 05:36:36,978 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:36:36,983 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;@43fc3432, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:36:36,983 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 05:36:36,987 INFO L130 PetriNetUnfolder]: 3/21 cut-off events. [2022-12-06 05:36:36,987 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:36:36,987 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:36,987 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 05:36:36,988 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 1 more)] === [2022-12-06 05:36:36,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:36,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1581976625, now seen corresponding path program 1 times [2022-12-06 05:36:36,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:36,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033407080] [2022-12-06 05:36:36,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:36,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:37,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 05:36:37,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:37,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033407080] [2022-12-06 05:36:37,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033407080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:36:37,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:36:37,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:36:37,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277386740] [2022-12-06 05:36:37,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:36:37,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:36:37,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:37,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:36:37,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:36:37,334 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:36:37,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:36:37,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:37,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:36:37,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:37,441 INFO L130 PetriNetUnfolder]: 169/271 cut-off events. [2022-12-06 05:36:37,442 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-06 05:36:37,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 271 events. 169/271 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 668 event pairs, 108 based on Foata normal form. 8/235 useless extension candidates. Maximal degree in co-relation 372. Up to 217 conditions per place. [2022-12-06 05:36:37,448 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 21 selfloop transitions, 2 changer transitions 11/34 dead transitions. [2022-12-06 05:36:37,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 34 transitions, 163 flow [2022-12-06 05:36:37,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:36:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:36:37,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 05:36:37,458 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2022-12-06 05:36:37,459 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 62 flow. Second operand 4 states and 37 transitions. [2022-12-06 05:36:37,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 34 transitions, 163 flow [2022-12-06 05:36:37,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 34 transitions, 145 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 05:36:37,465 INFO L231 Difference]: Finished difference. Result has 28 places, 23 transitions, 68 flow [2022-12-06 05:36:37,466 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=28, PETRI_TRANSITIONS=23} [2022-12-06 05:36:37,469 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2022-12-06 05:36:37,469 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:37,470 INFO L89 Accepts]: Start accepts. Operand has 28 places, 23 transitions, 68 flow [2022-12-06 05:36:37,472 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:37,473 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:37,473 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 23 transitions, 68 flow [2022-12-06 05:36:37,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 23 transitions, 68 flow [2022-12-06 05:36:37,485 INFO L130 PetriNetUnfolder]: 8/38 cut-off events. [2022-12-06 05:36:37,486 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:36:37,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 38 events. 8/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 67 event pairs, 5 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 53. Up to 13 conditions per place. [2022-12-06 05:36:37,489 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 23 transitions, 68 flow [2022-12-06 05:36:37,494 INFO L188 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-06 05:36:38,371 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:36:38,372 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 903 [2022-12-06 05:36:38,372 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 64 flow [2022-12-06 05:36:38,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:36:38,372 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:38,372 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 05:36:38,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:36:38,373 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 1 more)] === [2022-12-06 05:36:38,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:38,373 INFO L85 PathProgramCache]: Analyzing trace with hash 18405854, now seen corresponding path program 1 times [2022-12-06 05:36:38,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:38,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810391841] [2022-12-06 05:36:38,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:38,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:38,473 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 05:36:38,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:38,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810391841] [2022-12-06 05:36:38,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810391841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:36:38,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:36:38,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:36:38,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074670528] [2022-12-06 05:36:38,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:36:38,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:36:38,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:38,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:36:38,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:36:38,476 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:36:38,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:36:38,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:38,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:36:38,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:38,562 INFO L130 PetriNetUnfolder]: 212/344 cut-off events. [2022-12-06 05:36:38,563 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-06 05:36:38,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 821 conditions, 344 events. 212/344 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 966 event pairs, 141 based on Foata normal form. 26/368 useless extension candidates. Maximal degree in co-relation 812. Up to 217 conditions per place. [2022-12-06 05:36:38,564 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 21 selfloop transitions, 2 changer transitions 17/40 dead transitions. [2022-12-06 05:36:38,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 40 transitions, 193 flow [2022-12-06 05:36:38,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:36:38,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:36:38,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 05:36:38,565 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2022-12-06 05:36:38,565 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 64 flow. Second operand 4 states and 41 transitions. [2022-12-06 05:36:38,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 40 transitions, 193 flow [2022-12-06 05:36:38,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 40 transitions, 181 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 05:36:38,567 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 70 flow [2022-12-06 05:36:38,567 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2022-12-06 05:36:38,567 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2022-12-06 05:36:38,568 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:38,568 INFO L89 Accepts]: Start accepts. Operand has 29 places, 23 transitions, 70 flow [2022-12-06 05:36:38,568 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:38,568 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:38,569 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 23 transitions, 70 flow [2022-12-06 05:36:38,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 23 transitions, 70 flow [2022-12-06 05:36:38,572 INFO L130 PetriNetUnfolder]: 8/38 cut-off events. [2022-12-06 05:36:38,573 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:36:38,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 38 events. 8/38 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 67 event pairs, 5 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 57. Up to 13 conditions per place. [2022-12-06 05:36:38,573 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 23 transitions, 70 flow [2022-12-06 05:36:38,573 INFO L188 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-06 05:36:39,631 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:36:39,632 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1064 [2022-12-06 05:36:39,632 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 22 transitions, 66 flow [2022-12-06 05:36:39,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:36:39,632 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:39,633 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 05:36:39,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:36:39,633 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 1 more)] === [2022-12-06 05:36:39,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:39,633 INFO L85 PathProgramCache]: Analyzing trace with hash -826066017, now seen corresponding path program 1 times [2022-12-06 05:36:39,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:39,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692767143] [2022-12-06 05:36:39,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:39,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:41,022 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 05:36:41,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:41,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692767143] [2022-12-06 05:36:41,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692767143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:36:41,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:36:41,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 05:36:41,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531538878] [2022-12-06 05:36:41,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:36:41,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:36:41,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:41,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:36:41,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:36:41,024 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:36:41,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 22 transitions, 66 flow. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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 05:36:41,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:41,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:36:41,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:41,755 INFO L130 PetriNetUnfolder]: 386/662 cut-off events. [2022-12-06 05:36:41,755 INFO L131 PetriNetUnfolder]: For 282/282 co-relation queries the response was YES. [2022-12-06 05:36:41,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1670 conditions, 662 events. 386/662 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2574 event pairs, 165 based on Foata normal form. 13/673 useless extension candidates. Maximal degree in co-relation 1660. Up to 217 conditions per place. [2022-12-06 05:36:41,758 INFO L137 encePairwiseOnDemand]: 10/22 looper letters, 94 selfloop transitions, 16 changer transitions 9/119 dead transitions. [2022-12-06 05:36:41,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 119 transitions, 571 flow [2022-12-06 05:36:41,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:36:41,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:36:41,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2022-12-06 05:36:41,759 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5041322314049587 [2022-12-06 05:36:41,759 INFO L175 Difference]: Start difference. First operand has 27 places, 22 transitions, 66 flow. Second operand 11 states and 122 transitions. [2022-12-06 05:36:41,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 119 transitions, 571 flow [2022-12-06 05:36:41,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 119 transitions, 547 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-06 05:36:41,762 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 194 flow [2022-12-06 05:36:41,762 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=194, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2022-12-06 05:36:41,763 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 13 predicate places. [2022-12-06 05:36:41,763 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:41,763 INFO L89 Accepts]: Start accepts. Operand has 42 places, 38 transitions, 194 flow [2022-12-06 05:36:41,764 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:41,764 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:41,764 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 38 transitions, 194 flow [2022-12-06 05:36:41,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 38 transitions, 194 flow [2022-12-06 05:36:41,794 INFO L130 PetriNetUnfolder]: 30/132 cut-off events. [2022-12-06 05:36:41,794 INFO L131 PetriNetUnfolder]: For 129/144 co-relation queries the response was YES. [2022-12-06 05:36:41,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 132 events. 30/132 cut-off events. For 129/144 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 604 event pairs, 10 based on Foata normal form. 2/123 useless extension candidates. Maximal degree in co-relation 337. Up to 47 conditions per place. [2022-12-06 05:36:41,795 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 38 transitions, 194 flow [2022-12-06 05:36:41,795 INFO L188 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-06 05:36:44,456 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [556] $Ultimate##0-->L51-5: Formula: (and (= |v_thread1Thread1of1ForFork2_~x~0#1_19| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_23| 0)) InVars {} OutVars{thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_19|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_23|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 05:36:44,799 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:36:44,800 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3037 [2022-12-06 05:36:44,800 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 193 flow [2022-12-06 05:36:44,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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 05:36:44,800 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:44,800 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:44,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:36:44,801 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 1 more)] === [2022-12-06 05:36:44,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:44,801 INFO L85 PathProgramCache]: Analyzing trace with hash -925002003, now seen corresponding path program 1 times [2022-12-06 05:36:44,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:44,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107298684] [2022-12-06 05:36:44,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:44,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:46,071 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 05:36:46,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:46,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107298684] [2022-12-06 05:36:46,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107298684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:36:46,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:36:46,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:36:46,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385434122] [2022-12-06 05:36:46,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:36:46,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:36:46,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:46,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:36:46,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:36:46,074 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 05:36:46,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 193 flow. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:36:46,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:46,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 05:36:46,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:46,752 INFO L130 PetriNetUnfolder]: 567/978 cut-off events. [2022-12-06 05:36:46,752 INFO L131 PetriNetUnfolder]: For 2234/2234 co-relation queries the response was YES. [2022-12-06 05:36:46,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3689 conditions, 978 events. 567/978 cut-off events. For 2234/2234 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4438 event pairs, 174 based on Foata normal form. 1/964 useless extension candidates. Maximal degree in co-relation 3650. Up to 334 conditions per place. [2022-12-06 05:36:46,757 INFO L137 encePairwiseOnDemand]: 16/28 looper letters, 74 selfloop transitions, 20 changer transitions 12/106 dead transitions. [2022-12-06 05:36:46,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 106 transitions, 717 flow [2022-12-06 05:36:46,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:36:46,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:36:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2022-12-06 05:36:46,759 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 05:36:46,759 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 193 flow. Second operand 7 states and 98 transitions. [2022-12-06 05:36:46,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 106 transitions, 717 flow [2022-12-06 05:36:46,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 106 transitions, 659 flow, removed 29 selfloop flow, removed 3 redundant places. [2022-12-06 05:36:46,765 INFO L231 Difference]: Finished difference. Result has 47 places, 50 transitions, 353 flow [2022-12-06 05:36:46,765 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=353, PETRI_PLACES=47, PETRI_TRANSITIONS=50} [2022-12-06 05:36:46,765 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 18 predicate places. [2022-12-06 05:36:46,765 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:46,766 INFO L89 Accepts]: Start accepts. Operand has 47 places, 50 transitions, 353 flow [2022-12-06 05:36:46,766 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:46,766 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:46,766 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 50 transitions, 353 flow [2022-12-06 05:36:46,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 50 transitions, 353 flow [2022-12-06 05:36:46,784 INFO L130 PetriNetUnfolder]: 62/237 cut-off events. [2022-12-06 05:36:46,785 INFO L131 PetriNetUnfolder]: For 556/593 co-relation queries the response was YES. [2022-12-06 05:36:46,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 237 events. 62/237 cut-off events. For 556/593 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1355 event pairs, 13 based on Foata normal form. 1/218 useless extension candidates. Maximal degree in co-relation 750. Up to 70 conditions per place. [2022-12-06 05:36:46,786 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 50 transitions, 353 flow [2022-12-06 05:36:46,786 INFO L188 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-06 05:36:46,787 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:36:46,788 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 05:36:46,788 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 50 transitions, 353 flow [2022-12-06 05:36:46,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:36:46,788 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:46,788 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:46,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:36:46,788 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 1 more)] === [2022-12-06 05:36:46,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:46,789 INFO L85 PathProgramCache]: Analyzing trace with hash 28389899, now seen corresponding path program 1 times [2022-12-06 05:36:46,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:46,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354070716] [2022-12-06 05:36:46,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:46,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:46,891 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 05:36:46,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:46,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354070716] [2022-12-06 05:36:46,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354070716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:36:46,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:36:46,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:36:46,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205299300] [2022-12-06 05:36:46,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:36:46,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:36:46,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:46,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:36:46,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:36:46,894 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 05:36:46,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 50 transitions, 353 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:36:46,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:46,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 05:36:46,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:46,988 INFO L130 PetriNetUnfolder]: 345/647 cut-off events. [2022-12-06 05:36:46,989 INFO L131 PetriNetUnfolder]: For 3209/3209 co-relation queries the response was YES. [2022-12-06 05:36:46,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2674 conditions, 647 events. 345/647 cut-off events. For 3209/3209 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2881 event pairs, 72 based on Foata normal form. 80/726 useless extension candidates. Maximal degree in co-relation 2638. Up to 287 conditions per place. [2022-12-06 05:36:46,992 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 45 selfloop transitions, 20 changer transitions 2/67 dead transitions. [2022-12-06 05:36:46,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 67 transitions, 553 flow [2022-12-06 05:36:46,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:36:46,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:36:46,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 05:36:46,993 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2022-12-06 05:36:46,993 INFO L175 Difference]: Start difference. First operand has 45 places, 50 transitions, 353 flow. Second operand 4 states and 46 transitions. [2022-12-06 05:36:46,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 67 transitions, 553 flow [2022-12-06 05:36:46,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 67 transitions, 549 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 05:36:47,001 INFO L231 Difference]: Finished difference. Result has 49 places, 49 transitions, 401 flow [2022-12-06 05:36:47,001 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=401, PETRI_PLACES=49, PETRI_TRANSITIONS=49} [2022-12-06 05:36:47,003 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 20 predicate places. [2022-12-06 05:36:47,003 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:47,003 INFO L89 Accepts]: Start accepts. Operand has 49 places, 49 transitions, 401 flow [2022-12-06 05:36:47,004 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:47,004 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:47,004 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 49 transitions, 401 flow [2022-12-06 05:36:47,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 49 transitions, 401 flow [2022-12-06 05:36:47,015 INFO L130 PetriNetUnfolder]: 25/141 cut-off events. [2022-12-06 05:36:47,015 INFO L131 PetriNetUnfolder]: For 441/486 co-relation queries the response was YES. [2022-12-06 05:36:47,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 141 events. 25/141 cut-off events. For 441/486 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 692 event pairs, 0 based on Foata normal form. 2/136 useless extension candidates. Maximal degree in co-relation 388. Up to 31 conditions per place. [2022-12-06 05:36:47,016 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 49 transitions, 401 flow [2022-12-06 05:36:47,016 INFO L188 LiptonReduction]: Number of co-enabled transitions 276 [2022-12-06 05:36:47,017 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:36:47,019 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 05:36:47,019 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 49 transitions, 401 flow [2022-12-06 05:36:47,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:36:47,019 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:47,019 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:47,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:36:47,019 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 1 more)] === [2022-12-06 05:36:47,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:47,020 INFO L85 PathProgramCache]: Analyzing trace with hash 916594246, now seen corresponding path program 1 times [2022-12-06 05:36:47,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:47,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883478880] [2022-12-06 05:36:47,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:47,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:47,068 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 05:36:47,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:47,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883478880] [2022-12-06 05:36:47,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883478880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:36:47,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:36:47,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:36:47,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876250157] [2022-12-06 05:36:47,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:36:47,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:36:47,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:47,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:36:47,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:36:47,071 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 05:36:47,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 49 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:36:47,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:47,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 05:36:47,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:47,153 INFO L130 PetriNetUnfolder]: 279/537 cut-off events. [2022-12-06 05:36:47,153 INFO L131 PetriNetUnfolder]: For 3139/3139 co-relation queries the response was YES. [2022-12-06 05:36:47,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2506 conditions, 537 events. 279/537 cut-off events. For 3139/3139 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2253 event pairs, 153 based on Foata normal form. 30/566 useless extension candidates. Maximal degree in co-relation 2045. Up to 433 conditions per place. [2022-12-06 05:36:47,157 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 57 selfloop transitions, 1 changer transitions 1/59 dead transitions. [2022-12-06 05:36:47,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 569 flow [2022-12-06 05:36:47,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:36:47,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:36:47,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-12-06 05:36:47,159 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2022-12-06 05:36:47,159 INFO L175 Difference]: Start difference. First operand has 47 places, 49 transitions, 401 flow. Second operand 3 states and 42 transitions. [2022-12-06 05:36:47,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 569 flow [2022-12-06 05:36:47,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 518 flow, removed 20 selfloop flow, removed 4 redundant places. [2022-12-06 05:36:47,164 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 330 flow [2022-12-06 05:36:47,164 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2022-12-06 05:36:47,166 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 17 predicate places. [2022-12-06 05:36:47,166 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:47,166 INFO L89 Accepts]: Start accepts. Operand has 46 places, 45 transitions, 330 flow [2022-12-06 05:36:47,167 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:47,168 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:47,168 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 45 transitions, 330 flow [2022-12-06 05:36:47,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 45 transitions, 330 flow [2022-12-06 05:36:47,177 INFO L130 PetriNetUnfolder]: 19/124 cut-off events. [2022-12-06 05:36:47,177 INFO L131 PetriNetUnfolder]: For 359/389 co-relation queries the response was YES. [2022-12-06 05:36:47,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 124 events. 19/124 cut-off events. For 359/389 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 585 event pairs, 0 based on Foata normal form. 2/120 useless extension candidates. Maximal degree in co-relation 269. Up to 24 conditions per place. [2022-12-06 05:36:47,178 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 45 transitions, 330 flow [2022-12-06 05:36:47,178 INFO L188 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-06 05:36:47,191 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [601] L102-4-->L103-3: Formula: (and (= (store |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre16#1_29|)) |v_#memory_int_148|) (= |v_#pthreadsForks_52| (+ |v_#pthreadsForks_53| 1)) (= |v_ULTIMATE.start_main_#t~pre16#1_29| |v_#pthreadsForks_53|)) InVars {#pthreadsForks=|v_#pthreadsForks_53|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_41|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_148|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_29|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_23|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre14#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet15#1] [2022-12-06 05:36:47,305 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [615] $Ultimate##0-->thread1EXIT: Formula: (and (not (= (ite (and (<= 0 v_~end~0_195) (< v_~end~0_195 v_~n~0_121)) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_~x~0#1_41| 0) (= |v_thread1Thread1of1ForFork2_#res#1.offset_17| 0) (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_41| 4294967296) (mod (select (select |v_#memory_int_178| v_~queue~0.base_111) (+ (* v_~end~0_195 4) v_~queue~0.offset_111)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_19|) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_37| 4294967296) (mod v_~A~0_73 4294967296))) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_19| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_19|) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_19| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.base_17| 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= |v_thread1Thread1of1ForFork2_~i~0#1_37| 0)) InVars {~queue~0.offset=v_~queue~0.offset_111, ~A~0=v_~A~0_73, #memory_int=|v_#memory_int_178|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_111, ~n~0=v_~n~0_121} OutVars{~queue~0.offset=v_~queue~0.offset_111, ~A~0=v_~A~0_73, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_41|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_19|, ~queue~0.base=v_~queue~0.base_111, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_19|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_37|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_19|, #memory_int=|v_#memory_int_178|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_17|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_121, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_17|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [601] L102-4-->L103-3: Formula: (and (= (store |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre16#1_29|)) |v_#memory_int_148|) (= |v_#pthreadsForks_52| (+ |v_#pthreadsForks_53| 1)) (= |v_ULTIMATE.start_main_#t~pre16#1_29| |v_#pthreadsForks_53|)) InVars {#pthreadsForks=|v_#pthreadsForks_53|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_41|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_148|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_29|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_23|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre14#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet15#1] [2022-12-06 05:36:47,401 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [601] L102-4-->L103-3: Formula: (and (= (store |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre16#1_29|)) |v_#memory_int_148|) (= |v_#pthreadsForks_52| (+ |v_#pthreadsForks_53| 1)) (= |v_ULTIMATE.start_main_#t~pre16#1_29| |v_#pthreadsForks_53|)) InVars {#pthreadsForks=|v_#pthreadsForks_53|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_41|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_148|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_29|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_23|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre14#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet15#1] [2022-12-06 05:36:47,515 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:36:47,516 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 350 [2022-12-06 05:36:47,516 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 332 flow [2022-12-06 05:36:47,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:36:47,516 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:47,516 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:47,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:36:47,516 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 1 more)] === [2022-12-06 05:36:47,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:47,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1821594130, now seen corresponding path program 1 times [2022-12-06 05:36:47,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:47,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145018500] [2022-12-06 05:36:47,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:47,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:48,410 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 05:36:48,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:48,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145018500] [2022-12-06 05:36:48,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145018500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:36:48,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:36:48,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:36:48,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323499730] [2022-12-06 05:36:48,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:36:48,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:36:48,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:48,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:36:48,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:36:48,412 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 05:36:48,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 332 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:36:48,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:48,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 05:36:48,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:48,694 INFO L130 PetriNetUnfolder]: 252/466 cut-off events. [2022-12-06 05:36:48,694 INFO L131 PetriNetUnfolder]: For 1652/1652 co-relation queries the response was YES. [2022-12-06 05:36:48,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1938 conditions, 466 events. 252/466 cut-off events. For 1652/1652 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1803 event pairs, 93 based on Foata normal form. 1/466 useless extension candidates. Maximal degree in co-relation 1680. Up to 349 conditions per place. [2022-12-06 05:36:48,697 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 45 selfloop transitions, 11 changer transitions 23/79 dead transitions. [2022-12-06 05:36:48,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 79 transitions, 604 flow [2022-12-06 05:36:48,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:36:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:36:48,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-12-06 05:36:48,698 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33163265306122447 [2022-12-06 05:36:48,699 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 332 flow. Second operand 7 states and 65 transitions. [2022-12-06 05:36:48,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 79 transitions, 604 flow [2022-12-06 05:36:48,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 79 transitions, 581 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-06 05:36:48,702 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 349 flow [2022-12-06 05:36:48,703 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=349, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2022-12-06 05:36:48,703 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 24 predicate places. [2022-12-06 05:36:48,703 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:48,703 INFO L89 Accepts]: Start accepts. Operand has 53 places, 45 transitions, 349 flow [2022-12-06 05:36:48,705 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:48,705 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:48,705 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 45 transitions, 349 flow [2022-12-06 05:36:48,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 45 transitions, 349 flow [2022-12-06 05:36:48,714 INFO L130 PetriNetUnfolder]: 18/103 cut-off events. [2022-12-06 05:36:48,714 INFO L131 PetriNetUnfolder]: For 298/313 co-relation queries the response was YES. [2022-12-06 05:36:48,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 103 events. 18/103 cut-off events. For 298/313 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 428 event pairs, 0 based on Foata normal form. 2/102 useless extension candidates. Maximal degree in co-relation 311. Up to 19 conditions per place. [2022-12-06 05:36:48,715 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 45 transitions, 349 flow [2022-12-06 05:36:48,715 INFO L188 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-06 05:36:48,717 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:36:48,943 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [613] $Ultimate##0-->thread2EXIT: Formula: (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_23| 0)) (= |v_thread1Thread1of1ForFork2_~x~0#1_35| 0) (not (= (ite (and (<= 0 v_~end~0_191) (< v_~end~0_191 v_~n~0_119)) 1 0) 0)) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_39| 4294967296) (mod v_~A~0_69 4294967296))) (= |v_thread2Thread1of1ForFork0_#res#1.base_13| 0) (= (ite (= (mod (select (select |v_#memory_int_176| v_~queue~0.base_109) (+ (* v_~end~0_191 4) v_~queue~0.offset_109)) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_37| 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|) (= |v_thread1Thread1of1ForFork2_~i~0#1_31| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_13| 0) (= v_~end~0_190 (+ v_~end~0_191 1))) InVars {~queue~0.offset=v_~queue~0.offset_109, ~A~0=v_~A~0_69, #memory_int=|v_#memory_int_176|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_39|, ~end~0=v_~end~0_191, ~queue~0.base=v_~queue~0.base_109, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_37|, ~n~0=v_~n~0_119} OutVars{~queue~0.offset=v_~queue~0.offset_109, ~A~0=v_~A~0_69, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_35|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_13|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_39|, ~queue~0.base=v_~queue~0.base_109, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_13|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_31|, #memory_int=|v_#memory_int_176|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_23|, ~end~0=v_~end~0_190, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_37|, ~n~0=v_~n~0_119, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [600] L51-5-->L51-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_28| 1) |v_thread1Thread1of1ForFork2_~i~0#1_27|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_28| 4294967296) (mod v_~A~0_57 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_31| (+ |v_thread1Thread1of1ForFork2_~x~0#1_32| v_~B~0_47))) InVars {~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_32|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_28|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_31|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] [2022-12-06 05:36:49,030 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [619] $Ultimate##0-->L103-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre16#1_55| |v_#pthreadsForks_89|) (= |v_thread1Thread1of1ForFork2_#res#1.offset_33| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_35| 0)) (= (store |v_#memory_int_212| |v_ULTIMATE.start_main_~#t2~0#1.base_45| (store (select |v_#memory_int_212| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) |v_ULTIMATE.start_main_~#t2~0#1.offset_43| |v_ULTIMATE.start_main_#t~pre16#1_55|)) |v_#memory_int_211|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_35|) (= v_~end~0_234 (+ v_~end~0_235 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_35| (ite (= (mod (select (select |v_#memory_int_212| v_~queue~0.base_132) (+ (* v_~end~0_235 4) v_~queue~0.offset_132)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_58| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_235) (< v_~end~0_235 v_~n~0_142)) 1 0) 0)) (= |v_#pthreadsForks_88| (+ |v_#pthreadsForks_89| 1)) (= |v_thread1Thread1of1ForFork2_#res#1.base_33| 0) (= |v_thread1Thread1of1ForFork2_~x~0#1_58| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_53| 0) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_53| 4294967296) (mod v_~A~0_93 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_132, ~A~0=v_~A~0_93, #pthreadsForks=|v_#pthreadsForks_89|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #memory_int=|v_#memory_int_212|, ~end~0=v_~end~0_235, ~queue~0.base=v_~queue~0.base_132, ~n~0=v_~n~0_142, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|} OutVars{~queue~0.offset=v_~queue~0.offset_132, ~A~0=v_~A~0_93, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_58|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_35|, ~queue~0.base=v_~queue~0.base_132, #pthreadsForks=|v_#pthreadsForks_88|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_57|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_35|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_53|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_35|, #memory_int=|v_#memory_int_211|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_55|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_33|, ~end~0=v_~end~0_234, ~n~0=v_~n~0_142, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_33|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_37|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_35|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_#t~mem2#1, #pthreadsForks, ULTIMATE.start_main_#t~pre14#1, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, ULTIMATE.start_main_#t~nondet15#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [600] L51-5-->L51-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_28| 1) |v_thread1Thread1of1ForFork2_~i~0#1_27|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_28| 4294967296) (mod v_~A~0_57 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_31| (+ |v_thread1Thread1of1ForFork2_~x~0#1_32| v_~B~0_47))) InVars {~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_32|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_28|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_31|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] [2022-12-06 05:36:49,053 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [613] $Ultimate##0-->thread2EXIT: Formula: (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_23| 0)) (= |v_thread1Thread1of1ForFork2_~x~0#1_35| 0) (not (= (ite (and (<= 0 v_~end~0_191) (< v_~end~0_191 v_~n~0_119)) 1 0) 0)) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_39| 4294967296) (mod v_~A~0_69 4294967296))) (= |v_thread2Thread1of1ForFork0_#res#1.base_13| 0) (= (ite (= (mod (select (select |v_#memory_int_176| v_~queue~0.base_109) (+ (* v_~end~0_191 4) v_~queue~0.offset_109)) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_37| 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|) (= |v_thread1Thread1of1ForFork2_~i~0#1_31| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_13| 0) (= v_~end~0_190 (+ v_~end~0_191 1))) InVars {~queue~0.offset=v_~queue~0.offset_109, ~A~0=v_~A~0_69, #memory_int=|v_#memory_int_176|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_39|, ~end~0=v_~end~0_191, ~queue~0.base=v_~queue~0.base_109, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_37|, ~n~0=v_~n~0_119} OutVars{~queue~0.offset=v_~queue~0.offset_109, ~A~0=v_~A~0_69, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_35|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_13|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_39|, ~queue~0.base=v_~queue~0.base_109, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_13|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_31|, #memory_int=|v_#memory_int_176|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_23|, ~end~0=v_~end~0_190, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_37|, ~n~0=v_~n~0_119, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [600] L51-5-->L51-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_28| 1) |v_thread1Thread1of1ForFork2_~i~0#1_27|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_28| 4294967296) (mod v_~A~0_57 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_31| (+ |v_thread1Thread1of1ForFork2_~x~0#1_32| v_~B~0_47))) InVars {~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_32|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_28|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_31|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] [2022-12-06 05:36:49,435 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 05:36:49,633 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:36:49,634 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 931 [2022-12-06 05:36:49,634 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 392 flow [2022-12-06 05:36:49,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:36:49,634 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:49,634 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:49,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:36:49,634 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 1 more)] === [2022-12-06 05:36:49,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:49,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1281087246, now seen corresponding path program 1 times [2022-12-06 05:36:49,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:49,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601572295] [2022-12-06 05:36:49,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:49,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:50,225 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 05:36:50,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:50,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601572295] [2022-12-06 05:36:50,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601572295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:36:50,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:36:50,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:36:50,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597516140] [2022-12-06 05:36:50,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:36:50,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:36:50,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:50,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:36:50,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:36:50,226 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:36:50,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 392 flow. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:36:50,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:50,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:36:50,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:50,553 INFO L130 PetriNetUnfolder]: 242/440 cut-off events. [2022-12-06 05:36:50,553 INFO L131 PetriNetUnfolder]: For 1843/1843 co-relation queries the response was YES. [2022-12-06 05:36:50,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1917 conditions, 440 events. 242/440 cut-off events. For 1843/1843 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1611 event pairs, 117 based on Foata normal form. 1/440 useless extension candidates. Maximal degree in co-relation 1890. Up to 214 conditions per place. [2022-12-06 05:36:50,555 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 59 selfloop transitions, 4 changer transitions 18/81 dead transitions. [2022-12-06 05:36:50,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 81 transitions, 660 flow [2022-12-06 05:36:50,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:36:50,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:36:50,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-12-06 05:36:50,557 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2022-12-06 05:36:50,557 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 392 flow. Second operand 6 states and 72 transitions. [2022-12-06 05:36:50,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 81 transitions, 660 flow [2022-12-06 05:36:50,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 81 transitions, 588 flow, removed 22 selfloop flow, removed 6 redundant places. [2022-12-06 05:36:50,561 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 270 flow [2022-12-06 05:36:50,561 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=270, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2022-12-06 05:36:50,562 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 25 predicate places. [2022-12-06 05:36:50,562 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:50,562 INFO L89 Accepts]: Start accepts. Operand has 54 places, 40 transitions, 270 flow [2022-12-06 05:36:50,563 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:50,563 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:50,563 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 40 transitions, 270 flow [2022-12-06 05:36:50,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 40 transitions, 270 flow [2022-12-06 05:36:50,570 INFO L130 PetriNetUnfolder]: 18/82 cut-off events. [2022-12-06 05:36:50,570 INFO L131 PetriNetUnfolder]: For 144/155 co-relation queries the response was YES. [2022-12-06 05:36:50,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 82 events. 18/82 cut-off events. For 144/155 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 274 event pairs, 0 based on Foata normal form. 2/81 useless extension candidates. Maximal degree in co-relation 221. Up to 17 conditions per place. [2022-12-06 05:36:50,570 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 40 transitions, 270 flow [2022-12-06 05:36:50,570 INFO L188 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-06 05:36:50,571 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:36:50,572 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 05:36:50,572 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 270 flow [2022-12-06 05:36:50,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:36:50,573 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:50,573 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:50,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:36:50,573 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 1 more)] === [2022-12-06 05:36:50,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:50,573 INFO L85 PathProgramCache]: Analyzing trace with hash -507445429, now seen corresponding path program 1 times [2022-12-06 05:36:50,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:50,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077862170] [2022-12-06 05:36:50,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:50,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:50,634 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 05:36:50,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:50,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077862170] [2022-12-06 05:36:50,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077862170] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:36:50,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:36:50,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:36:50,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321570987] [2022-12-06 05:36:50,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:36:50,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:36:50,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:50,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:36:50,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:36:50,635 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 05:36:50,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:36:50,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:50,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 05:36:50,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:50,708 INFO L130 PetriNetUnfolder]: 279/510 cut-off events. [2022-12-06 05:36:50,708 INFO L131 PetriNetUnfolder]: For 1495/1495 co-relation queries the response was YES. [2022-12-06 05:36:50,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1981 conditions, 510 events. 279/510 cut-off events. For 1495/1495 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1973 event pairs, 108 based on Foata normal form. 4/513 useless extension candidates. Maximal degree in co-relation 1946. Up to 329 conditions per place. [2022-12-06 05:36:50,710 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 56 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2022-12-06 05:36:50,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 496 flow [2022-12-06 05:36:50,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:36:50,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:36:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-06 05:36:50,711 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 05:36:50,711 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 270 flow. Second operand 3 states and 44 transitions. [2022-12-06 05:36:50,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 496 flow [2022-12-06 05:36:50,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 473 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-12-06 05:36:50,714 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 267 flow [2022-12-06 05:36:50,714 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=267, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2022-12-06 05:36:50,715 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 14 predicate places. [2022-12-06 05:36:50,715 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:50,715 INFO L89 Accepts]: Start accepts. Operand has 43 places, 41 transitions, 267 flow [2022-12-06 05:36:50,715 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:50,716 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:50,716 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 41 transitions, 267 flow [2022-12-06 05:36:50,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 41 transitions, 267 flow [2022-12-06 05:36:50,724 INFO L130 PetriNetUnfolder]: 19/104 cut-off events. [2022-12-06 05:36:50,724 INFO L131 PetriNetUnfolder]: For 153/163 co-relation queries the response was YES. [2022-12-06 05:36:50,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 104 events. 19/104 cut-off events. For 153/163 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 428 event pairs, 0 based on Foata normal form. 2/102 useless extension candidates. Maximal degree in co-relation 133. Up to 23 conditions per place. [2022-12-06 05:36:50,725 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 41 transitions, 267 flow [2022-12-06 05:36:50,725 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-06 05:36:50,725 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:36:50,727 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 05:36:50,727 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 267 flow [2022-12-06 05:36:50,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:36:50,727 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:50,727 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:50,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:36:50,727 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 1 more)] === [2022-12-06 05:36:50,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:50,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1560257784, now seen corresponding path program 1 times [2022-12-06 05:36:50,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:50,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641409887] [2022-12-06 05:36:50,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:50,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:50,780 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 05:36:50,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:50,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641409887] [2022-12-06 05:36:50,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641409887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:36:50,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:36:50,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:36:50,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969600862] [2022-12-06 05:36:50,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:36:50,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:36:50,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:50,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:36:50,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:36:50,782 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 05:36:50,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 267 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:36:50,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:50,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 05:36:50,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:50,917 INFO L130 PetriNetUnfolder]: 368/663 cut-off events. [2022-12-06 05:36:50,917 INFO L131 PetriNetUnfolder]: For 1700/1700 co-relation queries the response was YES. [2022-12-06 05:36:50,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2618 conditions, 663 events. 368/663 cut-off events. For 1700/1700 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2745 event pairs, 86 based on Foata normal form. 20/682 useless extension candidates. Maximal degree in co-relation 1155. Up to 477 conditions per place. [2022-12-06 05:36:50,921 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 66 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2022-12-06 05:36:50,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 74 transitions, 584 flow [2022-12-06 05:36:50,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:36:50,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:36:50,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 05:36:50,922 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2022-12-06 05:36:50,922 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 267 flow. Second operand 4 states and 56 transitions. [2022-12-06 05:36:50,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 74 transitions, 584 flow [2022-12-06 05:36:50,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 74 transitions, 574 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:36:50,924 INFO L231 Difference]: Finished difference. Result has 48 places, 49 transitions, 367 flow [2022-12-06 05:36:50,925 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=367, PETRI_PLACES=48, PETRI_TRANSITIONS=49} [2022-12-06 05:36:50,925 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 19 predicate places. [2022-12-06 05:36:50,925 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:50,925 INFO L89 Accepts]: Start accepts. Operand has 48 places, 49 transitions, 367 flow [2022-12-06 05:36:50,928 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:50,928 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:50,928 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 49 transitions, 367 flow [2022-12-06 05:36:50,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 49 transitions, 367 flow [2022-12-06 05:36:50,942 INFO L130 PetriNetUnfolder]: 31/138 cut-off events. [2022-12-06 05:36:50,942 INFO L131 PetriNetUnfolder]: For 259/266 co-relation queries the response was YES. [2022-12-06 05:36:50,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 138 events. 31/138 cut-off events. For 259/266 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 623 event pairs, 1 based on Foata normal form. 3/136 useless extension candidates. Maximal degree in co-relation 192. Up to 35 conditions per place. [2022-12-06 05:36:50,943 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 49 transitions, 367 flow [2022-12-06 05:36:50,943 INFO L188 LiptonReduction]: Number of co-enabled transitions 312 [2022-12-06 05:36:50,944 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:36:50,944 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 05:36:50,944 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 49 transitions, 367 flow [2022-12-06 05:36:50,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:36:50,944 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:50,944 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:50,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:36:50,945 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 1 more)] === [2022-12-06 05:36:50,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:50,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1839844062, now seen corresponding path program 2 times [2022-12-06 05:36:50,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:50,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951454284] [2022-12-06 05:36:50,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:50,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:50,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:36:50,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:50,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951454284] [2022-12-06 05:36:50,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951454284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:36:50,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:36:50,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:36:50,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138049060] [2022-12-06 05:36:50,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:36:50,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:36:50,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:50,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:36:50,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:36:50,999 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 05:36:50,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 49 transitions, 367 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:36:50,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:50,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 05:36:50,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:51,110 INFO L130 PetriNetUnfolder]: 372/655 cut-off events. [2022-12-06 05:36:51,110 INFO L131 PetriNetUnfolder]: For 2431/2431 co-relation queries the response was YES. [2022-12-06 05:36:51,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2834 conditions, 655 events. 372/655 cut-off events. For 2431/2431 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2599 event pairs, 112 based on Foata normal form. 20/674 useless extension candidates. Maximal degree in co-relation 1355. Up to 403 conditions per place. [2022-12-06 05:36:51,114 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 67 selfloop transitions, 15 changer transitions 0/82 dead transitions. [2022-12-06 05:36:51,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 82 transitions, 700 flow [2022-12-06 05:36:51,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:36:51,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:36:51,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-06 05:36:51,115 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2022-12-06 05:36:51,115 INFO L175 Difference]: Start difference. First operand has 48 places, 49 transitions, 367 flow. Second operand 4 states and 57 transitions. [2022-12-06 05:36:51,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 82 transitions, 700 flow [2022-12-06 05:36:51,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 82 transitions, 692 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-06 05:36:51,120 INFO L231 Difference]: Finished difference. Result has 53 places, 53 transitions, 450 flow [2022-12-06 05:36:51,120 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=450, PETRI_PLACES=53, PETRI_TRANSITIONS=53} [2022-12-06 05:36:51,121 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 24 predicate places. [2022-12-06 05:36:51,121 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:51,121 INFO L89 Accepts]: Start accepts. Operand has 53 places, 53 transitions, 450 flow [2022-12-06 05:36:51,121 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:51,121 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:51,121 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 53 transitions, 450 flow [2022-12-06 05:36:51,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 53 transitions, 450 flow [2022-12-06 05:36:51,132 INFO L130 PetriNetUnfolder]: 34/140 cut-off events. [2022-12-06 05:36:51,132 INFO L131 PetriNetUnfolder]: For 376/385 co-relation queries the response was YES. [2022-12-06 05:36:51,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 140 events. 34/140 cut-off events. For 376/385 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 613 event pairs, 1 based on Foata normal form. 3/139 useless extension candidates. Maximal degree in co-relation 255. Up to 35 conditions per place. [2022-12-06 05:36:51,133 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 53 transitions, 450 flow [2022-12-06 05:36:51,133 INFO L188 LiptonReduction]: Number of co-enabled transitions 342 [2022-12-06 05:36:51,133 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:36:51,134 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 05:36:51,134 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 53 transitions, 450 flow [2022-12-06 05:36:51,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:36:51,134 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:51,134 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 05:36:51,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:36:51,134 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 1 more)] === [2022-12-06 05:36:51,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:51,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2011828472, now seen corresponding path program 1 times [2022-12-06 05:36:51,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:51,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405550716] [2022-12-06 05:36:51,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:51,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:51,833 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 05:36:51,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:51,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405550716] [2022-12-06 05:36:51,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405550716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:36:51,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:36:51,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:36:51,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311207990] [2022-12-06 05:36:51,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:36:51,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:36:51,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:51,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:36:51,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:36:51,835 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 05:36:51,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 450 flow. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 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 05:36:51,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:51,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 05:36:51,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:52,226 INFO L130 PetriNetUnfolder]: 451/795 cut-off events. [2022-12-06 05:36:52,226 INFO L131 PetriNetUnfolder]: For 4066/4066 co-relation queries the response was YES. [2022-12-06 05:36:52,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3816 conditions, 795 events. 451/795 cut-off events. For 4066/4066 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3387 event pairs, 157 based on Foata normal form. 1/795 useless extension candidates. Maximal degree in co-relation 2288. Up to 560 conditions per place. [2022-12-06 05:36:52,231 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 76 selfloop transitions, 22 changer transitions 13/111 dead transitions. [2022-12-06 05:36:52,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 111 transitions, 1035 flow [2022-12-06 05:36:52,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:36:52,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:36:52,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-12-06 05:36:52,232 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2022-12-06 05:36:52,232 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 450 flow. Second operand 8 states and 80 transitions. [2022-12-06 05:36:52,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 111 transitions, 1035 flow [2022-12-06 05:36:52,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 111 transitions, 993 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 05:36:52,238 INFO L231 Difference]: Finished difference. Result has 64 places, 68 transitions, 667 flow [2022-12-06 05:36:52,239 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=667, PETRI_PLACES=64, PETRI_TRANSITIONS=68} [2022-12-06 05:36:52,239 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2022-12-06 05:36:52,240 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:52,240 INFO L89 Accepts]: Start accepts. Operand has 64 places, 68 transitions, 667 flow [2022-12-06 05:36:52,241 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:52,241 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:52,241 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 68 transitions, 667 flow [2022-12-06 05:36:52,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 68 transitions, 667 flow [2022-12-06 05:36:52,262 INFO L130 PetriNetUnfolder]: 96/273 cut-off events. [2022-12-06 05:36:52,262 INFO L131 PetriNetUnfolder]: For 968/986 co-relation queries the response was YES. [2022-12-06 05:36:52,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 273 events. 96/273 cut-off events. For 968/986 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1399 event pairs, 6 based on Foata normal form. 4/253 useless extension candidates. Maximal degree in co-relation 1122. Up to 74 conditions per place. [2022-12-06 05:36:52,264 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 68 transitions, 667 flow [2022-12-06 05:36:52,264 INFO L188 LiptonReduction]: Number of co-enabled transitions 408 [2022-12-06 05:36:52,266 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:36:52,378 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:36:52,378 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-06 05:36:52,379 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 67 transitions, 665 flow [2022-12-06 05:36:52,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 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 05:36:52,379 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:52,379 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 05:36:52,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 05:36:52,379 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 1 more)] === [2022-12-06 05:36:52,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:52,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1059145440, now seen corresponding path program 2 times [2022-12-06 05:36:52,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:52,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885836478] [2022-12-06 05:36:52,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:52,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:53,256 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 05:36:53,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:53,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885836478] [2022-12-06 05:36:53,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885836478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:36:53,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:36:53,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 05:36:53,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939307507] [2022-12-06 05:36:53,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:36:53,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:36:53,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:53,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:36:53,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:36:53,257 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 05:36:53,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 67 transitions, 665 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:36:53,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:53,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 05:36:53,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:53,708 INFO L130 PetriNetUnfolder]: 470/831 cut-off events. [2022-12-06 05:36:53,708 INFO L131 PetriNetUnfolder]: For 4896/4896 co-relation queries the response was YES. [2022-12-06 05:36:53,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4344 conditions, 831 events. 470/831 cut-off events. For 4896/4896 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3643 event pairs, 172 based on Foata normal form. 1/831 useless extension candidates. Maximal degree in co-relation 4306. Up to 523 conditions per place. [2022-12-06 05:36:53,713 INFO L137 encePairwiseOnDemand]: 16/27 looper letters, 73 selfloop transitions, 22 changer transitions 15/110 dead transitions. [2022-12-06 05:36:53,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 110 transitions, 1125 flow [2022-12-06 05:36:53,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:36:53,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:36:53,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-12-06 05:36:53,714 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2022-12-06 05:36:53,714 INFO L175 Difference]: Start difference. First operand has 62 places, 67 transitions, 665 flow. Second operand 8 states and 80 transitions. [2022-12-06 05:36:53,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 110 transitions, 1125 flow [2022-12-06 05:36:53,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 110 transitions, 1077 flow, removed 19 selfloop flow, removed 3 redundant places. [2022-12-06 05:36:53,721 INFO L231 Difference]: Finished difference. Result has 69 places, 68 transitions, 704 flow [2022-12-06 05:36:53,721 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=704, PETRI_PLACES=69, PETRI_TRANSITIONS=68} [2022-12-06 05:36:53,721 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 40 predicate places. [2022-12-06 05:36:53,721 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:53,721 INFO L89 Accepts]: Start accepts. Operand has 69 places, 68 transitions, 704 flow [2022-12-06 05:36:53,722 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:53,722 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:53,722 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 68 transitions, 704 flow [2022-12-06 05:36:53,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 68 transitions, 704 flow [2022-12-06 05:36:53,741 INFO L130 PetriNetUnfolder]: 94/277 cut-off events. [2022-12-06 05:36:53,741 INFO L131 PetriNetUnfolder]: For 1352/1373 co-relation queries the response was YES. [2022-12-06 05:36:53,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1208 conditions, 277 events. 94/277 cut-off events. For 1352/1373 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1441 event pairs, 8 based on Foata normal form. 6/259 useless extension candidates. Maximal degree in co-relation 1175. Up to 70 conditions per place. [2022-12-06 05:36:53,743 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 68 transitions, 704 flow [2022-12-06 05:36:53,743 INFO L188 LiptonReduction]: Number of co-enabled transitions 416 [2022-12-06 05:36:53,743 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:36:53,744 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 05:36:53,744 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 704 flow [2022-12-06 05:36:53,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:36:53,744 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:53,744 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 05:36:53,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 05:36:53,744 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 1 more)] === [2022-12-06 05:36:53,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:53,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1537088064, now seen corresponding path program 1 times [2022-12-06 05:36:53,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:53,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990488278] [2022-12-06 05:36:53,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:53,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:55,972 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 05:36:55,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:55,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990488278] [2022-12-06 05:36:55,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990488278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:36:55,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:36:55,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 05:36:55,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359855763] [2022-12-06 05:36:55,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:36:55,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:36:55,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:55,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:36:55,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:36:55,973 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 05:36:55,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 704 flow. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 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 05:36:55,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:55,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 05:36:55,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:56,996 INFO L130 PetriNetUnfolder]: 644/1084 cut-off events. [2022-12-06 05:36:56,997 INFO L131 PetriNetUnfolder]: For 7105/7105 co-relation queries the response was YES. [2022-12-06 05:36:56,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5684 conditions, 1084 events. 644/1084 cut-off events. For 7105/7105 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4800 event pairs, 151 based on Foata normal form. 1/1083 useless extension candidates. Maximal degree in co-relation 5645. Up to 746 conditions per place. [2022-12-06 05:36:57,003 INFO L137 encePairwiseOnDemand]: 11/26 looper letters, 104 selfloop transitions, 25 changer transitions 13/142 dead transitions. [2022-12-06 05:36:57,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 142 transitions, 1426 flow [2022-12-06 05:36:57,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:36:57,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:36:57,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2022-12-06 05:36:57,004 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3576923076923077 [2022-12-06 05:36:57,005 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 704 flow. Second operand 10 states and 93 transitions. [2022-12-06 05:36:57,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 142 transitions, 1426 flow [2022-12-06 05:36:57,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 142 transitions, 1381 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-06 05:36:57,012 INFO L231 Difference]: Finished difference. Result has 77 places, 84 transitions, 903 flow [2022-12-06 05:36:57,012 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=903, PETRI_PLACES=77, PETRI_TRANSITIONS=84} [2022-12-06 05:36:57,013 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 48 predicate places. [2022-12-06 05:36:57,013 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:57,013 INFO L89 Accepts]: Start accepts. Operand has 77 places, 84 transitions, 903 flow [2022-12-06 05:36:57,013 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:57,013 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:57,014 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 84 transitions, 903 flow [2022-12-06 05:36:57,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 84 transitions, 903 flow [2022-12-06 05:36:57,040 INFO L130 PetriNetUnfolder]: 130/361 cut-off events. [2022-12-06 05:36:57,041 INFO L131 PetriNetUnfolder]: For 1972/2006 co-relation queries the response was YES. [2022-12-06 05:36:57,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1698 conditions, 361 events. 130/361 cut-off events. For 1972/2006 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2012 event pairs, 9 based on Foata normal form. 8/338 useless extension candidates. Maximal degree in co-relation 1660. Up to 94 conditions per place. [2022-12-06 05:36:57,044 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 84 transitions, 903 flow [2022-12-06 05:36:57,044 INFO L188 LiptonReduction]: Number of co-enabled transitions 536 [2022-12-06 05:36:57,046 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:36:57,308 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [556] $Ultimate##0-->L51-5: Formula: (and (= |v_thread1Thread1of1ForFork2_~x~0#1_19| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_23| 0)) InVars {} OutVars{thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_19|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_23|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 05:37:00,433 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:37:00,434 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3421 [2022-12-06 05:37:00,434 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 83 transitions, 933 flow [2022-12-06 05:37:00,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 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 05:37:00,434 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:00,435 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:00,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 05:37:00,435 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 1 more)] === [2022-12-06 05:37:00,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:00,435 INFO L85 PathProgramCache]: Analyzing trace with hash 599754994, now seen corresponding path program 1 times [2022-12-06 05:37:00,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:00,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443871914] [2022-12-06 05:37:00,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:00,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:03,169 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 05:37:03,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:03,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443871914] [2022-12-06 05:37:03,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443871914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:03,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:03,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:37:03,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845144632] [2022-12-06 05:37:03,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:03,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:37:03,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:03,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:37:03,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:37:03,171 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:37:03,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 83 transitions, 933 flow. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:03,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:03,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:37:03,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:03,971 INFO L130 PetriNetUnfolder]: 665/1122 cut-off events. [2022-12-06 05:37:03,971 INFO L131 PetriNetUnfolder]: For 9232/9232 co-relation queries the response was YES. [2022-12-06 05:37:03,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6429 conditions, 1122 events. 665/1122 cut-off events. For 9232/9232 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5086 event pairs, 147 based on Foata normal form. 1/1121 useless extension candidates. Maximal degree in co-relation 6385. Up to 810 conditions per place. [2022-12-06 05:37:03,979 INFO L137 encePairwiseOnDemand]: 23/35 looper letters, 81 selfloop transitions, 34 changer transitions 17/132 dead transitions. [2022-12-06 05:37:03,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 132 transitions, 1548 flow [2022-12-06 05:37:03,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:37:03,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:37:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2022-12-06 05:37:03,980 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33877551020408164 [2022-12-06 05:37:03,980 INFO L175 Difference]: Start difference. First operand has 75 places, 83 transitions, 933 flow. Second operand 7 states and 83 transitions. [2022-12-06 05:37:03,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 132 transitions, 1548 flow [2022-12-06 05:37:03,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 132 transitions, 1434 flow, removed 53 selfloop flow, removed 3 redundant places. [2022-12-06 05:37:03,997 INFO L231 Difference]: Finished difference. Result has 83 places, 95 transitions, 1118 flow [2022-12-06 05:37:03,997 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1118, PETRI_PLACES=83, PETRI_TRANSITIONS=95} [2022-12-06 05:37:03,997 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 54 predicate places. [2022-12-06 05:37:03,998 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:03,998 INFO L89 Accepts]: Start accepts. Operand has 83 places, 95 transitions, 1118 flow [2022-12-06 05:37:04,001 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:04,001 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:04,001 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 95 transitions, 1118 flow [2022-12-06 05:37:04,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 95 transitions, 1118 flow [2022-12-06 05:37:04,032 INFO L130 PetriNetUnfolder]: 161/414 cut-off events. [2022-12-06 05:37:04,032 INFO L131 PetriNetUnfolder]: For 2316/2353 co-relation queries the response was YES. [2022-12-06 05:37:04,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2110 conditions, 414 events. 161/414 cut-off events. For 2316/2353 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2313 event pairs, 10 based on Foata normal form. 8/384 useless extension candidates. Maximal degree in co-relation 2068. Up to 100 conditions per place. [2022-12-06 05:37:04,036 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 95 transitions, 1118 flow [2022-12-06 05:37:04,036 INFO L188 LiptonReduction]: Number of co-enabled transitions 570 [2022-12-06 05:37:04,037 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:37:04,139 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:04,140 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-06 05:37:04,140 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 94 transitions, 1116 flow [2022-12-06 05:37:04,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:04,141 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:04,141 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:04,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 05:37:04,141 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 1 more)] === [2022-12-06 05:37:04,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:04,142 INFO L85 PathProgramCache]: Analyzing trace with hash -2043715631, now seen corresponding path program 1 times [2022-12-06 05:37:04,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:04,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531023819] [2022-12-06 05:37:04,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:04,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:05,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:05,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:05,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531023819] [2022-12-06 05:37:05,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531023819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:05,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:05,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:37:05,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229528371] [2022-12-06 05:37:05,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:05,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:37:05,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:05,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:37:05,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:37:05,418 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:37:05,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 94 transitions, 1116 flow. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:05,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:05,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:37:05,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:05,803 INFO L130 PetriNetUnfolder]: 632/1067 cut-off events. [2022-12-06 05:37:05,803 INFO L131 PetriNetUnfolder]: For 9199/9199 co-relation queries the response was YES. [2022-12-06 05:37:05,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6455 conditions, 1067 events. 632/1067 cut-off events. For 9199/9199 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4759 event pairs, 156 based on Foata normal form. 1/1067 useless extension candidates. Maximal degree in co-relation 6407. Up to 774 conditions per place. [2022-12-06 05:37:05,815 INFO L137 encePairwiseOnDemand]: 23/35 looper letters, 91 selfloop transitions, 20 changer transitions 14/125 dead transitions. [2022-12-06 05:37:05,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 125 transitions, 1522 flow [2022-12-06 05:37:05,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:37:05,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:37:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-12-06 05:37:05,817 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32857142857142857 [2022-12-06 05:37:05,817 INFO L175 Difference]: Start difference. First operand has 78 places, 94 transitions, 1116 flow. Second operand 6 states and 69 transitions. [2022-12-06 05:37:05,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 125 transitions, 1522 flow [2022-12-06 05:37:05,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 125 transitions, 1474 flow, removed 24 selfloop flow, removed 5 redundant places. [2022-12-06 05:37:05,827 INFO L231 Difference]: Finished difference. Result has 80 places, 93 transitions, 1106 flow [2022-12-06 05:37:05,828 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1078, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1106, PETRI_PLACES=80, PETRI_TRANSITIONS=93} [2022-12-06 05:37:05,829 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 51 predicate places. [2022-12-06 05:37:05,829 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:05,829 INFO L89 Accepts]: Start accepts. Operand has 80 places, 93 transitions, 1106 flow [2022-12-06 05:37:05,829 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:05,829 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:05,829 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 93 transitions, 1106 flow [2022-12-06 05:37:05,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 93 transitions, 1106 flow [2022-12-06 05:37:05,857 INFO L130 PetriNetUnfolder]: 159/408 cut-off events. [2022-12-06 05:37:05,857 INFO L131 PetriNetUnfolder]: For 2441/2483 co-relation queries the response was YES. [2022-12-06 05:37:05,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2061 conditions, 408 events. 159/408 cut-off events. For 2441/2483 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2231 event pairs, 11 based on Foata normal form. 8/381 useless extension candidates. Maximal degree in co-relation 2021. Up to 99 conditions per place. [2022-12-06 05:37:05,861 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 93 transitions, 1106 flow [2022-12-06 05:37:05,861 INFO L188 LiptonReduction]: Number of co-enabled transitions 562 [2022-12-06 05:37:05,861 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:05,861 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-06 05:37:05,862 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 93 transitions, 1106 flow [2022-12-06 05:37:05,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:05,862 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:05,862 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:05,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 05:37:05,862 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 1 more)] === [2022-12-06 05:37:05,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:05,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1698656871, now seen corresponding path program 1 times [2022-12-06 05:37:05,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:05,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102966221] [2022-12-06 05:37:05,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:05,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:06,440 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 05:37:06,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:06,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102966221] [2022-12-06 05:37:06,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102966221] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:06,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:06,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:37:06,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125125527] [2022-12-06 05:37:06,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:06,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:37:06,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:06,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:37:06,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:37:06,441 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 05:37:06,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 93 transitions, 1106 flow. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:06,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:06,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 05:37:06,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:06,754 INFO L130 PetriNetUnfolder]: 643/1087 cut-off events. [2022-12-06 05:37:06,754 INFO L131 PetriNetUnfolder]: For 8920/8920 co-relation queries the response was YES. [2022-12-06 05:37:06,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6450 conditions, 1087 events. 643/1087 cut-off events. For 8920/8920 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4921 event pairs, 147 based on Foata normal form. 1/1087 useless extension candidates. Maximal degree in co-relation 6404. Up to 789 conditions per place. [2022-12-06 05:37:06,760 INFO L137 encePairwiseOnDemand]: 22/34 looper letters, 81 selfloop transitions, 33 changer transitions 15/129 dead transitions. [2022-12-06 05:37:06,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 129 transitions, 1558 flow [2022-12-06 05:37:06,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:37:06,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:37:06,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-12-06 05:37:06,761 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3319327731092437 [2022-12-06 05:37:06,761 INFO L175 Difference]: Start difference. First operand has 78 places, 93 transitions, 1106 flow. Second operand 7 states and 79 transitions. [2022-12-06 05:37:06,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 129 transitions, 1558 flow [2022-12-06 05:37:06,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 129 transitions, 1510 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-06 05:37:06,771 INFO L231 Difference]: Finished difference. Result has 82 places, 94 transitions, 1152 flow [2022-12-06 05:37:06,771 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1062, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1152, PETRI_PLACES=82, PETRI_TRANSITIONS=94} [2022-12-06 05:37:06,771 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 53 predicate places. [2022-12-06 05:37:06,771 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:06,772 INFO L89 Accepts]: Start accepts. Operand has 82 places, 94 transitions, 1152 flow [2022-12-06 05:37:06,772 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:06,772 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:06,772 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 94 transitions, 1152 flow [2022-12-06 05:37:06,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 94 transitions, 1152 flow [2022-12-06 05:37:06,800 INFO L130 PetriNetUnfolder]: 158/408 cut-off events. [2022-12-06 05:37:06,800 INFO L131 PetriNetUnfolder]: For 2473/2514 co-relation queries the response was YES. [2022-12-06 05:37:06,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2106 conditions, 408 events. 158/408 cut-off events. For 2473/2514 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2258 event pairs, 12 based on Foata normal form. 9/381 useless extension candidates. Maximal degree in co-relation 2065. Up to 99 conditions per place. [2022-12-06 05:37:06,804 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 94 transitions, 1152 flow [2022-12-06 05:37:06,804 INFO L188 LiptonReduction]: Number of co-enabled transitions 574 [2022-12-06 05:37:06,804 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:06,805 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 05:37:06,805 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 94 transitions, 1152 flow [2022-12-06 05:37:06,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:06,805 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:06,805 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:06,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 05:37:06,805 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 1 more)] === [2022-12-06 05:37:06,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:06,805 INFO L85 PathProgramCache]: Analyzing trace with hash -213775677, now seen corresponding path program 1 times [2022-12-06 05:37:06,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:06,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396522267] [2022-12-06 05:37:06,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:06,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:06,842 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 05:37:06,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:06,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396522267] [2022-12-06 05:37:06,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396522267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:06,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:06,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:37:06,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955765377] [2022-12-06 05:37:06,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:06,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:37:06,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:06,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:37:06,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:37:06,843 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:37:06,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 94 transitions, 1152 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:06,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:06,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:37:06,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:06,983 INFO L130 PetriNetUnfolder]: 628/1103 cut-off events. [2022-12-06 05:37:06,983 INFO L131 PetriNetUnfolder]: For 10156/10156 co-relation queries the response was YES. [2022-12-06 05:37:06,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6554 conditions, 1103 events. 628/1103 cut-off events. For 10156/10156 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5208 event pairs, 261 based on Foata normal form. 29/1131 useless extension candidates. Maximal degree in co-relation 6501. Up to 1000 conditions per place. [2022-12-06 05:37:06,989 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 102 selfloop transitions, 1 changer transitions 2/105 dead transitions. [2022-12-06 05:37:06,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 105 transitions, 1400 flow [2022-12-06 05:37:06,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:37:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:37:06,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-06 05:37:06,990 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2022-12-06 05:37:06,990 INFO L175 Difference]: Start difference. First operand has 80 places, 94 transitions, 1152 flow. Second operand 3 states and 48 transitions. [2022-12-06 05:37:06,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 105 transitions, 1400 flow [2022-12-06 05:37:06,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 105 transitions, 1335 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-06 05:37:07,001 INFO L231 Difference]: Finished difference. Result has 78 places, 90 transitions, 1039 flow [2022-12-06 05:37:07,001 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1039, PETRI_PLACES=78, PETRI_TRANSITIONS=90} [2022-12-06 05:37:07,001 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 49 predicate places. [2022-12-06 05:37:07,001 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:07,001 INFO L89 Accepts]: Start accepts. Operand has 78 places, 90 transitions, 1039 flow [2022-12-06 05:37:07,002 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:07,002 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:07,002 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 90 transitions, 1039 flow [2022-12-06 05:37:07,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 90 transitions, 1039 flow [2022-12-06 05:37:07,030 INFO L130 PetriNetUnfolder]: 148/409 cut-off events. [2022-12-06 05:37:07,030 INFO L131 PetriNetUnfolder]: For 2193/2235 co-relation queries the response was YES. [2022-12-06 05:37:07,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1978 conditions, 409 events. 148/409 cut-off events. For 2193/2235 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2353 event pairs, 13 based on Foata normal form. 10/384 useless extension candidates. Maximal degree in co-relation 1852. Up to 100 conditions per place. [2022-12-06 05:37:07,033 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 90 transitions, 1039 flow [2022-12-06 05:37:07,033 INFO L188 LiptonReduction]: Number of co-enabled transitions 542 [2022-12-06 05:37:07,042 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [633] $Ultimate##0-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_56| 0)) (= |v_thread1Thread1of1ForFork2_~x~0#1_119| 0) (= v_~end~0_373 (+ v_~end~0_374 1)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_54| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_114| 0) (= |v_thread1Thread1of1ForFork2_#res#1.base_54| 0) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_114| 4294967296) (mod v_~A~0_160 4294967296))) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_56| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_56|) (= (ite (= (mod (select (select |v_#memory_int_329| v_~queue~0.base_204) (+ (* v_~end~0_374 4) v_~queue~0.offset_204)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_119| 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_56|) (not (= (ite (and (< v_~end~0_374 v_~n~0_214) (<= 0 v_~end~0_374)) 1 0) 0))) InVars {~queue~0.offset=v_~queue~0.offset_204, ~A~0=v_~A~0_160, #memory_int=|v_#memory_int_329|, ~end~0=v_~end~0_374, ~queue~0.base=v_~queue~0.base_204, ~n~0=v_~n~0_214} OutVars{~queue~0.offset=v_~queue~0.offset_204, ~A~0=v_~A~0_160, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_119|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_56|, ~queue~0.base=v_~queue~0.base_204, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_56|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_114|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_56|, #memory_int=|v_#memory_int_329|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_54|, ~end~0=v_~end~0_373, ~n~0=v_~n~0_214, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_54|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_56|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [601] L102-4-->L103-3: Formula: (and (= (store |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre16#1_29|)) |v_#memory_int_148|) (= |v_#pthreadsForks_52| (+ |v_#pthreadsForks_53| 1)) (= |v_ULTIMATE.start_main_#t~pre16#1_29| |v_#pthreadsForks_53|)) InVars {#pthreadsForks=|v_#pthreadsForks_53|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_41|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_148|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_29|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_23|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre14#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet15#1] [2022-12-06 05:37:07,141 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:07,141 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-06 05:37:07,141 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 90 transitions, 1053 flow [2022-12-06 05:37:07,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:07,142 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:07,142 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:07,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 05:37:07,142 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 1 more)] === [2022-12-06 05:37:07,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:07,142 INFO L85 PathProgramCache]: Analyzing trace with hash -669422823, now seen corresponding path program 1 times [2022-12-06 05:37:07,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:07,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85476548] [2022-12-06 05:37:07,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:07,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:07,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 05:37:07,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:07,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85476548] [2022-12-06 05:37:07,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85476548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:07,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:07,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:37:07,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926645909] [2022-12-06 05:37:07,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:07,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:37:07,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:07,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:37:07,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:37:07,948 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:37:07,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 90 transitions, 1053 flow. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:07,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:07,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:37:07,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:08,403 INFO L130 PetriNetUnfolder]: 640/1133 cut-off events. [2022-12-06 05:37:08,403 INFO L131 PetriNetUnfolder]: For 9007/9007 co-relation queries the response was YES. [2022-12-06 05:37:08,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6567 conditions, 1133 events. 640/1133 cut-off events. For 9007/9007 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5491 event pairs, 183 based on Foata normal form. 1/1133 useless extension candidates. Maximal degree in co-relation 6043. Up to 866 conditions per place. [2022-12-06 05:37:08,409 INFO L137 encePairwiseOnDemand]: 19/33 looper letters, 80 selfloop transitions, 36 changer transitions 13/129 dead transitions. [2022-12-06 05:37:08,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 129 transitions, 1528 flow [2022-12-06 05:37:08,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:37:08,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:37:08,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2022-12-06 05:37:08,411 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33766233766233766 [2022-12-06 05:37:08,411 INFO L175 Difference]: Start difference. First operand has 78 places, 90 transitions, 1053 flow. Second operand 7 states and 78 transitions. [2022-12-06 05:37:08,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 129 transitions, 1528 flow [2022-12-06 05:37:08,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 129 transitions, 1520 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 05:37:08,423 INFO L231 Difference]: Finished difference. Result has 86 places, 97 transitions, 1213 flow [2022-12-06 05:37:08,423 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1047, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1213, PETRI_PLACES=86, PETRI_TRANSITIONS=97} [2022-12-06 05:37:08,424 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 57 predicate places. [2022-12-06 05:37:08,424 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:08,424 INFO L89 Accepts]: Start accepts. Operand has 86 places, 97 transitions, 1213 flow [2022-12-06 05:37:08,424 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:08,424 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:08,425 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 97 transitions, 1213 flow [2022-12-06 05:37:08,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 97 transitions, 1213 flow [2022-12-06 05:37:08,455 INFO L130 PetriNetUnfolder]: 156/440 cut-off events. [2022-12-06 05:37:08,455 INFO L131 PetriNetUnfolder]: For 2870/2914 co-relation queries the response was YES. [2022-12-06 05:37:08,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2265 conditions, 440 events. 156/440 cut-off events. For 2870/2914 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2614 event pairs, 13 based on Foata normal form. 8/414 useless extension candidates. Maximal degree in co-relation 2218. Up to 107 conditions per place. [2022-12-06 05:37:08,459 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 97 transitions, 1213 flow [2022-12-06 05:37:08,459 INFO L188 LiptonReduction]: Number of co-enabled transitions 552 [2022-12-06 05:37:08,461 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:37:08,629 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:08,632 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 208 [2022-12-06 05:37:08,632 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 96 transitions, 1209 flow [2022-12-06 05:37:08,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:08,632 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:08,632 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:08,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 05:37:08,633 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 1 more)] === [2022-12-06 05:37:08,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:08,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1411447523, now seen corresponding path program 1 times [2022-12-06 05:37:08,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:08,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772449637] [2022-12-06 05:37:08,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:08,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:10,252 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 05:37:10,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:10,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772449637] [2022-12-06 05:37:10,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772449637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:10,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:10,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:37:10,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460086460] [2022-12-06 05:37:10,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:10,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:37:10,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:10,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:37:10,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:37:10,254 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 05:37:10,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 96 transitions, 1209 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:10,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:10,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 05:37:10,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:10,801 INFO L130 PetriNetUnfolder]: 637/1129 cut-off events. [2022-12-06 05:37:10,801 INFO L131 PetriNetUnfolder]: For 10599/10599 co-relation queries the response was YES. [2022-12-06 05:37:10,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6905 conditions, 1129 events. 637/1129 cut-off events. For 10599/10599 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5461 event pairs, 176 based on Foata normal form. 1/1129 useless extension candidates. Maximal degree in co-relation 6850. Up to 841 conditions per place. [2022-12-06 05:37:10,808 INFO L137 encePairwiseOnDemand]: 22/34 looper letters, 90 selfloop transitions, 22 changer transitions 19/131 dead transitions. [2022-12-06 05:37:10,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 131 transitions, 1649 flow [2022-12-06 05:37:10,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:37:10,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:37:10,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-12-06 05:37:10,809 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31092436974789917 [2022-12-06 05:37:10,809 INFO L175 Difference]: Start difference. First operand has 84 places, 96 transitions, 1209 flow. Second operand 7 states and 74 transitions. [2022-12-06 05:37:10,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 131 transitions, 1649 flow [2022-12-06 05:37:10,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 131 transitions, 1569 flow, removed 17 selfloop flow, removed 4 redundant places. [2022-12-06 05:37:10,825 INFO L231 Difference]: Finished difference. Result has 90 places, 98 transitions, 1222 flow [2022-12-06 05:37:10,825 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1222, PETRI_PLACES=90, PETRI_TRANSITIONS=98} [2022-12-06 05:37:10,825 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 61 predicate places. [2022-12-06 05:37:10,825 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:10,826 INFO L89 Accepts]: Start accepts. Operand has 90 places, 98 transitions, 1222 flow [2022-12-06 05:37:10,826 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:10,826 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:10,826 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 98 transitions, 1222 flow [2022-12-06 05:37:10,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 98 transitions, 1222 flow [2022-12-06 05:37:10,858 INFO L130 PetriNetUnfolder]: 155/441 cut-off events. [2022-12-06 05:37:10,859 INFO L131 PetriNetUnfolder]: For 3041/3079 co-relation queries the response was YES. [2022-12-06 05:37:10,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2247 conditions, 441 events. 155/441 cut-off events. For 3041/3079 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2635 event pairs, 14 based on Foata normal form. 9/415 useless extension candidates. Maximal degree in co-relation 2198. Up to 103 conditions per place. [2022-12-06 05:37:10,883 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 98 transitions, 1222 flow [2022-12-06 05:37:10,883 INFO L188 LiptonReduction]: Number of co-enabled transitions 556 [2022-12-06 05:37:10,885 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:37:11,104 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:37:11,105 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 280 [2022-12-06 05:37:11,105 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 96 transitions, 1214 flow [2022-12-06 05:37:11,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:11,105 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:11,105 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:11,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 05:37:11,105 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 1 more)] === [2022-12-06 05:37:11,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:11,106 INFO L85 PathProgramCache]: Analyzing trace with hash -491321498, now seen corresponding path program 1 times [2022-12-06 05:37:11,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:11,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528844198] [2022-12-06 05:37:11,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:11,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:12,526 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 05:37:12,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:12,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528844198] [2022-12-06 05:37:12,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528844198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:12,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:12,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:37:12,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125143940] [2022-12-06 05:37:12,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:12,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:37:12,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:12,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:37:12,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:37:12,528 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:37:12,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 96 transitions, 1214 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:12,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:12,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:37:12,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:13,088 INFO L130 PetriNetUnfolder]: 632/1119 cut-off events. [2022-12-06 05:37:13,088 INFO L131 PetriNetUnfolder]: For 10638/10638 co-relation queries the response was YES. [2022-12-06 05:37:13,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6855 conditions, 1119 events. 632/1119 cut-off events. For 10638/10638 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5436 event pairs, 149 based on Foata normal form. 2/1120 useless extension candidates. Maximal degree in co-relation 6801. Up to 816 conditions per place. [2022-12-06 05:37:13,093 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 79 selfloop transitions, 32 changer transitions 18/129 dead transitions. [2022-12-06 05:37:13,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 129 transitions, 1643 flow [2022-12-06 05:37:13,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:37:13,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:37:13,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2022-12-06 05:37:13,094 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3183673469387755 [2022-12-06 05:37:13,094 INFO L175 Difference]: Start difference. First operand has 87 places, 96 transitions, 1214 flow. Second operand 7 states and 78 transitions. [2022-12-06 05:37:13,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 129 transitions, 1643 flow [2022-12-06 05:37:13,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 129 transitions, 1584 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-12-06 05:37:13,106 INFO L231 Difference]: Finished difference. Result has 91 places, 94 transitions, 1195 flow [2022-12-06 05:37:13,107 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1195, PETRI_PLACES=91, PETRI_TRANSITIONS=94} [2022-12-06 05:37:13,107 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 62 predicate places. [2022-12-06 05:37:13,107 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:13,107 INFO L89 Accepts]: Start accepts. Operand has 91 places, 94 transitions, 1195 flow [2022-12-06 05:37:13,108 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:13,108 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:13,108 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 94 transitions, 1195 flow [2022-12-06 05:37:13,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 94 transitions, 1195 flow [2022-12-06 05:37:13,138 INFO L130 PetriNetUnfolder]: 153/420 cut-off events. [2022-12-06 05:37:13,138 INFO L131 PetriNetUnfolder]: For 2979/3016 co-relation queries the response was YES. [2022-12-06 05:37:13,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2194 conditions, 420 events. 153/420 cut-off events. For 2979/3016 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2447 event pairs, 15 based on Foata normal form. 8/393 useless extension candidates. Maximal degree in co-relation 2147. Up to 102 conditions per place. [2022-12-06 05:37:13,141 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 94 transitions, 1195 flow [2022-12-06 05:37:13,141 INFO L188 LiptonReduction]: Number of co-enabled transitions 550 [2022-12-06 05:37:13,142 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:13,143 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 05:37:13,143 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 94 transitions, 1195 flow [2022-12-06 05:37:13,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:13,143 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:13,143 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 05:37:13,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 05:37:13,143 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 1 more)] === [2022-12-06 05:37:13,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:13,143 INFO L85 PathProgramCache]: Analyzing trace with hash 747385120, now seen corresponding path program 1 times [2022-12-06 05:37:13,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:13,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14253792] [2022-12-06 05:37:13,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:13,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:13,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:13,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:13,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14253792] [2022-12-06 05:37:13,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14253792] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:13,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:13,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:37:13,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677594225] [2022-12-06 05:37:13,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:13,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:37:13,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:13,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:37:13,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:37:13,191 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 05:37:13,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 94 transitions, 1195 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:13,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:13,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 05:37:13,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:13,372 INFO L130 PetriNetUnfolder]: 602/1027 cut-off events. [2022-12-06 05:37:13,372 INFO L131 PetriNetUnfolder]: For 8685/8685 co-relation queries the response was YES. [2022-12-06 05:37:13,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6415 conditions, 1027 events. 602/1027 cut-off events. For 8685/8685 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4666 event pairs, 52 based on Foata normal form. 4/1030 useless extension candidates. Maximal degree in co-relation 6364. Up to 565 conditions per place. [2022-12-06 05:37:13,378 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 101 selfloop transitions, 30 changer transitions 2/133 dead transitions. [2022-12-06 05:37:13,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 133 transitions, 1690 flow [2022-12-06 05:37:13,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:37:13,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:37:13,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-12-06 05:37:13,379 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-12-06 05:37:13,379 INFO L175 Difference]: Start difference. First operand has 89 places, 94 transitions, 1195 flow. Second operand 5 states and 75 transitions. [2022-12-06 05:37:13,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 133 transitions, 1690 flow [2022-12-06 05:37:13,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 133 transitions, 1613 flow, removed 10 selfloop flow, removed 6 redundant places. [2022-12-06 05:37:13,393 INFO L231 Difference]: Finished difference. Result has 87 places, 90 transitions, 1128 flow [2022-12-06 05:37:13,393 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1128, PETRI_PLACES=87, PETRI_TRANSITIONS=90} [2022-12-06 05:37:13,393 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 58 predicate places. [2022-12-06 05:37:13,393 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:13,393 INFO L89 Accepts]: Start accepts. Operand has 87 places, 90 transitions, 1128 flow [2022-12-06 05:37:13,394 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:13,394 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:13,394 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 90 transitions, 1128 flow [2022-12-06 05:37:13,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 90 transitions, 1128 flow [2022-12-06 05:37:13,421 INFO L130 PetriNetUnfolder]: 151/388 cut-off events. [2022-12-06 05:37:13,421 INFO L131 PetriNetUnfolder]: For 2630/2663 co-relation queries the response was YES. [2022-12-06 05:37:13,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2036 conditions, 388 events. 151/388 cut-off events. For 2630/2663 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2095 event pairs, 14 based on Foata normal form. 6/361 useless extension candidates. Maximal degree in co-relation 1752. Up to 100 conditions per place. [2022-12-06 05:37:13,424 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 90 transitions, 1128 flow [2022-12-06 05:37:13,424 INFO L188 LiptonReduction]: Number of co-enabled transitions 528 [2022-12-06 05:37:13,425 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [634] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_61| 0) (= |v_thread1Thread1of1ForFork2_~x~0#1_121| 0) (= |v_thread2Thread1of1ForFork0_#res#1.base_61| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_91| 4294967296) (mod v_~A~0_162 4294967296))) (= |v_thread1Thread1of1ForFork2_~i~0#1_116| 0) (= v_~end~0_377 (+ v_~end~0_378 1)) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_96| 4294967296) (mod (select (select |v_#memory_int_331| v_~queue~0.base_206) (+ (* v_~end~0_378 4) v_~queue~0.offset_206)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_71| 0)) (not (= (ite (and (< v_~end~0_378 v_~n~0_216) (<= 0 v_~end~0_378)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_71| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|)) InVars {~queue~0.offset=v_~queue~0.offset_206, ~A~0=v_~A~0_162, #memory_int=|v_#memory_int_331|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_91|, ~end~0=v_~end~0_378, ~queue~0.base=v_~queue~0.base_206, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_96|, ~n~0=v_~n~0_216} OutVars{~queue~0.offset=v_~queue~0.offset_206, ~A~0=v_~A~0_162, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_121|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_61|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_91|, ~queue~0.base=v_~queue~0.base_206, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_71|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_61|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_116|, #memory_int=|v_#memory_int_331|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_71|, ~end~0=v_~end~0_377, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_96|, ~n~0=v_~n~0_216, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_71|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [600] L51-5-->L51-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_28| 1) |v_thread1Thread1of1ForFork2_~i~0#1_27|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_28| 4294967296) (mod v_~A~0_57 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_31| (+ |v_thread1Thread1of1ForFork2_~x~0#1_32| v_~B~0_47))) InVars {~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_32|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_28|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_31|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] [2022-12-06 05:37:13,517 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [634] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_61| 0) (= |v_thread1Thread1of1ForFork2_~x~0#1_121| 0) (= |v_thread2Thread1of1ForFork0_#res#1.base_61| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_91| 4294967296) (mod v_~A~0_162 4294967296))) (= |v_thread1Thread1of1ForFork2_~i~0#1_116| 0) (= v_~end~0_377 (+ v_~end~0_378 1)) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_96| 4294967296) (mod (select (select |v_#memory_int_331| v_~queue~0.base_206) (+ (* v_~end~0_378 4) v_~queue~0.offset_206)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_71| 0)) (not (= (ite (and (< v_~end~0_378 v_~n~0_216) (<= 0 v_~end~0_378)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_71| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|)) InVars {~queue~0.offset=v_~queue~0.offset_206, ~A~0=v_~A~0_162, #memory_int=|v_#memory_int_331|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_91|, ~end~0=v_~end~0_378, ~queue~0.base=v_~queue~0.base_206, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_96|, ~n~0=v_~n~0_216} OutVars{~queue~0.offset=v_~queue~0.offset_206, ~A~0=v_~A~0_162, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_121|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_61|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_91|, ~queue~0.base=v_~queue~0.base_206, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_71|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_61|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_116|, #memory_int=|v_#memory_int_331|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_71|, ~end~0=v_~end~0_377, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_96|, ~n~0=v_~n~0_216, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_71|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:37:13,613 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] $Ultimate##0-->L104-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre18#1_122| |v_#pthreadsForks_235|) (= |v_thread2Thread1of1ForFork0_#res#1.offset_73| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|) (not (= (ite (and (<= 0 v_~end~0_428) (< v_~end~0_428 v_~n~0_244)) 1 0) 0)) (= (store |v_#memory_int_386| |v_ULTIMATE.start_main_~#t3~0#1.base_142| (store (select |v_#memory_int_386| |v_ULTIMATE.start_main_~#t3~0#1.base_142|) |v_ULTIMATE.start_main_~#t3~0#1.offset_126| |v_ULTIMATE.start_main_#t~pre18#1_122|)) |v_#memory_int_385|) (= |v_#pthreadsForks_234| (+ |v_#pthreadsForks_235| 1)) (= |v_thread1Thread1of1ForFork2_~x~0#1_141| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_136| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_107| 4294967296) (mod v_~A~0_192 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_112| 4294967296) (mod (select (select |v_#memory_int_386| v_~queue~0.base_236) (+ (* v_~end~0_428 4) v_~queue~0.offset_236)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|) (= |v_thread2Thread1of1ForFork0_#res#1.base_73| 0) (= v_~end~0_427 (+ v_~end~0_428 1))) InVars {~queue~0.offset=v_~queue~0.offset_236, ~A~0=v_~A~0_192, #pthreadsForks=|v_#pthreadsForks_235|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_126|, #memory_int=|v_#memory_int_386|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_142|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_107|, ~end~0=v_~end~0_428, ~queue~0.base=v_~queue~0.base_236, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_112|, ~n~0=v_~n~0_244} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_122|, ~queue~0.offset=v_~queue~0.offset_236, ~A~0=v_~A~0_192, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_141|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_126|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_73|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_142|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_107|, ~queue~0.base=v_~queue~0.base_236, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_73|, #pthreadsForks=|v_#pthreadsForks_234|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_136|, #memory_int=|v_#memory_int_385|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_130|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_83|, ~end~0=v_~end~0_427, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_110|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_112|, ~n~0=v_~n~0_244, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_83|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork2_~x~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, #pthreadsForks, thread1Thread1of1ForFork2_~i~0#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, ULTIMATE.start_main_#t~nondet17#1, thread2Thread1of1ForFork0_#t~post6#1] and [600] L51-5-->L51-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_28| 1) |v_thread1Thread1of1ForFork2_~i~0#1_27|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_28| 4294967296) (mod v_~A~0_57 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_31| (+ |v_thread1Thread1of1ForFork2_~x~0#1_32| v_~B~0_47))) InVars {~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_32|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_28|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_31|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] [2022-12-06 05:37:13,720 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:37:13,720 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 327 [2022-12-06 05:37:13,720 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 88 transitions, 1136 flow [2022-12-06 05:37:13,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:13,720 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:13,720 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 05:37:13,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 05:37:13,721 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 1 more)] === [2022-12-06 05:37:13,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:13,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1025211, now seen corresponding path program 1 times [2022-12-06 05:37:13,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:13,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570670392] [2022-12-06 05:37:13,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:13,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:13,779 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 05:37:13,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:13,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570670392] [2022-12-06 05:37:13,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570670392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:13,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:13,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:37:13,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162070467] [2022-12-06 05:37:13,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:13,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:37:13,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:13,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:37:13,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:37:13,782 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:37:13,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 88 transitions, 1136 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:13,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:13,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:37:13,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:14,061 INFO L130 PetriNetUnfolder]: 604/1017 cut-off events. [2022-12-06 05:37:14,061 INFO L131 PetriNetUnfolder]: For 8414/8414 co-relation queries the response was YES. [2022-12-06 05:37:14,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6287 conditions, 1017 events. 604/1017 cut-off events. For 8414/8414 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4502 event pairs, 51 based on Foata normal form. 13/1029 useless extension candidates. Maximal degree in co-relation 5736. Up to 561 conditions per place. [2022-12-06 05:37:14,067 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 102 selfloop transitions, 31 changer transitions 0/133 dead transitions. [2022-12-06 05:37:14,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 133 transitions, 1629 flow [2022-12-06 05:37:14,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:37:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:37:14,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-06 05:37:14,068 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2022-12-06 05:37:14,068 INFO L175 Difference]: Start difference. First operand has 81 places, 88 transitions, 1136 flow. Second operand 6 states and 81 transitions. [2022-12-06 05:37:14,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 133 transitions, 1629 flow [2022-12-06 05:37:14,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 133 transitions, 1529 flow, removed 18 selfloop flow, removed 6 redundant places. [2022-12-06 05:37:14,079 INFO L231 Difference]: Finished difference. Result has 82 places, 88 transitions, 1083 flow [2022-12-06 05:37:14,079 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=967, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1083, PETRI_PLACES=82, PETRI_TRANSITIONS=88} [2022-12-06 05:37:14,079 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 53 predicate places. [2022-12-06 05:37:14,079 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:14,079 INFO L89 Accepts]: Start accepts. Operand has 82 places, 88 transitions, 1083 flow [2022-12-06 05:37:14,080 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:14,080 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:14,080 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 88 transitions, 1083 flow [2022-12-06 05:37:14,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 88 transitions, 1083 flow [2022-12-06 05:37:14,139 INFO L130 PetriNetUnfolder]: 152/384 cut-off events. [2022-12-06 05:37:14,139 INFO L131 PetriNetUnfolder]: For 2655/2681 co-relation queries the response was YES. [2022-12-06 05:37:14,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2089 conditions, 384 events. 152/384 cut-off events. For 2655/2681 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2032 event pairs, 14 based on Foata normal form. 8/358 useless extension candidates. Maximal degree in co-relation 1850. Up to 99 conditions per place. [2022-12-06 05:37:14,142 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 88 transitions, 1083 flow [2022-12-06 05:37:14,142 INFO L188 LiptonReduction]: Number of co-enabled transitions 528 [2022-12-06 05:37:14,182 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:14,183 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-06 05:37:14,183 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 88 transitions, 1093 flow [2022-12-06 05:37:14,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:14,184 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:14,184 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 05:37:14,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 05:37:14,184 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 1 more)] === [2022-12-06 05:37:14,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:14,184 INFO L85 PathProgramCache]: Analyzing trace with hash 914593211, now seen corresponding path program 1 times [2022-12-06 05:37:14,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:14,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425450257] [2022-12-06 05:37:14,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:14,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:15,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 05:37:15,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:15,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425450257] [2022-12-06 05:37:15,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425450257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:15,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:15,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 05:37:15,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391200383] [2022-12-06 05:37:15,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:15,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:37:15,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:15,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:37:15,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:37:15,783 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 05:37:15,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 88 transitions, 1093 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:37:15,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:15,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 05:37:15,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:16,626 INFO L130 PetriNetUnfolder]: 597/1021 cut-off events. [2022-12-06 05:37:16,626 INFO L131 PetriNetUnfolder]: For 9880/9880 co-relation queries the response was YES. [2022-12-06 05:37:16,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6499 conditions, 1021 events. 597/1021 cut-off events. For 9880/9880 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4547 event pairs, 152 based on Foata normal form. 1/1021 useless extension candidates. Maximal degree in co-relation 5819. Up to 760 conditions per place. [2022-12-06 05:37:16,632 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 78 selfloop transitions, 33 changer transitions 13/124 dead transitions. [2022-12-06 05:37:16,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 124 transitions, 1544 flow [2022-12-06 05:37:16,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:37:16,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:37:16,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-12-06 05:37:16,633 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30078125 [2022-12-06 05:37:16,633 INFO L175 Difference]: Start difference. First operand has 82 places, 88 transitions, 1093 flow. Second operand 8 states and 77 transitions. [2022-12-06 05:37:16,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 124 transitions, 1544 flow [2022-12-06 05:37:16,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 124 transitions, 1472 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 05:37:16,645 INFO L231 Difference]: Finished difference. Result has 89 places, 93 transitions, 1161 flow [2022-12-06 05:37:16,646 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1161, PETRI_PLACES=89, PETRI_TRANSITIONS=93} [2022-12-06 05:37:16,646 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 60 predicate places. [2022-12-06 05:37:16,646 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:16,646 INFO L89 Accepts]: Start accepts. Operand has 89 places, 93 transitions, 1161 flow [2022-12-06 05:37:16,647 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:16,647 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:16,647 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 93 transitions, 1161 flow [2022-12-06 05:37:16,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 93 transitions, 1161 flow [2022-12-06 05:37:16,675 INFO L130 PetriNetUnfolder]: 153/391 cut-off events. [2022-12-06 05:37:16,675 INFO L131 PetriNetUnfolder]: For 2845/2873 co-relation queries the response was YES. [2022-12-06 05:37:16,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2169 conditions, 391 events. 153/391 cut-off events. For 2845/2873 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2087 event pairs, 12 based on Foata normal form. 10/366 useless extension candidates. Maximal degree in co-relation 2125. Up to 101 conditions per place. [2022-12-06 05:37:16,678 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 93 transitions, 1161 flow [2022-12-06 05:37:16,678 INFO L188 LiptonReduction]: Number of co-enabled transitions 532 [2022-12-06 05:37:16,690 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [634] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_61| 0) (= |v_thread1Thread1of1ForFork2_~x~0#1_121| 0) (= |v_thread2Thread1of1ForFork0_#res#1.base_61| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_91| 4294967296) (mod v_~A~0_162 4294967296))) (= |v_thread1Thread1of1ForFork2_~i~0#1_116| 0) (= v_~end~0_377 (+ v_~end~0_378 1)) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_96| 4294967296) (mod (select (select |v_#memory_int_331| v_~queue~0.base_206) (+ (* v_~end~0_378 4) v_~queue~0.offset_206)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_71| 0)) (not (= (ite (and (< v_~end~0_378 v_~n~0_216) (<= 0 v_~end~0_378)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_71| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|)) InVars {~queue~0.offset=v_~queue~0.offset_206, ~A~0=v_~A~0_162, #memory_int=|v_#memory_int_331|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_91|, ~end~0=v_~end~0_378, ~queue~0.base=v_~queue~0.base_206, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_96|, ~n~0=v_~n~0_216} OutVars{~queue~0.offset=v_~queue~0.offset_206, ~A~0=v_~A~0_162, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_121|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_61|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_91|, ~queue~0.base=v_~queue~0.base_206, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_71|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_61|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_116|, #memory_int=|v_#memory_int_331|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_71|, ~end~0=v_~end~0_377, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_96|, ~n~0=v_~n~0_216, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_71|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [600] L51-5-->L51-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_28| 1) |v_thread1Thread1of1ForFork2_~i~0#1_27|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_28| 4294967296) (mod v_~A~0_57 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_31| (+ |v_thread1Thread1of1ForFork2_~x~0#1_32| v_~B~0_47))) InVars {~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_32|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_28|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_31|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] [2022-12-06 05:37:16,786 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [556] $Ultimate##0-->L51-5: Formula: (and (= |v_thread1Thread1of1ForFork2_~x~0#1_19| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_23| 0)) InVars {} OutVars{thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_19|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_23|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:37:16,922 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [651] $Ultimate##0-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_68| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.base_66| 0) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_158| 4294967296) (mod v_~A~0_206 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_66| 0) (not (= (ite (and (<= 0 v_~end~0_454) (< v_~end~0_454 v_~n~0_258)) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_~x~0#1_163| 0) (= v_~end~0_453 (+ v_~end~0_454 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_68| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_68|) (= |v_thread1Thread1of1ForFork2_~i~0#1_158| 0) (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_163| 4294967296) (mod (select (select |v_#memory_int_413| v_~queue~0.base_250) (+ (* v_~end~0_454 4) v_~queue~0.offset_250)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_68|)) InVars {~queue~0.offset=v_~queue~0.offset_250, ~A~0=v_~A~0_206, #memory_int=|v_#memory_int_413|, ~end~0=v_~end~0_454, ~queue~0.base=v_~queue~0.base_250, ~n~0=v_~n~0_258} OutVars{~queue~0.offset=v_~queue~0.offset_250, ~A~0=v_~A~0_206, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_163|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_68|, ~queue~0.base=v_~queue~0.base_250, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_68|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_158|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_68|, #memory_int=|v_#memory_int_413|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_66|, ~end~0=v_~end~0_453, ~n~0=v_~n~0_258, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_66|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_68|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 05:37:17,150 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [650] $Ultimate##0-->L104-3: Formula: (and (= (+ |v_#pthreadsForks_255| 1) |v_#pthreadsForks_254|) (= |v_thread1Thread1of1ForFork2_~x~0#1_161| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_156| 0) (= |v_ULTIMATE.start_main_#t~pre18#1_132| |v_#pthreadsForks_255|) (= (store |v_#memory_int_410| |v_ULTIMATE.start_main_~#t3~0#1.base_154| (store (select |v_#memory_int_410| |v_ULTIMATE.start_main_~#t3~0#1.base_154|) |v_ULTIMATE.start_main_~#t3~0#1.offset_136| |v_ULTIMATE.start_main_#t~pre18#1_132|)) |v_#memory_int_409|)) InVars {#pthreadsForks=|v_#pthreadsForks_255|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_136|, #memory_int=|v_#memory_int_410|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_154|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_132|, #pthreadsForks=|v_#pthreadsForks_254|, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_161|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_156|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_136|, #memory_int=|v_#memory_int_409|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_154|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_140|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_120|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:37:17,271 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [653] L67-5-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_415| v_~queue~0.base_252))) (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_70| 0)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_164| 4294967296) (mod v_~A~0_210 4294967296))) (not (= (ite (and (<= 0 v_~end~0_459) (< v_~end~0_459 v_~n~0_260)) 1 0) 0)) (= (ite (= (mod (select .cse0 (+ (* v_~end~0_457 4) (- 4) v_~queue~0.offset_252)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_169| 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_70|) (= |v_thread2Thread1of1ForFork0_#res#1.offset_85| 0) (= |v_thread1Thread1of1ForFork2_~x~0#1_169| 0) (= v_~end~0_457 (+ v_~end~0_459 2)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_95| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|) (= |v_thread1Thread1of1ForFork2_#res#1.base_68| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_70| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_70|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_95| 0)) (not (= (ite (and (<= 1 v_~end~0_457) (< v_~end~0_457 (+ v_~n~0_260 1))) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_~i~0#1_164| 0) (= |v_thread2Thread1of1ForFork0_#res#1.base_85| 0) (= |v_thread1Thread1of1ForFork2_#res#1.offset_68| 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95| (ite (= (mod (select .cse0 (+ (* v_~end~0_459 4) v_~queue~0.offset_252)) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_124| 4294967296)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_252, ~A~0=v_~A~0_210, #memory_int=|v_#memory_int_415|, ~end~0=v_~end~0_459, ~queue~0.base=v_~queue~0.base_252, ~n~0=v_~n~0_260, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_124|} OutVars{~queue~0.offset=v_~queue~0.offset_252, ~A~0=v_~A~0_210, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_169|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_85|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_70|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|, ~queue~0.base=v_~queue~0.base_252, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_95|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_85|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_70|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_164|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_70|, #memory_int=|v_#memory_int_415|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_68|, ~end~0=v_~end~0_457, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_95|, ~n~0=v_~n~0_260, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_124|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_68|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_70|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_95|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread2Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:37:17,424 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:37:17,426 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 780 [2022-12-06 05:37:17,426 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 91 transitions, 1215 flow [2022-12-06 05:37:17,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:37:17,426 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:17,426 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 05:37:17,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 05:37:17,426 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 1 more)] === [2022-12-06 05:37:17,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:17,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1906731295, now seen corresponding path program 2 times [2022-12-06 05:37:17,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:17,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688820645] [2022-12-06 05:37:17,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:17,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:19,677 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 05:37:19,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:19,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688820645] [2022-12-06 05:37:19,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688820645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:19,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:19,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 05:37:19,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446664466] [2022-12-06 05:37:19,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:19,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:37:19,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:19,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:37:19,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:37:19,679 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 05:37:19,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 91 transitions, 1215 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:37:19,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:19,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 05:37:19,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:20,776 INFO L130 PetriNetUnfolder]: 596/1029 cut-off events. [2022-12-06 05:37:20,776 INFO L131 PetriNetUnfolder]: For 10436/10436 co-relation queries the response was YES. [2022-12-06 05:37:20,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6616 conditions, 1029 events. 596/1029 cut-off events. For 10436/10436 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4698 event pairs, 146 based on Foata normal form. 2/1030 useless extension candidates. Maximal degree in co-relation 6566. Up to 738 conditions per place. [2022-12-06 05:37:20,781 INFO L137 encePairwiseOnDemand]: 21/36 looper letters, 78 selfloop transitions, 31 changer transitions 29/138 dead transitions. [2022-12-06 05:37:20,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 138 transitions, 1726 flow [2022-12-06 05:37:20,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:37:20,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:37:20,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2022-12-06 05:37:20,795 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25833333333333336 [2022-12-06 05:37:20,795 INFO L175 Difference]: Start difference. First operand has 86 places, 91 transitions, 1215 flow. Second operand 10 states and 93 transitions. [2022-12-06 05:37:20,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 138 transitions, 1726 flow [2022-12-06 05:37:20,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 138 transitions, 1606 flow, removed 29 selfloop flow, removed 7 redundant places. [2022-12-06 05:37:20,824 INFO L231 Difference]: Finished difference. Result has 94 places, 91 transitions, 1164 flow [2022-12-06 05:37:20,825 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1164, PETRI_PLACES=94, PETRI_TRANSITIONS=91} [2022-12-06 05:37:20,825 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2022-12-06 05:37:20,825 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:20,825 INFO L89 Accepts]: Start accepts. Operand has 94 places, 91 transitions, 1164 flow [2022-12-06 05:37:20,826 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:20,826 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:20,826 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 91 transitions, 1164 flow [2022-12-06 05:37:20,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 91 transitions, 1164 flow [2022-12-06 05:37:20,853 INFO L130 PetriNetUnfolder]: 150/377 cut-off events. [2022-12-06 05:37:20,853 INFO L131 PetriNetUnfolder]: For 2939/2970 co-relation queries the response was YES. [2022-12-06 05:37:20,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2121 conditions, 377 events. 150/377 cut-off events. For 2939/2970 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1987 event pairs, 13 based on Foata normal form. 8/353 useless extension candidates. Maximal degree in co-relation 2069. Up to 100 conditions per place. [2022-12-06 05:37:20,856 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 91 transitions, 1164 flow [2022-12-06 05:37:20,856 INFO L188 LiptonReduction]: Number of co-enabled transitions 526 [2022-12-06 05:37:20,859 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [654] L67-5-->L104-3: Formula: (and (= |v_thread1Thread1of1ForFork2_~x~0#1_171| 0) (= v_~end~0_463 (+ v_~end~0_464 1)) (= |v_#memory_int_417| (store |v_#memory_int_418| |v_ULTIMATE.start_main_~#t3~0#1.base_156| (store (select |v_#memory_int_418| |v_ULTIMATE.start_main_~#t3~0#1.base_156|) |v_ULTIMATE.start_main_~#t3~0#1.offset_138| |v_ULTIMATE.start_main_#t~pre18#1_134|))) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_97| 0)) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_121| 4294967296) (mod v_~A~0_212 4294967296))) (= |v_thread2Thread1of1ForFork0_#res#1.base_87| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_87| 0) (= (ite (= (mod (select (select |v_#memory_int_418| v_~queue~0.base_254) (+ (* v_~end~0_464 4) v_~queue~0.offset_254)) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_126| 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|) (= |v_thread1Thread1of1ForFork2_~i~0#1_166| 0) (not (= (ite (and (<= 0 v_~end~0_464) (< v_~end~0_464 v_~n~0_262)) 1 0) 0)) (= |v_ULTIMATE.start_main_#t~pre18#1_134| |v_#pthreadsForks_259|) (= (+ |v_#pthreadsForks_259| 1) |v_#pthreadsForks_258|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_97| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|)) InVars {~queue~0.offset=v_~queue~0.offset_254, ~A~0=v_~A~0_212, #pthreadsForks=|v_#pthreadsForks_259|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_138|, #memory_int=|v_#memory_int_418|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_156|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_121|, ~end~0=v_~end~0_464, ~queue~0.base=v_~queue~0.base_254, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_126|, ~n~0=v_~n~0_262} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_134|, ~queue~0.offset=v_~queue~0.offset_254, ~A~0=v_~A~0_212, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_171|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_138|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_87|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_156|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_121|, ~queue~0.base=v_~queue~0.base_254, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_97|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_87|, #pthreadsForks=|v_#pthreadsForks_258|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_166|, #memory_int=|v_#memory_int_417|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_142|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_97|, ~end~0=v_~end~0_463, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_122|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_126|, ~n~0=v_~n~0_262, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_97|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork2_~x~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, #pthreadsForks, thread1Thread1of1ForFork2_~i~0#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, ULTIMATE.start_main_#t~nondet17#1, thread2Thread1of1ForFork0_#t~post6#1] and [600] L51-5-->L51-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_28| 1) |v_thread1Thread1of1ForFork2_~i~0#1_27|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_28| 4294967296) (mod v_~A~0_57 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_31| (+ |v_thread1Thread1of1ForFork2_~x~0#1_32| v_~B~0_47))) InVars {~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_32|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_28|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_31|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] [2022-12-06 05:37:20,955 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:20,956 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-06 05:37:20,956 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 90 transitions, 1165 flow [2022-12-06 05:37:20,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:37:20,957 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:20,957 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:20,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 05:37:20,957 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 1 more)] === [2022-12-06 05:37:20,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:20,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1624444292, now seen corresponding path program 1 times [2022-12-06 05:37:20,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:20,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423277698] [2022-12-06 05:37:20,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:20,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:21,019 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 05:37:21,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:21,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423277698] [2022-12-06 05:37:21,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423277698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:21,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:21,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:37:21,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014353714] [2022-12-06 05:37:21,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:21,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:37:21,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:21,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:37:21,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:37:21,021 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:37:21,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 90 transitions, 1165 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:21,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:21,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:37:21,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:21,144 INFO L130 PetriNetUnfolder]: 578/976 cut-off events. [2022-12-06 05:37:21,144 INFO L131 PetriNetUnfolder]: For 9425/9425 co-relation queries the response was YES. [2022-12-06 05:37:21,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6300 conditions, 976 events. 578/976 cut-off events. For 9425/9425 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4258 event pairs, 123 based on Foata normal form. 1/976 useless extension candidates. Maximal degree in co-relation 6242. Up to 613 conditions per place. [2022-12-06 05:37:21,150 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 84 selfloop transitions, 22 changer transitions 0/106 dead transitions. [2022-12-06 05:37:21,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 106 transitions, 1469 flow [2022-12-06 05:37:21,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:37:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:37:21,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-06 05:37:21,151 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2022-12-06 05:37:21,151 INFO L175 Difference]: Start difference. First operand has 88 places, 90 transitions, 1165 flow. Second operand 3 states and 51 transitions. [2022-12-06 05:37:21,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 106 transitions, 1469 flow [2022-12-06 05:37:21,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 106 transitions, 1382 flow, removed 23 selfloop flow, removed 9 redundant places. [2022-12-06 05:37:21,164 INFO L231 Difference]: Finished difference. Result has 81 places, 89 transitions, 1098 flow [2022-12-06 05:37:21,165 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1098, PETRI_PLACES=81, PETRI_TRANSITIONS=89} [2022-12-06 05:37:21,165 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 52 predicate places. [2022-12-06 05:37:21,165 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:21,165 INFO L89 Accepts]: Start accepts. Operand has 81 places, 89 transitions, 1098 flow [2022-12-06 05:37:21,166 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:21,166 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:21,166 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 89 transitions, 1098 flow [2022-12-06 05:37:21,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 89 transitions, 1098 flow [2022-12-06 05:37:21,195 INFO L130 PetriNetUnfolder]: 149/377 cut-off events. [2022-12-06 05:37:21,195 INFO L131 PetriNetUnfolder]: For 2538/2560 co-relation queries the response was YES. [2022-12-06 05:37:21,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1991 conditions, 377 events. 149/377 cut-off events. For 2538/2560 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1982 event pairs, 14 based on Foata normal form. 10/354 useless extension candidates. Maximal degree in co-relation 1844. Up to 99 conditions per place. [2022-12-06 05:37:21,198 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 89 transitions, 1098 flow [2022-12-06 05:37:21,198 INFO L188 LiptonReduction]: Number of co-enabled transitions 522 [2022-12-06 05:37:21,199 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:21,199 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 05:37:21,199 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 89 transitions, 1098 flow [2022-12-06 05:37:21,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:21,199 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:21,199 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 05:37:21,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 05:37:21,200 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 1 more)] === [2022-12-06 05:37:21,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:21,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1787957051, now seen corresponding path program 1 times [2022-12-06 05:37:21,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:21,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38447600] [2022-12-06 05:37:21,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:21,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:21,241 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 05:37:21,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:21,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38447600] [2022-12-06 05:37:21,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38447600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:21,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:21,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:37:21,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113560254] [2022-12-06 05:37:21,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:21,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:37:21,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:21,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:37:21,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:37:21,243 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 05:37:21,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 89 transitions, 1098 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:21,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:21,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 05:37:21,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:21,390 INFO L130 PetriNetUnfolder]: 544/915 cut-off events. [2022-12-06 05:37:21,390 INFO L131 PetriNetUnfolder]: For 8558/8558 co-relation queries the response was YES. [2022-12-06 05:37:21,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5794 conditions, 915 events. 544/915 cut-off events. For 8558/8558 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3905 event pairs, 119 based on Foata normal form. 11/925 useless extension candidates. Maximal degree in co-relation 5698. Up to 613 conditions per place. [2022-12-06 05:37:21,396 INFO L137 encePairwiseOnDemand]: 28/34 looper letters, 82 selfloop transitions, 24 changer transitions 2/108 dead transitions. [2022-12-06 05:37:21,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 108 transitions, 1410 flow [2022-12-06 05:37:21,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:37:21,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:37:21,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 05:37:21,397 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4264705882352941 [2022-12-06 05:37:21,397 INFO L175 Difference]: Start difference. First operand has 81 places, 89 transitions, 1098 flow. Second operand 4 states and 58 transitions. [2022-12-06 05:37:21,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 108 transitions, 1410 flow [2022-12-06 05:37:21,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 108 transitions, 1353 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 05:37:21,408 INFO L231 Difference]: Finished difference. Result has 82 places, 85 transitions, 1078 flow [2022-12-06 05:37:21,408 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1078, PETRI_PLACES=82, PETRI_TRANSITIONS=85} [2022-12-06 05:37:21,409 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 53 predicate places. [2022-12-06 05:37:21,409 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:21,409 INFO L89 Accepts]: Start accepts. Operand has 82 places, 85 transitions, 1078 flow [2022-12-06 05:37:21,409 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:21,409 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:21,410 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 85 transitions, 1078 flow [2022-12-06 05:37:21,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 85 transitions, 1078 flow [2022-12-06 05:37:21,434 INFO L130 PetriNetUnfolder]: 138/341 cut-off events. [2022-12-06 05:37:21,434 INFO L131 PetriNetUnfolder]: For 2530/2552 co-relation queries the response was YES. [2022-12-06 05:37:21,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1869 conditions, 341 events. 138/341 cut-off events. For 2530/2552 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1691 event pairs, 12 based on Foata normal form. 10/320 useless extension candidates. Maximal degree in co-relation 1735. Up to 90 conditions per place. [2022-12-06 05:37:21,437 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 85 transitions, 1078 flow [2022-12-06 05:37:21,437 INFO L188 LiptonReduction]: Number of co-enabled transitions 516 [2022-12-06 05:37:21,437 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:21,438 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 05:37:21,438 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 85 transitions, 1078 flow [2022-12-06 05:37:21,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:21,438 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:21,438 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 05:37:21,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 05:37:21,438 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 1 more)] === [2022-12-06 05:37:21,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:21,438 INFO L85 PathProgramCache]: Analyzing trace with hash -351892918, now seen corresponding path program 1 times [2022-12-06 05:37:21,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:21,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536742724] [2022-12-06 05:37:21,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:21,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:22,798 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 05:37:22,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:22,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536742724] [2022-12-06 05:37:22,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536742724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:22,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:22,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 05:37:22,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541736952] [2022-12-06 05:37:22,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:22,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:37:22,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:22,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:37:22,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:37:22,800 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 05:37:22,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 85 transitions, 1078 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:37:22,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:22,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 05:37:22,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:23,551 INFO L130 PetriNetUnfolder]: 614/1037 cut-off events. [2022-12-06 05:37:23,552 INFO L131 PetriNetUnfolder]: For 10431/10431 co-relation queries the response was YES. [2022-12-06 05:37:23,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6643 conditions, 1037 events. 614/1037 cut-off events. For 10431/10431 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4590 event pairs, 120 based on Foata normal form. 1/1037 useless extension candidates. Maximal degree in co-relation 6177. Up to 599 conditions per place. [2022-12-06 05:37:23,557 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 89 selfloop transitions, 41 changer transitions 13/143 dead transitions. [2022-12-06 05:37:23,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 143 transitions, 1809 flow [2022-12-06 05:37:23,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:37:23,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:37:23,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-12-06 05:37:23,558 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34375 [2022-12-06 05:37:23,558 INFO L175 Difference]: Start difference. First operand has 80 places, 85 transitions, 1078 flow. Second operand 8 states and 88 transitions. [2022-12-06 05:37:23,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 143 transitions, 1809 flow [2022-12-06 05:37:23,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 143 transitions, 1761 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 05:37:23,571 INFO L231 Difference]: Finished difference. Result has 88 places, 95 transitions, 1284 flow [2022-12-06 05:37:23,571 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1284, PETRI_PLACES=88, PETRI_TRANSITIONS=95} [2022-12-06 05:37:23,571 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 59 predicate places. [2022-12-06 05:37:23,572 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:23,572 INFO L89 Accepts]: Start accepts. Operand has 88 places, 95 transitions, 1284 flow [2022-12-06 05:37:23,572 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:23,572 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:23,572 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 95 transitions, 1284 flow [2022-12-06 05:37:23,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 95 transitions, 1284 flow [2022-12-06 05:37:23,602 INFO L130 PetriNetUnfolder]: 155/391 cut-off events. [2022-12-06 05:37:23,603 INFO L131 PetriNetUnfolder]: For 3502/3575 co-relation queries the response was YES. [2022-12-06 05:37:23,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2319 conditions, 391 events. 155/391 cut-off events. For 3502/3575 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2070 event pairs, 10 based on Foata normal form. 8/359 useless extension candidates. Maximal degree in co-relation 2277. Up to 101 conditions per place. [2022-12-06 05:37:23,606 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 95 transitions, 1284 flow [2022-12-06 05:37:23,606 INFO L188 LiptonReduction]: Number of co-enabled transitions 560 [2022-12-06 05:37:23,608 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:37:23,720 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:23,721 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-06 05:37:23,721 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 94 transitions, 1280 flow [2022-12-06 05:37:23,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:37:23,721 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:23,721 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 05:37:23,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 05:37:23,721 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 1 more)] === [2022-12-06 05:37:23,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:23,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1418069074, now seen corresponding path program 2 times [2022-12-06 05:37:23,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:23,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59559284] [2022-12-06 05:37:23,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:23,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:24,951 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 05:37:24,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:24,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59559284] [2022-12-06 05:37:24,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59559284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:24,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:24,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 05:37:24,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037862006] [2022-12-06 05:37:24,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:24,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:37:24,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:24,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:37:24,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:37:24,952 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:37:24,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 94 transitions, 1280 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:37:24,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:24,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:37:24,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:25,525 INFO L130 PetriNetUnfolder]: 641/1091 cut-off events. [2022-12-06 05:37:25,525 INFO L131 PetriNetUnfolder]: For 12276/12276 co-relation queries the response was YES. [2022-12-06 05:37:25,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7363 conditions, 1091 events. 641/1091 cut-off events. For 12276/12276 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4968 event pairs, 151 based on Foata normal form. 1/1091 useless extension candidates. Maximal degree in co-relation 7316. Up to 527 conditions per place. [2022-12-06 05:37:25,531 INFO L137 encePairwiseOnDemand]: 20/33 looper letters, 85 selfloop transitions, 42 changer transitions 15/142 dead transitions. [2022-12-06 05:37:25,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 142 transitions, 1920 flow [2022-12-06 05:37:25,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:37:25,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:37:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-12-06 05:37:25,533 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-06 05:37:25,533 INFO L175 Difference]: Start difference. First operand has 86 places, 94 transitions, 1280 flow. Second operand 8 states and 88 transitions. [2022-12-06 05:37:25,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 142 transitions, 1920 flow [2022-12-06 05:37:25,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 142 transitions, 1804 flow, removed 29 selfloop flow, removed 6 redundant places. [2022-12-06 05:37:25,549 INFO L231 Difference]: Finished difference. Result has 90 places, 95 transitions, 1318 flow [2022-12-06 05:37:25,549 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1184, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1318, PETRI_PLACES=90, PETRI_TRANSITIONS=95} [2022-12-06 05:37:25,549 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 61 predicate places. [2022-12-06 05:37:25,549 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:25,549 INFO L89 Accepts]: Start accepts. Operand has 90 places, 95 transitions, 1318 flow [2022-12-06 05:37:25,550 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:25,550 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:25,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 95 transitions, 1318 flow [2022-12-06 05:37:25,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 95 transitions, 1318 flow [2022-12-06 05:37:25,579 INFO L130 PetriNetUnfolder]: 152/391 cut-off events. [2022-12-06 05:37:25,579 INFO L131 PetriNetUnfolder]: For 3810/3873 co-relation queries the response was YES. [2022-12-06 05:37:25,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2369 conditions, 391 events. 152/391 cut-off events. For 3810/3873 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2129 event pairs, 11 based on Foata normal form. 8/359 useless extension candidates. Maximal degree in co-relation 2327. Up to 101 conditions per place. [2022-12-06 05:37:25,582 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 95 transitions, 1318 flow [2022-12-06 05:37:25,582 INFO L188 LiptonReduction]: Number of co-enabled transitions 568 [2022-12-06 05:37:25,583 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:25,584 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 05:37:25,584 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 95 transitions, 1318 flow [2022-12-06 05:37:25,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:37:25,584 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:25,584 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 05:37:25,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 05:37:25,584 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 1 more)] === [2022-12-06 05:37:25,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:25,584 INFO L85 PathProgramCache]: Analyzing trace with hash 539111118, now seen corresponding path program 1 times [2022-12-06 05:37:25,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:25,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347105292] [2022-12-06 05:37:25,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:25,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:26,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:26,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:26,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347105292] [2022-12-06 05:37:26,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347105292] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:37:26,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108259510] [2022-12-06 05:37:26,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:26,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:37:26,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:37:26,386 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:37:26,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:37:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:26,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-06 05:37:26,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:37:26,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-12-06 05:37:26,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:37:26,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:37:26,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:37:26,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:26,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:37:27,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:27,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108259510] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:37:27,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:37:27,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-12-06 05:37:27,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011784423] [2022-12-06 05:37:27,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:37:27,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 05:37:27,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:27,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 05:37:27,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=568, Unknown=4, NotChecked=0, Total=702 [2022-12-06 05:37:27,360 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 05:37:27,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 95 transitions, 1318 flow. Second operand has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 27 states have internal predecessors, (53), 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 05:37:27,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:27,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 05:37:27,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:38,976 INFO L130 PetriNetUnfolder]: 1089/1889 cut-off events. [2022-12-06 05:37:38,976 INFO L131 PetriNetUnfolder]: For 22022/22022 co-relation queries the response was YES. [2022-12-06 05:37:38,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12573 conditions, 1889 events. 1089/1889 cut-off events. For 22022/22022 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 10006 event pairs, 164 based on Foata normal form. 2/1889 useless extension candidates. Maximal degree in co-relation 12511. Up to 584 conditions per place. [2022-12-06 05:37:38,986 INFO L137 encePairwiseOnDemand]: 11/32 looper letters, 218 selfloop transitions, 130 changer transitions 26/374 dead transitions. [2022-12-06 05:37:38,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 374 transitions, 4305 flow [2022-12-06 05:37:38,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-06 05:37:38,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-06 05:37:38,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 269 transitions. [2022-12-06 05:37:38,989 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2626953125 [2022-12-06 05:37:38,989 INFO L175 Difference]: Start difference. First operand has 88 places, 95 transitions, 1318 flow. Second operand 32 states and 269 transitions. [2022-12-06 05:37:38,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 374 transitions, 4305 flow [2022-12-06 05:37:39,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 374 transitions, 4146 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-12-06 05:37:39,014 INFO L231 Difference]: Finished difference. Result has 123 places, 196 transitions, 2902 flow [2022-12-06 05:37:39,014 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=2902, PETRI_PLACES=123, PETRI_TRANSITIONS=196} [2022-12-06 05:37:39,014 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 94 predicate places. [2022-12-06 05:37:39,015 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:39,015 INFO L89 Accepts]: Start accepts. Operand has 123 places, 196 transitions, 2902 flow [2022-12-06 05:37:39,016 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:39,016 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:39,016 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 196 transitions, 2902 flow [2022-12-06 05:37:39,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 196 transitions, 2902 flow [2022-12-06 05:37:39,072 INFO L130 PetriNetUnfolder]: 262/734 cut-off events. [2022-12-06 05:37:39,073 INFO L131 PetriNetUnfolder]: For 7649/7777 co-relation queries the response was YES. [2022-12-06 05:37:39,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4468 conditions, 734 events. 262/734 cut-off events. For 7649/7777 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4995 event pairs, 10 based on Foata normal form. 14/703 useless extension candidates. Maximal degree in co-relation 4399. Up to 182 conditions per place. [2022-12-06 05:37:39,078 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 196 transitions, 2902 flow [2022-12-06 05:37:39,079 INFO L188 LiptonReduction]: Number of co-enabled transitions 964 [2022-12-06 05:37:39,250 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:37:39,308 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [581] $Ultimate##0-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_35| 0) (= |v_thread2Thread1of1ForFork0_~x~1#1_33| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_35|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_~x~1#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:37:39,334 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [660] L67-5-->thread2EXIT: Formula: (let ((.cse0 (mod v_~A~0_224 4294967296))) (and (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_143| v_~B~0_110) |v_thread2Thread1of1ForFork0_~x~1#1_142|) (= |v_thread2Thread1of1ForFork0_#res#1.offset_95| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_134| 4294967296) .cse0)) (not (= (ite (and (<= 0 v_~end~0_484) (< v_~end~0_484 v_~n~0_270)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_105| (ite (= (mod (select (select |v_#memory_int_438| v_~queue~0.base_262) (+ (* v_~end~0_484 4) v_~queue~0.offset_262)) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_142| 4294967296)) 1 0)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_135| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_105|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_105| 0)) (= v_~end~0_483 (+ v_~end~0_484 1)) (= |v_thread2Thread1of1ForFork0_#res#1.base_95| 0) (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_135| 1) |v_thread2Thread1of1ForFork0_~i~1#1_134|))) InVars {~queue~0.offset=v_~queue~0.offset_262, ~A~0=v_~A~0_224, ~B~0=v_~B~0_110, #memory_int=|v_#memory_int_438|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_135|, ~end~0=v_~end~0_484, ~queue~0.base=v_~queue~0.base_262, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_143|, ~n~0=v_~n~0_270} OutVars{~queue~0.offset=v_~queue~0.offset_262, ~A~0=v_~A~0_224, ~B~0=v_~B~0_110, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_95|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_105|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_134|, ~queue~0.base=v_~queue~0.base_262, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_105|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_95|, #memory_int=|v_#memory_int_438|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_105|, ~end~0=v_~end~0_483, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_142|, ~n~0=v_~n~0_270, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_27|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_105|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_~x~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:37:39,629 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [662] $Ultimate##0-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_142| 1) (< 0 (mod v_~A~0_228 4294967296)) (= |v_thread2Thread1of1ForFork0_~x~1#1_150| v_~B~0_114)) InVars {~A~0=v_~A~0_228, ~B~0=v_~B~0_114} OutVars{~A~0=v_~A~0_228, ~B~0=v_~B~0_114, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_142|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_31|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_150|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:37:39,700 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [666] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse0 (mod v_~A~0_234 4294967296))) (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_99| 0) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_164| 4294967296) (mod (select (select |v_#memory_int_452| v_~queue~0.base_266) (+ (* v_~end~0_492 4) v_~queue~0.offset_266)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_109|) (= |v_thread2Thread1of1ForFork0_#res#1.base_99| 0) (= |v_thread2Thread1of1ForFork0_~i~1#1_156| 1) (< 0 .cse0) (not (= (ite (and (< v_~end~0_492 v_~n~0_274) (<= 0 v_~end~0_492)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~x~1#1_164| v_~B~0_120) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_109| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_109|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_156| 4294967296) .cse0)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_109| 0)) (= v_~end~0_491 (+ v_~end~0_492 1)))) InVars {~queue~0.offset=v_~queue~0.offset_266, ~A~0=v_~A~0_234, ~B~0=v_~B~0_120, #memory_int=|v_#memory_int_452|, ~end~0=v_~end~0_492, ~queue~0.base=v_~queue~0.base_266, ~n~0=v_~n~0_274} OutVars{~queue~0.offset=v_~queue~0.offset_266, ~A~0=v_~A~0_234, ~B~0=v_~B~0_120, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_99|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_109|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_156|, ~queue~0.base=v_~queue~0.base_266, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_109|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_99|, #memory_int=|v_#memory_int_452|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_109|, ~end~0=v_~end~0_491, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_164|, ~n~0=v_~n~0_274, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_39|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_109|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_~x~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:37:39,893 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [631] $Ultimate##0-->L51-5: Formula: (and (< 0 (mod v_~A~0_156 4294967296)) (= |v_thread1Thread1of1ForFork2_~i~0#1_106| 1) (= |v_thread1Thread1of1ForFork2_~x~0#1_111| v_~B~0_82)) InVars {~A~0=v_~A~0_156, ~B~0=v_~B~0_82} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_38|, ~A~0=v_~A~0_156, ~B~0=v_~B~0_82, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_111|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_106|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [601] L102-4-->L103-3: Formula: (and (= (store |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre16#1_29|)) |v_#memory_int_148|) (= |v_#pthreadsForks_52| (+ |v_#pthreadsForks_53| 1)) (= |v_ULTIMATE.start_main_#t~pre16#1_29| |v_#pthreadsForks_53|)) InVars {#pthreadsForks=|v_#pthreadsForks_53|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_41|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_148|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_29|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_23|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre14#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet15#1] [2022-12-06 05:37:40,056 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 05:37:40,057 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1042 [2022-12-06 05:37:40,057 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 190 transitions, 2972 flow [2022-12-06 05:37:40,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 27 states have internal predecessors, (53), 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 05:37:40,057 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:40,057 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 05:37:40,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 05:37:40,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:37:40,258 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 1 more)] === [2022-12-06 05:37:40,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:40,258 INFO L85 PathProgramCache]: Analyzing trace with hash 789339988, now seen corresponding path program 1 times [2022-12-06 05:37:40,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:40,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396582807] [2022-12-06 05:37:40,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:40,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:40,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:40,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:40,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396582807] [2022-12-06 05:37:40,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396582807] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:37:40,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989465747] [2022-12-06 05:37:40,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:40,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:37:40,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:37:40,954 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:37:40,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 05:37:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:41,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-06 05:37:41,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:37:41,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:37:41,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2022-12-06 05:37:41,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:37:41,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2022-12-06 05:37:41,334 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:41,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 56 [2022-12-06 05:37:41,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:41,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:37:41,666 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_~start~0 4))) (let ((.cse1 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse2 (mod c_~B~0 4294967296)) (.cse6 (+ .cse10 c_~queue~0.offset)) (.cse5 (+ .cse10 c_~queue~0.offset 4))) (and (forall ((v_ArrVal_885 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_885) c_~queue~0.base))) (or (not (= (mod (select .cse0 .cse1) 4294967296) .cse2)) (let ((.cse4 (select .cse0 .cse6)) (.cse3 (select .cse0 .cse5))) (< (+ .cse3 (* 4294967296 (div .cse4 4294967296))) (+ .cse4 (* (div .cse3 4294967296) 4294967296) 1)))))) (forall ((v_ArrVal_885 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_885) c_~queue~0.base))) (or (not (= (mod (select .cse7 .cse1) 4294967296) .cse2)) (let ((.cse9 (select .cse7 .cse5)) (.cse8 (select .cse7 .cse6))) (<= (+ .cse8 (* (div .cse9 4294967296) 4294967296)) (+ .cse9 (* 4294967296 (div .cse8 4294967296))))))))))) is different from false [2022-12-06 05:37:41,702 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_~start~0 4))) (let ((.cse6 (+ .cse10 c_~queue~0.offset 4)) (.cse5 (+ .cse10 c_~queue~0.offset)) (.cse1 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse2 (mod c_~B~0 4294967296))) (and (forall ((v_ArrVal_885 (Array Int Int)) (v_ArrVal_884 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_884) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_885) c_~queue~0.base))) (or (not (= (mod (select .cse0 .cse1) 4294967296) .cse2)) (let ((.cse4 (select .cse0 .cse6)) (.cse3 (select .cse0 .cse5))) (<= (+ .cse3 (* (div .cse4 4294967296) 4294967296)) (+ .cse4 (* (div .cse3 4294967296) 4294967296))))))) (forall ((v_ArrVal_885 (Array Int Int)) (v_ArrVal_884 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_884) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_885) c_~queue~0.base))) (or (let ((.cse8 (select .cse9 .cse5)) (.cse7 (select .cse9 .cse6))) (< (+ .cse7 (* (div .cse8 4294967296) 4294967296)) (+ .cse8 (* (div .cse7 4294967296) 4294967296) 1))) (not (= (mod (select .cse9 .cse1) 4294967296) .cse2)))))))) is different from false [2022-12-06 05:37:41,749 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:41,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 680 treesize of output 582 [2022-12-06 05:37:41,786 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:41,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 354 treesize of output 314 [2022-12-06 05:37:41,807 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:37:41,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 464 treesize of output 358 [2022-12-06 05:37:42,608 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 05:37:42,609 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 05:37:42,614 INFO L321 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-12-06 05:37:42,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 1 [2022-12-06 05:37:42,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:42,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989465747] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:37:42,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:37:42,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2022-12-06 05:37:42,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511217299] [2022-12-06 05:37:42,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:37:42,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 05:37:42,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:42,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 05:37:42,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=321, Unknown=2, NotChecked=74, Total=462 [2022-12-06 05:37:42,643 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 05:37:42,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 190 transitions, 2972 flow. Second operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 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 05:37:42,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:42,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 05:37:42,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:43,722 INFO L130 PetriNetUnfolder]: 1112/1915 cut-off events. [2022-12-06 05:37:43,723 INFO L131 PetriNetUnfolder]: For 28354/28354 co-relation queries the response was YES. [2022-12-06 05:37:43,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13961 conditions, 1915 events. 1112/1915 cut-off events. For 28354/28354 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 10017 event pairs, 292 based on Foata normal form. 1/1914 useless extension candidates. Maximal degree in co-relation 13882. Up to 1317 conditions per place. [2022-12-06 05:37:43,735 INFO L137 encePairwiseOnDemand]: 28/42 looper letters, 180 selfloop transitions, 55 changer transitions 13/248 dead transitions. [2022-12-06 05:37:43,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 248 transitions, 3920 flow [2022-12-06 05:37:43,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:37:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:37:43,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 98 transitions. [2022-12-06 05:37:43,737 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23333333333333334 [2022-12-06 05:37:43,737 INFO L175 Difference]: Start difference. First operand has 115 places, 190 transitions, 2972 flow. Second operand 10 states and 98 transitions. [2022-12-06 05:37:43,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 248 transitions, 3920 flow [2022-12-06 05:37:43,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 248 transitions, 3288 flow, removed 306 selfloop flow, removed 9 redundant places. [2022-12-06 05:37:43,790 INFO L231 Difference]: Finished difference. Result has 121 places, 200 transitions, 2730 flow [2022-12-06 05:37:43,790 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2450, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2730, PETRI_PLACES=121, PETRI_TRANSITIONS=200} [2022-12-06 05:37:43,790 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 92 predicate places. [2022-12-06 05:37:43,790 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:43,790 INFO L89 Accepts]: Start accepts. Operand has 121 places, 200 transitions, 2730 flow [2022-12-06 05:37:43,791 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:43,791 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:43,791 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 200 transitions, 2730 flow [2022-12-06 05:37:43,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 200 transitions, 2730 flow [2022-12-06 05:37:43,849 INFO L130 PetriNetUnfolder]: 266/745 cut-off events. [2022-12-06 05:37:43,849 INFO L131 PetriNetUnfolder]: For 7354/7456 co-relation queries the response was YES. [2022-12-06 05:37:43,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4124 conditions, 745 events. 266/745 cut-off events. For 7354/7456 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5083 event pairs, 15 based on Foata normal form. 16/732 useless extension candidates. Maximal degree in co-relation 4065. Up to 143 conditions per place. [2022-12-06 05:37:43,856 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 200 transitions, 2730 flow [2022-12-06 05:37:43,856 INFO L188 LiptonReduction]: Number of co-enabled transitions 978 [2022-12-06 05:37:43,880 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:37:45,883 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:37:45,884 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2094 [2022-12-06 05:37:45,884 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 198 transitions, 2765 flow [2022-12-06 05:37:45,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 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 05:37:45,884 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:45,884 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:45,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 05:37:46,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-06 05:37:46,085 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 1 more)] === [2022-12-06 05:37:46,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:46,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1517729692, now seen corresponding path program 1 times [2022-12-06 05:37:46,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:46,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826868944] [2022-12-06 05:37:46,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:46,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:46,930 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 05:37:46,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:46,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826868944] [2022-12-06 05:37:46,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826868944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:46,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:46,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:37:46,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517339426] [2022-12-06 05:37:46,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:46,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:37:46,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:46,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:37:46,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:37:46,932 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 05:37:46,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 198 transitions, 2765 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:46,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:46,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 05:37:46,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:47,562 INFO L130 PetriNetUnfolder]: 1127/1947 cut-off events. [2022-12-06 05:37:47,562 INFO L131 PetriNetUnfolder]: For 26170/26170 co-relation queries the response was YES. [2022-12-06 05:37:47,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12950 conditions, 1947 events. 1127/1947 cut-off events. For 26170/26170 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 10365 event pairs, 252 based on Foata normal form. 1/1947 useless extension candidates. Maximal degree in co-relation 12881. Up to 1240 conditions per place. [2022-12-06 05:37:47,574 INFO L137 encePairwiseOnDemand]: 28/46 looper letters, 175 selfloop transitions, 63 changer transitions 15/253 dead transitions. [2022-12-06 05:37:47,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 253 transitions, 3740 flow [2022-12-06 05:37:47,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:37:47,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:37:47,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2022-12-06 05:37:47,592 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2826086956521739 [2022-12-06 05:37:47,592 INFO L175 Difference]: Start difference. First operand has 118 places, 198 transitions, 2765 flow. Second operand 7 states and 91 transitions. [2022-12-06 05:37:47,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 253 transitions, 3740 flow [2022-12-06 05:37:47,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 253 transitions, 3600 flow, removed 50 selfloop flow, removed 5 redundant places. [2022-12-06 05:37:47,636 INFO L231 Difference]: Finished difference. Result has 123 places, 200 transitions, 2836 flow [2022-12-06 05:37:47,636 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2627, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2836, PETRI_PLACES=123, PETRI_TRANSITIONS=200} [2022-12-06 05:37:47,636 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 94 predicate places. [2022-12-06 05:37:47,636 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:47,636 INFO L89 Accepts]: Start accepts. Operand has 123 places, 200 transitions, 2836 flow [2022-12-06 05:37:47,637 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:47,637 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:47,637 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 200 transitions, 2836 flow [2022-12-06 05:37:47,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 200 transitions, 2836 flow [2022-12-06 05:37:47,696 INFO L130 PetriNetUnfolder]: 273/761 cut-off events. [2022-12-06 05:37:47,696 INFO L131 PetriNetUnfolder]: For 7888/8012 co-relation queries the response was YES. [2022-12-06 05:37:47,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4438 conditions, 761 events. 273/761 cut-off events. For 7888/8012 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5256 event pairs, 14 based on Foata normal form. 15/736 useless extension candidates. Maximal degree in co-relation 4378. Up to 145 conditions per place. [2022-12-06 05:37:47,702 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 200 transitions, 2836 flow [2022-12-06 05:37:47,702 INFO L188 LiptonReduction]: Number of co-enabled transitions 970 [2022-12-06 05:37:47,703 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:47,703 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-06 05:37:47,703 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 200 transitions, 2836 flow [2022-12-06 05:37:47,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:47,704 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:47,704 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:47,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 05:37:47,704 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 1 more)] === [2022-12-06 05:37:47,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:47,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1089054288, now seen corresponding path program 1 times [2022-12-06 05:37:47,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:47,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3819986] [2022-12-06 05:37:47,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:47,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:49,378 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 05:37:49,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:49,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3819986] [2022-12-06 05:37:49,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3819986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:49,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:49,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:37:49,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001770717] [2022-12-06 05:37:49,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:49,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:37:49,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:49,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:37:49,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:37:49,379 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 05:37:49,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 200 transitions, 2836 flow. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:49,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:49,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 05:37:49,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:49,983 INFO L130 PetriNetUnfolder]: 1121/1935 cut-off events. [2022-12-06 05:37:49,984 INFO L131 PetriNetUnfolder]: For 26113/26113 co-relation queries the response was YES. [2022-12-06 05:37:49,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13211 conditions, 1935 events. 1121/1935 cut-off events. For 26113/26113 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10266 event pairs, 298 based on Foata normal form. 1/1935 useless extension candidates. Maximal degree in co-relation 13140. Up to 1481 conditions per place. [2022-12-06 05:37:50,010 INFO L137 encePairwiseOnDemand]: 34/44 looper letters, 177 selfloop transitions, 39 changer transitions 14/230 dead transitions. [2022-12-06 05:37:50,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 230 transitions, 3448 flow [2022-12-06 05:37:50,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:37:50,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:37:50,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-12-06 05:37:50,013 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29545454545454547 [2022-12-06 05:37:50,013 INFO L175 Difference]: Start difference. First operand has 120 places, 200 transitions, 2836 flow. Second operand 6 states and 78 transitions. [2022-12-06 05:37:50,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 230 transitions, 3448 flow [2022-12-06 05:37:50,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 230 transitions, 3399 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 05:37:50,055 INFO L231 Difference]: Finished difference. Result has 123 places, 199 transitions, 2854 flow [2022-12-06 05:37:50,056 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2793, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2854, PETRI_PLACES=123, PETRI_TRANSITIONS=199} [2022-12-06 05:37:50,056 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 94 predicate places. [2022-12-06 05:37:50,056 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:50,056 INFO L89 Accepts]: Start accepts. Operand has 123 places, 199 transitions, 2854 flow [2022-12-06 05:37:50,057 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:50,059 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:50,060 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 199 transitions, 2854 flow [2022-12-06 05:37:50,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 199 transitions, 2854 flow [2022-12-06 05:37:50,136 INFO L130 PetriNetUnfolder]: 272/760 cut-off events. [2022-12-06 05:37:50,136 INFO L131 PetriNetUnfolder]: For 8719/8843 co-relation queries the response was YES. [2022-12-06 05:37:50,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4419 conditions, 760 events. 272/760 cut-off events. For 8719/8843 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5273 event pairs, 14 based on Foata normal form. 15/735 useless extension candidates. Maximal degree in co-relation 4363. Up to 144 conditions per place. [2022-12-06 05:37:50,143 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 199 transitions, 2854 flow [2022-12-06 05:37:50,143 INFO L188 LiptonReduction]: Number of co-enabled transitions 970 [2022-12-06 05:37:50,144 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:50,144 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 05:37:50,144 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 199 transitions, 2854 flow [2022-12-06 05:37:50,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:50,144 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:50,144 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:50,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-06 05:37:50,145 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 1 more)] === [2022-12-06 05:37:50,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:50,145 INFO L85 PathProgramCache]: Analyzing trace with hash -81484047, now seen corresponding path program 1 times [2022-12-06 05:37:50,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:50,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294005949] [2022-12-06 05:37:50,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:50,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:50,854 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 05:37:50,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:50,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294005949] [2022-12-06 05:37:50,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294005949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:50,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:50,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:37:50,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108693087] [2022-12-06 05:37:50,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:50,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:37:50,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:50,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:37:50,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:37:50,856 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 05:37:50,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 199 transitions, 2854 flow. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:50,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:50,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 05:37:50,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:51,616 INFO L130 PetriNetUnfolder]: 1143/2008 cut-off events. [2022-12-06 05:37:51,616 INFO L131 PetriNetUnfolder]: For 27297/27297 co-relation queries the response was YES. [2022-12-06 05:37:51,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13412 conditions, 2008 events. 1143/2008 cut-off events. For 27297/27297 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 10917 event pairs, 297 based on Foata normal form. 1/2008 useless extension candidates. Maximal degree in co-relation 13333. Up to 1107 conditions per place. [2022-12-06 05:37:51,627 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 211 selfloop transitions, 37 changer transitions 14/262 dead transitions. [2022-12-06 05:37:51,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 262 transitions, 3818 flow [2022-12-06 05:37:51,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:37:51,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:37:51,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2022-12-06 05:37:51,628 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3081395348837209 [2022-12-06 05:37:51,628 INFO L175 Difference]: Start difference. First operand has 121 places, 199 transitions, 2854 flow. Second operand 8 states and 106 transitions. [2022-12-06 05:37:51,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 262 transitions, 3818 flow [2022-12-06 05:37:51,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 262 transitions, 3732 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-06 05:37:51,662 INFO L231 Difference]: Finished difference. Result has 127 places, 204 transitions, 2991 flow [2022-12-06 05:37:51,662 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2772, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2991, PETRI_PLACES=127, PETRI_TRANSITIONS=204} [2022-12-06 05:37:51,662 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 98 predicate places. [2022-12-06 05:37:51,662 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:51,662 INFO L89 Accepts]: Start accepts. Operand has 127 places, 204 transitions, 2991 flow [2022-12-06 05:37:51,663 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:51,663 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:51,663 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 204 transitions, 2991 flow [2022-12-06 05:37:51,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 204 transitions, 2991 flow [2022-12-06 05:37:51,728 INFO L130 PetriNetUnfolder]: 271/789 cut-off events. [2022-12-06 05:37:51,728 INFO L131 PetriNetUnfolder]: For 8811/8935 co-relation queries the response was YES. [2022-12-06 05:37:51,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4533 conditions, 789 events. 271/789 cut-off events. For 8811/8935 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5612 event pairs, 14 based on Foata normal form. 15/764 useless extension candidates. Maximal degree in co-relation 4465. Up to 147 conditions per place. [2022-12-06 05:37:51,735 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 204 transitions, 2991 flow [2022-12-06 05:37:51,735 INFO L188 LiptonReduction]: Number of co-enabled transitions 1000 [2022-12-06 05:37:51,736 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:51,737 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 05:37:51,737 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 204 transitions, 2991 flow [2022-12-06 05:37:51,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:51,737 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:51,744 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:51,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-06 05:37:51,744 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 1 more)] === [2022-12-06 05:37:51,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:51,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1603552039, now seen corresponding path program 1 times [2022-12-06 05:37:51,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:51,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506542548] [2022-12-06 05:37:51,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:51,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:52,798 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 05:37:52,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:52,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506542548] [2022-12-06 05:37:52,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506542548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:52,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:52,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:37:52,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703361500] [2022-12-06 05:37:52,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:52,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:37:52,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:52,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:37:52,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:37:52,799 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 05:37:52,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 204 transitions, 2991 flow. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:52,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:52,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 05:37:52,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:53,697 INFO L130 PetriNetUnfolder]: 1151/2021 cut-off events. [2022-12-06 05:37:53,697 INFO L131 PetriNetUnfolder]: For 28332/28332 co-relation queries the response was YES. [2022-12-06 05:37:53,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13673 conditions, 2021 events. 1151/2021 cut-off events. For 28332/28332 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 11022 event pairs, 264 based on Foata normal form. 1/2021 useless extension candidates. Maximal degree in co-relation 13592. Up to 1172 conditions per place. [2022-12-06 05:37:53,719 INFO L137 encePairwiseOnDemand]: 23/42 looper letters, 179 selfloop transitions, 73 changer transitions 14/266 dead transitions. [2022-12-06 05:37:53,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 266 transitions, 3993 flow [2022-12-06 05:37:53,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:37:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:37:53,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2022-12-06 05:37:53,721 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26455026455026454 [2022-12-06 05:37:53,721 INFO L175 Difference]: Start difference. First operand has 125 places, 204 transitions, 2991 flow. Second operand 9 states and 100 transitions. [2022-12-06 05:37:53,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 266 transitions, 3993 flow [2022-12-06 05:37:53,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 266 transitions, 3970 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-06 05:37:53,765 INFO L231 Difference]: Finished difference. Result has 134 places, 205 transitions, 3134 flow [2022-12-06 05:37:53,765 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2972, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3134, PETRI_PLACES=134, PETRI_TRANSITIONS=205} [2022-12-06 05:37:53,765 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 105 predicate places. [2022-12-06 05:37:53,765 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:53,765 INFO L89 Accepts]: Start accepts. Operand has 134 places, 205 transitions, 3134 flow [2022-12-06 05:37:53,766 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:53,766 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:53,766 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 205 transitions, 3134 flow [2022-12-06 05:37:53,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 205 transitions, 3134 flow [2022-12-06 05:37:53,831 INFO L130 PetriNetUnfolder]: 271/790 cut-off events. [2022-12-06 05:37:53,832 INFO L131 PetriNetUnfolder]: For 9639/9762 co-relation queries the response was YES. [2022-12-06 05:37:53,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4719 conditions, 790 events. 271/790 cut-off events. For 9639/9762 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 5632 event pairs, 14 based on Foata normal form. 14/764 useless extension candidates. Maximal degree in co-relation 4659. Up to 147 conditions per place. [2022-12-06 05:37:53,839 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 205 transitions, 3134 flow [2022-12-06 05:37:53,839 INFO L188 LiptonReduction]: Number of co-enabled transitions 1008 [2022-12-06 05:37:53,843 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [667] $Ultimate##0-->L104-3: Formula: (and (= (+ |v_#pthreadsForks_289| 1) |v_#pthreadsForks_288|) (= (store |v_#memory_int_455| |v_ULTIMATE.start_main_~#t3~0#1.base_170| (store (select |v_#memory_int_455| |v_ULTIMATE.start_main_~#t3~0#1.base_170|) |v_ULTIMATE.start_main_~#t3~0#1.offset_152| |v_ULTIMATE.start_main_#t~pre18#1_150|)) |v_#memory_int_454|) (= |v_thread2Thread1of1ForFork0_~i~1#1_158| 1) (= |v_ULTIMATE.start_main_#t~pre18#1_150| |v_#pthreadsForks_289|) (< 0 (mod v_~A~0_236 4294967296)) (= |v_thread2Thread1of1ForFork0_~x~1#1_166| v_~B~0_122)) InVars {~A~0=v_~A~0_236, #pthreadsForks=|v_#pthreadsForks_289|, ~B~0=v_~B~0_122, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_152|, #memory_int=|v_#memory_int_455|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_170|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_150|, ~A~0=v_~A~0_236, #pthreadsForks=|v_#pthreadsForks_288|, ~B~0=v_~B~0_122, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_152|, #memory_int=|v_#memory_int_454|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_170|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_158|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_158|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_137|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_41|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_166|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread2Thread1of1ForFork0_~i~1#1, ULTIMATE.start_main_#t~nondet17#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 05:37:53,910 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:53,911 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-06 05:37:53,911 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 204 transitions, 3128 flow [2022-12-06 05:37:53,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:53,911 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:53,911 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:53,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-06 05:37:53,911 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 1 more)] === [2022-12-06 05:37:53,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:53,911 INFO L85 PathProgramCache]: Analyzing trace with hash -761164094, now seen corresponding path program 1 times [2022-12-06 05:37:53,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:53,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517602921] [2022-12-06 05:37:53,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:53,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:53,994 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 05:37:53,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:53,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517602921] [2022-12-06 05:37:53,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517602921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:53,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:53,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:37:53,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609169196] [2022-12-06 05:37:53,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:53,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:37:53,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:53,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:37:53,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:37:53,995 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 05:37:53,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 204 transitions, 3128 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:53,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:53,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 05:37:53,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:54,382 INFO L130 PetriNetUnfolder]: 1206/2236 cut-off events. [2022-12-06 05:37:54,382 INFO L131 PetriNetUnfolder]: For 31025/31025 co-relation queries the response was YES. [2022-12-06 05:37:54,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14865 conditions, 2236 events. 1206/2236 cut-off events. For 31025/31025 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13113 event pairs, 377 based on Foata normal form. 19/2254 useless extension candidates. Maximal degree in co-relation 14755. Up to 1333 conditions per place. [2022-12-06 05:37:54,394 INFO L137 encePairwiseOnDemand]: 26/42 looper letters, 197 selfloop transitions, 56 changer transitions 2/255 dead transitions. [2022-12-06 05:37:54,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 255 transitions, 4146 flow [2022-12-06 05:37:54,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:37:54,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:37:54,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-06 05:37:54,395 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39880952380952384 [2022-12-06 05:37:54,395 INFO L175 Difference]: Start difference. First operand has 131 places, 204 transitions, 3128 flow. Second operand 4 states and 67 transitions. [2022-12-06 05:37:54,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 255 transitions, 4146 flow [2022-12-06 05:37:54,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 255 transitions, 4015 flow, removed 7 selfloop flow, removed 7 redundant places. [2022-12-06 05:37:54,436 INFO L231 Difference]: Finished difference. Result has 128 places, 206 transitions, 3205 flow [2022-12-06 05:37:54,436 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2935, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3205, PETRI_PLACES=128, PETRI_TRANSITIONS=206} [2022-12-06 05:37:54,437 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 99 predicate places. [2022-12-06 05:37:54,437 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:54,437 INFO L89 Accepts]: Start accepts. Operand has 128 places, 206 transitions, 3205 flow [2022-12-06 05:37:54,438 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:54,438 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:54,438 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 206 transitions, 3205 flow [2022-12-06 05:37:54,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 206 transitions, 3205 flow [2022-12-06 05:37:54,506 INFO L130 PetriNetUnfolder]: 265/874 cut-off events. [2022-12-06 05:37:54,506 INFO L131 PetriNetUnfolder]: For 10235/10351 co-relation queries the response was YES. [2022-12-06 05:37:54,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4951 conditions, 874 events. 265/874 cut-off events. For 10235/10351 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6705 event pairs, 15 based on Foata normal form. 13/847 useless extension candidates. Maximal degree in co-relation 4818. Up to 149 conditions per place. [2022-12-06 05:37:54,513 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 206 transitions, 3205 flow [2022-12-06 05:37:54,513 INFO L188 LiptonReduction]: Number of co-enabled transitions 1002 [2022-12-06 05:37:54,514 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:54,514 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 05:37:54,514 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 206 transitions, 3205 flow [2022-12-06 05:37:54,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:54,514 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:54,514 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 05:37:54,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-06 05:37:54,514 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 1 more)] === [2022-12-06 05:37:54,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:54,515 INFO L85 PathProgramCache]: Analyzing trace with hash -2119671448, now seen corresponding path program 1 times [2022-12-06 05:37:54,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:54,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210792273] [2022-12-06 05:37:54,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:54,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:55,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:55,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210792273] [2022-12-06 05:37:55,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210792273] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:37:55,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161527788] [2022-12-06 05:37:55,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:55,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:37:55,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:37:55,290 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:37:55,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 05:37:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:55,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-06 05:37:55,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:37:55,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-12-06 05:37:55,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:37:55,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:37:55,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:37:55,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-06 05:37:55,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:55,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:37:56,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:56,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161527788] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:37:56,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:37:56,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-06 05:37:56,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986500311] [2022-12-06 05:37:56,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:37:56,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 05:37:56,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:56,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 05:37:56,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=517, Unknown=6, NotChecked=0, Total=650 [2022-12-06 05:37:56,180 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:37:56,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 206 transitions, 3205 flow. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 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 05:37:56,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:56,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:37:56,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:58,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:38:01,989 INFO L130 PetriNetUnfolder]: 1279/2385 cut-off events. [2022-12-06 05:38:01,989 INFO L131 PetriNetUnfolder]: For 33216/33216 co-relation queries the response was YES. [2022-12-06 05:38:01,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15757 conditions, 2385 events. 1279/2385 cut-off events. For 33216/33216 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 14199 event pairs, 182 based on Foata normal form. 1/2385 useless extension candidates. Maximal degree in co-relation 15255. Up to 844 conditions per place. [2022-12-06 05:38:02,003 INFO L137 encePairwiseOnDemand]: 13/37 looper letters, 230 selfloop transitions, 136 changer transitions 14/380 dead transitions. [2022-12-06 05:38:02,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 380 transitions, 5554 flow [2022-12-06 05:38:02,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 05:38:02,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 05:38:02,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 198 transitions. [2022-12-06 05:38:02,008 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23266745005875442 [2022-12-06 05:38:02,009 INFO L175 Difference]: Start difference. First operand has 127 places, 206 transitions, 3205 flow. Second operand 23 states and 198 transitions. [2022-12-06 05:38:02,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 380 transitions, 5554 flow [2022-12-06 05:38:02,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 380 transitions, 5481 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-12-06 05:38:02,061 INFO L231 Difference]: Finished difference. Result has 156 places, 244 transitions, 4183 flow [2022-12-06 05:38:02,061 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3150, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=4183, PETRI_PLACES=156, PETRI_TRANSITIONS=244} [2022-12-06 05:38:02,062 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 127 predicate places. [2022-12-06 05:38:02,062 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:02,062 INFO L89 Accepts]: Start accepts. Operand has 156 places, 244 transitions, 4183 flow [2022-12-06 05:38:02,072 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:02,072 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:02,072 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 244 transitions, 4183 flow [2022-12-06 05:38:02,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 244 transitions, 4183 flow [2022-12-06 05:38:02,164 INFO L130 PetriNetUnfolder]: 291/946 cut-off events. [2022-12-06 05:38:02,164 INFO L131 PetriNetUnfolder]: For 12402/12551 co-relation queries the response was YES. [2022-12-06 05:38:02,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5699 conditions, 946 events. 291/946 cut-off events. For 12402/12551 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7243 event pairs, 9 based on Foata normal form. 11/934 useless extension candidates. Maximal degree in co-relation 5631. Up to 164 conditions per place. [2022-12-06 05:38:02,173 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 244 transitions, 4183 flow [2022-12-06 05:38:02,173 INFO L188 LiptonReduction]: Number of co-enabled transitions 1098 [2022-12-06 05:38:02,233 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [661] L67-5-->L104-3: Formula: (and (= (store |v_#memory_int_441| |v_ULTIMATE.start_main_~#t3~0#1.base_164| (store (select |v_#memory_int_441| |v_ULTIMATE.start_main_~#t3~0#1.base_164|) |v_ULTIMATE.start_main_~#t3~0#1.offset_146| |v_ULTIMATE.start_main_#t~pre18#1_144|)) |v_#memory_int_440|) (= |v_thread2Thread1of1ForFork0_~i~1#1_138| (+ |v_thread2Thread1of1ForFork0_~i~1#1_139| 1)) (= |v_thread2Thread1of1ForFork0_~x~1#1_146| (+ |v_thread2Thread1of1ForFork0_~x~1#1_147| v_~B~0_112)) (= (+ |v_#pthreadsForks_277| 1) |v_#pthreadsForks_276|) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_139| 4294967296) (mod v_~A~0_226 4294967296)) (= |v_ULTIMATE.start_main_#t~pre18#1_144| |v_#pthreadsForks_277|)) InVars {~A~0=v_~A~0_226, #pthreadsForks=|v_#pthreadsForks_277|, ~B~0=v_~B~0_112, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_146|, #memory_int=|v_#memory_int_441|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_164|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_139|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_147|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_144|, ~A~0=v_~A~0_226, #pthreadsForks=|v_#pthreadsForks_276|, ~B~0=v_~B~0_112, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_146|, #memory_int=|v_#memory_int_440|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_164|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_152|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_138|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_131|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_29|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_146|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread2Thread1of1ForFork0_~i~1#1, ULTIMATE.start_main_#t~nondet17#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 05:38:02,298 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [581] $Ultimate##0-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_35| 0) (= |v_thread2Thread1of1ForFork0_~x~1#1_33| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_35|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_~x~1#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:38:02,348 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:38:02,348 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 286 [2022-12-06 05:38:02,348 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 242 transitions, 4192 flow [2022-12-06 05:38:02,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 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 05:38:02,348 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:02,348 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 05:38:02,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 05:38:02,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:38:02,549 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 1 more)] === [2022-12-06 05:38:02,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:02,549 INFO L85 PathProgramCache]: Analyzing trace with hash -417163645, now seen corresponding path program 1 times [2022-12-06 05:38:02,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:02,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044945762] [2022-12-06 05:38:02,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:02,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:03,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:03,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044945762] [2022-12-06 05:38:03,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044945762] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:38:03,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628023972] [2022-12-06 05:38:03,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:03,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:38:03,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:38:03,587 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:38:03,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 05:38:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:03,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 05:38:03,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:38:03,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:38:03,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2022-12-06 05:38:03,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:03,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:38:04,205 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 05:38:04,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 86 [2022-12-06 05:38:04,219 INFO L321 Elim1Store]: treesize reduction 23, result has 14.8 percent of original size [2022-12-06 05:38:04,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 42 [2022-12-06 05:38:04,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:04,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628023972] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:38:04,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:38:04,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2022-12-06 05:38:04,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463909631] [2022-12-06 05:38:04,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:38:04,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 05:38:04,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:04,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 05:38:04,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2022-12-06 05:38:04,314 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 05:38:04,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 242 transitions, 4192 flow. Second operand has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 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 05:38:04,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:04,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 05:38:04,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:05,948 INFO L130 PetriNetUnfolder]: 1628/3021 cut-off events. [2022-12-06 05:38:05,949 INFO L131 PetriNetUnfolder]: For 46532/46532 co-relation queries the response was YES. [2022-12-06 05:38:05,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20771 conditions, 3021 events. 1628/3021 cut-off events. For 46532/46532 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 18991 event pairs, 216 based on Foata normal form. 1/3021 useless extension candidates. Maximal degree in co-relation 20646. Up to 572 conditions per place. [2022-12-06 05:38:05,970 INFO L137 encePairwiseOnDemand]: 12/40 looper letters, 222 selfloop transitions, 200 changer transitions 14/436 dead transitions. [2022-12-06 05:38:05,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 436 transitions, 6930 flow [2022-12-06 05:38:05,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 05:38:05,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 05:38:05,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 188 transitions. [2022-12-06 05:38:05,972 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24736842105263157 [2022-12-06 05:38:05,972 INFO L175 Difference]: Start difference. First operand has 152 places, 242 transitions, 4192 flow. Second operand 19 states and 188 transitions. [2022-12-06 05:38:05,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 436 transitions, 6930 flow [2022-12-06 05:38:06,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 436 transitions, 6724 flow, removed 41 selfloop flow, removed 10 redundant places. [2022-12-06 05:38:06,054 INFO L231 Difference]: Finished difference. Result has 171 places, 292 transitions, 5379 flow [2022-12-06 05:38:06,054 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4035, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=5379, PETRI_PLACES=171, PETRI_TRANSITIONS=292} [2022-12-06 05:38:06,054 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 142 predicate places. [2022-12-06 05:38:06,054 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:06,054 INFO L89 Accepts]: Start accepts. Operand has 171 places, 292 transitions, 5379 flow [2022-12-06 05:38:06,056 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:06,056 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:06,056 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 292 transitions, 5379 flow [2022-12-06 05:38:06,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 292 transitions, 5379 flow [2022-12-06 05:38:06,167 INFO L130 PetriNetUnfolder]: 324/1163 cut-off events. [2022-12-06 05:38:06,167 INFO L131 PetriNetUnfolder]: For 17273/17478 co-relation queries the response was YES. [2022-12-06 05:38:06,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7018 conditions, 1163 events. 324/1163 cut-off events. For 17273/17478 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9917 event pairs, 18 based on Foata normal form. 25/1162 useless extension candidates. Maximal degree in co-relation 6916. Up to 200 conditions per place. [2022-12-06 05:38:06,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 292 transitions, 5379 flow [2022-12-06 05:38:06,179 INFO L188 LiptonReduction]: Number of co-enabled transitions 1362 [2022-12-06 05:38:06,180 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:38:06,308 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:38:06,309 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 255 [2022-12-06 05:38:06,309 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 291 transitions, 5375 flow [2022-12-06 05:38:06,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 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 05:38:06,309 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:06,309 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:38:06,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 05:38:06,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-06 05:38:06,513 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 1 more)] === [2022-12-06 05:38:06,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:06,514 INFO L85 PathProgramCache]: Analyzing trace with hash -169166575, now seen corresponding path program 1 times [2022-12-06 05:38:06,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:06,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743771309] [2022-12-06 05:38:06,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:06,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:07,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:07,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:07,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743771309] [2022-12-06 05:38:07,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743771309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:07,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:07,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:38:07,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351938076] [2022-12-06 05:38:07,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:07,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:38:07,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:07,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:38:07,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:38:07,375 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:38:07,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 291 transitions, 5375 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:07,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:07,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:38:07,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:08,462 INFO L130 PetriNetUnfolder]: 1654/3069 cut-off events. [2022-12-06 05:38:08,462 INFO L131 PetriNetUnfolder]: For 57153/57153 co-relation queries the response was YES. [2022-12-06 05:38:08,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22351 conditions, 3069 events. 1654/3069 cut-off events. For 57153/57153 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 19503 event pairs, 479 based on Foata normal form. 1/3070 useless extension candidates. Maximal degree in co-relation 22218. Up to 2130 conditions per place. [2022-12-06 05:38:08,481 INFO L137 encePairwiseOnDemand]: 23/41 looper letters, 253 selfloop transitions, 95 changer transitions 14/362 dead transitions. [2022-12-06 05:38:08,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 362 transitions, 6763 flow [2022-12-06 05:38:08,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:38:08,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:38:08,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2022-12-06 05:38:08,482 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26558265582655827 [2022-12-06 05:38:08,482 INFO L175 Difference]: Start difference. First operand has 169 places, 291 transitions, 5375 flow. Second operand 9 states and 98 transitions. [2022-12-06 05:38:08,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 362 transitions, 6763 flow [2022-12-06 05:38:08,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 362 transitions, 6407 flow, removed 99 selfloop flow, removed 6 redundant places. [2022-12-06 05:38:08,606 INFO L231 Difference]: Finished difference. Result has 175 places, 296 transitions, 5347 flow [2022-12-06 05:38:08,607 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5039, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5347, PETRI_PLACES=175, PETRI_TRANSITIONS=296} [2022-12-06 05:38:08,607 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 146 predicate places. [2022-12-06 05:38:08,607 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:08,607 INFO L89 Accepts]: Start accepts. Operand has 175 places, 296 transitions, 5347 flow [2022-12-06 05:38:08,608 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:08,608 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:08,608 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 296 transitions, 5347 flow [2022-12-06 05:38:08,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 296 transitions, 5347 flow [2022-12-06 05:38:08,718 INFO L130 PetriNetUnfolder]: 338/1192 cut-off events. [2022-12-06 05:38:08,718 INFO L131 PetriNetUnfolder]: For 17064/17309 co-relation queries the response was YES. [2022-12-06 05:38:08,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7172 conditions, 1192 events. 338/1192 cut-off events. For 17064/17309 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 10174 event pairs, 16 based on Foata normal form. 21/1180 useless extension candidates. Maximal degree in co-relation 7093. Up to 208 conditions per place. [2022-12-06 05:38:08,729 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 296 transitions, 5347 flow [2022-12-06 05:38:08,729 INFO L188 LiptonReduction]: Number of co-enabled transitions 1390 [2022-12-06 05:38:08,839 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:38:08,840 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 233 [2022-12-06 05:38:08,840 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 294 transitions, 5339 flow [2022-12-06 05:38:08,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:08,840 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:08,840 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 05:38:08,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-06 05:38:08,840 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 1 more)] === [2022-12-06 05:38:08,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:08,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1485169976, now seen corresponding path program 1 times [2022-12-06 05:38:08,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:08,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434760252] [2022-12-06 05:38:08,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:08,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:08,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:08,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:08,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434760252] [2022-12-06 05:38:08,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434760252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:08,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:08,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:38:08,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273763338] [2022-12-06 05:38:08,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:08,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:38:08,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:08,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:38:08,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:38:08,934 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:38:08,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 294 transitions, 5339 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:08,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:08,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:38:08,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:09,507 INFO L130 PetriNetUnfolder]: 1628/3018 cut-off events. [2022-12-06 05:38:09,507 INFO L131 PetriNetUnfolder]: For 55461/55461 co-relation queries the response was YES. [2022-12-06 05:38:09,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21678 conditions, 3018 events. 1628/3018 cut-off events. For 55461/55461 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 18833 event pairs, 461 based on Foata normal form. 12/3030 useless extension candidates. Maximal degree in co-relation 21616. Up to 1897 conditions per place. [2022-12-06 05:38:09,527 INFO L137 encePairwiseOnDemand]: 22/41 looper letters, 251 selfloop transitions, 87 changer transitions 9/347 dead transitions. [2022-12-06 05:38:09,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 347 transitions, 6525 flow [2022-12-06 05:38:09,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:38:09,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:38:09,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-06 05:38:09,529 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35121951219512193 [2022-12-06 05:38:09,529 INFO L175 Difference]: Start difference. First operand has 171 places, 294 transitions, 5339 flow. Second operand 5 states and 72 transitions. [2022-12-06 05:38:09,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 347 transitions, 6525 flow [2022-12-06 05:38:09,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 347 transitions, 6359 flow, removed 7 selfloop flow, removed 8 redundant places. [2022-12-06 05:38:09,635 INFO L231 Difference]: Finished difference. Result has 169 places, 284 transitions, 5156 flow [2022-12-06 05:38:09,636 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5086, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5156, PETRI_PLACES=169, PETRI_TRANSITIONS=284} [2022-12-06 05:38:09,636 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 140 predicate places. [2022-12-06 05:38:09,636 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:09,636 INFO L89 Accepts]: Start accepts. Operand has 169 places, 284 transitions, 5156 flow [2022-12-06 05:38:09,637 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:09,637 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:09,638 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 284 transitions, 5156 flow [2022-12-06 05:38:09,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 284 transitions, 5156 flow [2022-12-06 05:38:09,748 INFO L130 PetriNetUnfolder]: 324/1160 cut-off events. [2022-12-06 05:38:09,748 INFO L131 PetriNetUnfolder]: For 16558/16787 co-relation queries the response was YES. [2022-12-06 05:38:09,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6907 conditions, 1160 events. 324/1160 cut-off events. For 16558/16787 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 9814 event pairs, 17 based on Foata normal form. 24/1152 useless extension candidates. Maximal degree in co-relation 6639. Up to 203 conditions per place. [2022-12-06 05:38:09,760 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 284 transitions, 5156 flow [2022-12-06 05:38:09,760 INFO L188 LiptonReduction]: Number of co-enabled transitions 1340 [2022-12-06 05:38:09,783 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:38:09,784 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 148 [2022-12-06 05:38:09,784 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 283 transitions, 5140 flow [2022-12-06 05:38:09,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:09,784 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:09,784 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 05:38:09,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-06 05:38:09,785 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 1 more)] === [2022-12-06 05:38:09,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:09,785 INFO L85 PathProgramCache]: Analyzing trace with hash -479845494, now seen corresponding path program 1 times [2022-12-06 05:38:09,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:09,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643840606] [2022-12-06 05:38:09,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:09,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:10,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:10,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:10,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643840606] [2022-12-06 05:38:10,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643840606] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:38:10,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223962405] [2022-12-06 05:38:10,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:10,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:38:10,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:38:10,844 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:38:10,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 05:38:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:10,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 05:38:10,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:38:11,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:11,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:38:11,267 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 05:38:11,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 32 [2022-12-06 05:38:11,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:11,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223962405] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:38:11,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:38:11,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2022-12-06 05:38:11,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823768433] [2022-12-06 05:38:11,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:38:11,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 05:38:11,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:11,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 05:38:11,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2022-12-06 05:38:11,431 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 05:38:11,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 283 transitions, 5140 flow. Second operand has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 23 states have internal predecessors, (54), 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 05:38:11,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:11,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 05:38:11,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:14,471 INFO L130 PetriNetUnfolder]: 2144/3937 cut-off events. [2022-12-06 05:38:14,471 INFO L131 PetriNetUnfolder]: For 69317/69317 co-relation queries the response was YES. [2022-12-06 05:38:14,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27944 conditions, 3937 events. 2144/3937 cut-off events. For 69317/69317 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 26171 event pairs, 184 based on Foata normal form. 4/3941 useless extension candidates. Maximal degree in co-relation 26837. Up to 800 conditions per place. [2022-12-06 05:38:14,499 INFO L137 encePairwiseOnDemand]: 13/36 looper letters, 208 selfloop transitions, 332 changer transitions 20/560 dead transitions. [2022-12-06 05:38:14,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 560 transitions, 9870 flow [2022-12-06 05:38:14,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 05:38:14,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 05:38:14,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 199 transitions. [2022-12-06 05:38:14,501 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23032407407407407 [2022-12-06 05:38:14,501 INFO L175 Difference]: Start difference. First operand has 164 places, 283 transitions, 5140 flow. Second operand 24 states and 199 transitions. [2022-12-06 05:38:14,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 560 transitions, 9870 flow [2022-12-06 05:38:14,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 560 transitions, 9651 flow, removed 21 selfloop flow, removed 6 redundant places. [2022-12-06 05:38:14,676 INFO L231 Difference]: Finished difference. Result has 201 places, 428 transitions, 8966 flow [2022-12-06 05:38:14,676 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4978, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=8966, PETRI_PLACES=201, PETRI_TRANSITIONS=428} [2022-12-06 05:38:14,677 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 172 predicate places. [2022-12-06 05:38:14,677 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:14,677 INFO L89 Accepts]: Start accepts. Operand has 201 places, 428 transitions, 8966 flow [2022-12-06 05:38:14,679 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:14,679 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:14,679 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 428 transitions, 8966 flow [2022-12-06 05:38:14,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 428 transitions, 8966 flow [2022-12-06 05:38:14,892 INFO L130 PetriNetUnfolder]: 463/1569 cut-off events. [2022-12-06 05:38:14,892 INFO L131 PetriNetUnfolder]: For 28541/28813 co-relation queries the response was YES. [2022-12-06 05:38:14,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10740 conditions, 1569 events. 463/1569 cut-off events. For 28541/28813 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 14049 event pairs, 15 based on Foata normal form. 37/1569 useless extension candidates. Maximal degree in co-relation 10619. Up to 279 conditions per place. [2022-12-06 05:38:14,911 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 428 transitions, 8966 flow [2022-12-06 05:38:14,911 INFO L188 LiptonReduction]: Number of co-enabled transitions 1860 [2022-12-06 05:38:14,912 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:38:14,913 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 236 [2022-12-06 05:38:14,913 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 428 transitions, 8966 flow [2022-12-06 05:38:14,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 23 states have internal predecessors, (54), 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 05:38:14,913 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:14,913 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 05:38:14,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 05:38:15,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:38:15,118 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 1 more)] === [2022-12-06 05:38:15,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:15,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1668756632, now seen corresponding path program 1 times [2022-12-06 05:38:15,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:15,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378757428] [2022-12-06 05:38:15,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:15,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:15,831 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 05:38:15,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:15,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378757428] [2022-12-06 05:38:15,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378757428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:15,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:15,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:38:15,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369697562] [2022-12-06 05:38:15,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:15,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:38:15,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:15,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:38:15,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:38:15,833 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 05:38:15,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 428 transitions, 8966 flow. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 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 05:38:15,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:15,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 05:38:15,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:17,323 INFO L130 PetriNetUnfolder]: 2127/3904 cut-off events. [2022-12-06 05:38:17,323 INFO L131 PetriNetUnfolder]: For 93424/93424 co-relation queries the response was YES. [2022-12-06 05:38:17,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32088 conditions, 3904 events. 2127/3904 cut-off events. For 93424/93424 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 25554 event pairs, 592 based on Foata normal form. 2/3906 useless extension candidates. Maximal degree in co-relation 31942. Up to 2481 conditions per place. [2022-12-06 05:38:17,355 INFO L137 encePairwiseOnDemand]: 25/36 looper letters, 437 selfloop transitions, 58 changer transitions 18/513 dead transitions. [2022-12-06 05:38:17,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 513 transitions, 10623 flow [2022-12-06 05:38:17,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:38:17,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:38:17,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2022-12-06 05:38:17,356 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34444444444444444 [2022-12-06 05:38:17,356 INFO L175 Difference]: Start difference. First operand has 200 places, 428 transitions, 8966 flow. Second operand 10 states and 124 transitions. [2022-12-06 05:38:17,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 513 transitions, 10623 flow [2022-12-06 05:38:17,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 513 transitions, 9491 flow, removed 268 selfloop flow, removed 10 redundant places. [2022-12-06 05:38:17,698 INFO L231 Difference]: Finished difference. Result has 202 places, 429 transitions, 8012 flow [2022-12-06 05:38:17,698 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=7885, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8012, PETRI_PLACES=202, PETRI_TRANSITIONS=429} [2022-12-06 05:38:17,699 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 173 predicate places. [2022-12-06 05:38:17,699 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:17,699 INFO L89 Accepts]: Start accepts. Operand has 202 places, 429 transitions, 8012 flow [2022-12-06 05:38:17,700 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:17,700 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:17,701 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 202 places, 429 transitions, 8012 flow [2022-12-06 05:38:17,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 429 transitions, 8012 flow [2022-12-06 05:38:17,876 INFO L130 PetriNetUnfolder]: 461/1562 cut-off events. [2022-12-06 05:38:17,876 INFO L131 PetriNetUnfolder]: For 21744/21986 co-relation queries the response was YES. [2022-12-06 05:38:17,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9690 conditions, 1562 events. 461/1562 cut-off events. For 21744/21986 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 13800 event pairs, 14 based on Foata normal form. 34/1562 useless extension candidates. Maximal degree in co-relation 9571. Up to 266 conditions per place. [2022-12-06 05:38:17,892 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 429 transitions, 8012 flow [2022-12-06 05:38:17,892 INFO L188 LiptonReduction]: Number of co-enabled transitions 1876 [2022-12-06 05:38:17,928 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:38:17,929 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 230 [2022-12-06 05:38:17,929 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 428 transitions, 8006 flow [2022-12-06 05:38:17,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 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 05:38:17,929 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:17,929 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 05:38:17,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-06 05:38:17,929 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 1 more)] === [2022-12-06 05:38:17,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:17,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1446576194, now seen corresponding path program 1 times [2022-12-06 05:38:17,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:17,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42610280] [2022-12-06 05:38:17,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:17,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:19,168 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 05:38:19,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:19,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42610280] [2022-12-06 05:38:19,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42610280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:19,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:19,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 05:38:19,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899995761] [2022-12-06 05:38:19,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:19,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:38:19,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:19,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:38:19,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:38:19,171 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 05:38:19,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 428 transitions, 8006 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:38:19,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:19,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 05:38:19,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:20,253 INFO L130 PetriNetUnfolder]: 2202/4007 cut-off events. [2022-12-06 05:38:20,253 INFO L131 PetriNetUnfolder]: For 80631/80631 co-relation queries the response was YES. [2022-12-06 05:38:20,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30781 conditions, 4007 events. 2202/4007 cut-off events. For 80631/80631 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 26226 event pairs, 547 based on Foata normal form. 1/4008 useless extension candidates. Maximal degree in co-relation 30637. Up to 3173 conditions per place. [2022-12-06 05:38:20,281 INFO L137 encePairwiseOnDemand]: 21/36 looper letters, 371 selfloop transitions, 122 changer transitions 15/508 dead transitions. [2022-12-06 05:38:20,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 508 transitions, 10003 flow [2022-12-06 05:38:20,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:38:20,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:38:20,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2022-12-06 05:38:20,282 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3159722222222222 [2022-12-06 05:38:20,282 INFO L175 Difference]: Start difference. First operand has 199 places, 428 transitions, 8006 flow. Second operand 8 states and 91 transitions. [2022-12-06 05:38:20,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 508 transitions, 10003 flow [2022-12-06 05:38:20,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 508 transitions, 9866 flow, removed 28 selfloop flow, removed 7 redundant places. [2022-12-06 05:38:20,583 INFO L231 Difference]: Finished difference. Result has 205 places, 454 transitions, 8766 flow [2022-12-06 05:38:20,583 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=7873, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8766, PETRI_PLACES=205, PETRI_TRANSITIONS=454} [2022-12-06 05:38:20,583 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 176 predicate places. [2022-12-06 05:38:20,583 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:20,584 INFO L89 Accepts]: Start accepts. Operand has 205 places, 454 transitions, 8766 flow [2022-12-06 05:38:20,585 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:20,585 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:20,585 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 454 transitions, 8766 flow [2022-12-06 05:38:20,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 454 transitions, 8766 flow [2022-12-06 05:38:20,759 INFO L130 PetriNetUnfolder]: 482/1615 cut-off events. [2022-12-06 05:38:20,759 INFO L131 PetriNetUnfolder]: For 25226/25516 co-relation queries the response was YES. [2022-12-06 05:38:20,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10374 conditions, 1615 events. 482/1615 cut-off events. For 25226/25516 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 14416 event pairs, 14 based on Foata normal form. 33/1618 useless extension candidates. Maximal degree in co-relation 10252. Up to 273 conditions per place. [2022-12-06 05:38:20,778 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 454 transitions, 8766 flow [2022-12-06 05:38:20,778 INFO L188 LiptonReduction]: Number of co-enabled transitions 1970 [2022-12-06 05:38:20,780 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:38:20,911 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:38:21,040 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [556] $Ultimate##0-->L51-5: Formula: (and (= |v_thread1Thread1of1ForFork2_~x~0#1_19| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_23| 0)) InVars {} OutVars{thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_19|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_23|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 05:38:21,280 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [556] $Ultimate##0-->L51-5: Formula: (and (= |v_thread1Thread1of1ForFork2_~x~0#1_19| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_23| 0)) InVars {} OutVars{thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_19|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_23|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 05:38:21,421 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:38:21,422 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 839 [2022-12-06 05:38:21,422 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 453 transitions, 8809 flow [2022-12-06 05:38:21,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:38:21,422 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:21,422 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 05:38:21,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-06 05:38:21,422 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 1 more)] === [2022-12-06 05:38:21,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:21,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1180338482, now seen corresponding path program 2 times [2022-12-06 05:38:21,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:21,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173237392] [2022-12-06 05:38:21,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:21,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:22,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:22,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:22,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173237392] [2022-12-06 05:38:22,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173237392] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:38:22,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409495426] [2022-12-06 05:38:22,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:38:22,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:38:22,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:38:22,408 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:38:22,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 05:38:22,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:38:22,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:38:22,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-06 05:38:22,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:38:22,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:22,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:38:22,925 INFO L321 Elim1Store]: treesize reduction 23, result has 14.8 percent of original size [2022-12-06 05:38:22,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 28 [2022-12-06 05:38:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:23,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409495426] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:38:23,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:38:23,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2022-12-06 05:38:23,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312757895] [2022-12-06 05:38:23,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:38:23,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 05:38:23,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:23,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 05:38:23,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-12-06 05:38:23,065 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 05:38:23,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 453 transitions, 8809 flow. Second operand has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 22 states have internal predecessors, (50), 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 05:38:23,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:23,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 05:38:23,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:26,894 INFO L130 PetriNetUnfolder]: 2526/4631 cut-off events. [2022-12-06 05:38:26,894 INFO L131 PetriNetUnfolder]: For 94228/94228 co-relation queries the response was YES. [2022-12-06 05:38:26,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35898 conditions, 4631 events. 2526/4631 cut-off events. For 94228/94228 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 31532 event pairs, 203 based on Foata normal form. 4/4635 useless extension candidates. Maximal degree in co-relation 35751. Up to 993 conditions per place. [2022-12-06 05:38:26,930 INFO L137 encePairwiseOnDemand]: 14/43 looper letters, 247 selfloop transitions, 429 changer transitions 14/690 dead transitions. [2022-12-06 05:38:26,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 690 transitions, 13119 flow [2022-12-06 05:38:26,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-06 05:38:26,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-06 05:38:26,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 229 transitions. [2022-12-06 05:38:26,932 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19724375538329025 [2022-12-06 05:38:26,932 INFO L175 Difference]: Start difference. First operand has 203 places, 453 transitions, 8809 flow. Second operand 27 states and 229 transitions. [2022-12-06 05:38:26,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 690 transitions, 13119 flow [2022-12-06 05:38:27,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 690 transitions, 12854 flow, removed 69 selfloop flow, removed 3 redundant places. [2022-12-06 05:38:27,336 INFO L231 Difference]: Finished difference. Result has 235 places, 548 transitions, 11568 flow [2022-12-06 05:38:27,336 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=8581, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=346, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=11568, PETRI_PLACES=235, PETRI_TRANSITIONS=548} [2022-12-06 05:38:27,337 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 206 predicate places. [2022-12-06 05:38:27,337 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:27,337 INFO L89 Accepts]: Start accepts. Operand has 235 places, 548 transitions, 11568 flow [2022-12-06 05:38:27,339 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:27,339 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:27,339 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 235 places, 548 transitions, 11568 flow [2022-12-06 05:38:27,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 234 places, 548 transitions, 11568 flow [2022-12-06 05:38:27,580 INFO L130 PetriNetUnfolder]: 545/1885 cut-off events. [2022-12-06 05:38:27,580 INFO L131 PetriNetUnfolder]: For 35608/35907 co-relation queries the response was YES. [2022-12-06 05:38:27,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12847 conditions, 1885 events. 545/1885 cut-off events. For 35608/35907 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 17637 event pairs, 17 based on Foata normal form. 42/1896 useless extension candidates. Maximal degree in co-relation 12719. Up to 323 conditions per place. [2022-12-06 05:38:27,653 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 234 places, 548 transitions, 11568 flow [2022-12-06 05:38:27,653 INFO L188 LiptonReduction]: Number of co-enabled transitions 2328 [2022-12-06 05:38:27,674 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 05:38:27,971 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [600] L51-5-->L51-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_28| 1) |v_thread1Thread1of1ForFork2_~i~0#1_27|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_28| 4294967296) (mod v_~A~0_57 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_31| (+ |v_thread1Thread1of1ForFork2_~x~0#1_32| v_~B~0_47))) InVars {~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_32|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_28|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_31|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] [2022-12-06 05:38:28,009 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 05:38:28,433 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 05:38:28,731 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [600] L51-5-->L51-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_28| 1) |v_thread1Thread1of1ForFork2_~i~0#1_27|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_28| 4294967296) (mod v_~A~0_57 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_31| (+ |v_thread1Thread1of1ForFork2_~x~0#1_32| v_~B~0_47))) InVars {~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_32|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_28|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_31|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] [2022-12-06 05:38:28,769 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 05:38:28,969 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [581] $Ultimate##0-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_35| 0) (= |v_thread2Thread1of1ForFork0_~x~1#1_33| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_35|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_~x~1#1] and [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 05:38:29,598 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [581] $Ultimate##0-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_35| 0) (= |v_thread2Thread1of1ForFork0_~x~1#1_33| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_35|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_~x~1#1] and [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 05:38:29,707 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [581] $Ultimate##0-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_35| 0) (= |v_thread2Thread1of1ForFork0_~x~1#1_33| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_35|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_~x~1#1] and [600] L51-5-->L51-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_28| 1) |v_thread1Thread1of1ForFork2_~i~0#1_27|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_28| 4294967296) (mod v_~A~0_57 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_31| (+ |v_thread1Thread1of1ForFork2_~x~0#1_32| v_~B~0_47))) InVars {~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_32|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_28|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_31|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] [2022-12-06 05:38:29,737 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:38:29,738 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2401 [2022-12-06 05:38:29,738 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 547 transitions, 11978 flow [2022-12-06 05:38:29,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 22 states have internal predecessors, (50), 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 05:38:29,738 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:29,738 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:38:29,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 05:38:29,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:38:29,945 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 1 more)] === [2022-12-06 05:38:29,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:29,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1536064696, now seen corresponding path program 1 times [2022-12-06 05:38:29,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:29,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603422129] [2022-12-06 05:38:29,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:29,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:30,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 05:38:30,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:30,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603422129] [2022-12-06 05:38:30,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603422129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:30,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:30,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:38:30,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073964755] [2022-12-06 05:38:30,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:30,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:38:30,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:30,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:38:30,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:38:30,949 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 05:38:30,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 547 transitions, 11978 flow. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:30,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:30,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 05:38:30,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:32,342 INFO L130 PetriNetUnfolder]: 2534/4641 cut-off events. [2022-12-06 05:38:32,343 INFO L131 PetriNetUnfolder]: For 130713/130713 co-relation queries the response was YES. [2022-12-06 05:38:32,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39754 conditions, 4641 events. 2534/4641 cut-off events. For 130713/130713 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 31372 event pairs, 596 based on Foata normal form. 1/4642 useless extension candidates. Maximal degree in co-relation 39601. Up to 3823 conditions per place. [2022-12-06 05:38:32,383 INFO L137 encePairwiseOnDemand]: 35/59 looper letters, 452 selfloop transitions, 127 changer transitions 19/598 dead transitions. [2022-12-06 05:38:32,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 598 transitions, 13716 flow [2022-12-06 05:38:32,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:38:32,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:38:32,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2022-12-06 05:38:32,384 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25181598062953997 [2022-12-06 05:38:32,384 INFO L175 Difference]: Start difference. First operand has 233 places, 547 transitions, 11978 flow. Second operand 7 states and 104 transitions. [2022-12-06 05:38:32,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 598 transitions, 13716 flow [2022-12-06 05:38:32,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 598 transitions, 12647 flow, removed 359 selfloop flow, removed 7 redundant places. [2022-12-06 05:38:33,005 INFO L231 Difference]: Finished difference. Result has 236 places, 551 transitions, 11308 flow [2022-12-06 05:38:33,006 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=10955, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11308, PETRI_PLACES=236, PETRI_TRANSITIONS=551} [2022-12-06 05:38:33,006 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 207 predicate places. [2022-12-06 05:38:33,006 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:33,006 INFO L89 Accepts]: Start accepts. Operand has 236 places, 551 transitions, 11308 flow [2022-12-06 05:38:33,008 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:33,008 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:33,008 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 236 places, 551 transitions, 11308 flow [2022-12-06 05:38:33,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 232 places, 551 transitions, 11308 flow [2022-12-06 05:38:33,233 INFO L130 PetriNetUnfolder]: 547/1901 cut-off events. [2022-12-06 05:38:33,234 INFO L131 PetriNetUnfolder]: For 33588/33852 co-relation queries the response was YES. [2022-12-06 05:38:33,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12496 conditions, 1901 events. 547/1901 cut-off events. For 33588/33852 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 17809 event pairs, 17 based on Foata normal form. 36/1904 useless extension candidates. Maximal degree in co-relation 12376. Up to 331 conditions per place. [2022-12-06 05:38:33,258 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 232 places, 551 transitions, 11308 flow [2022-12-06 05:38:33,258 INFO L188 LiptonReduction]: Number of co-enabled transitions 2334 [2022-12-06 05:38:33,260 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:38:33,260 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 254 [2022-12-06 05:38:33,260 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 551 transitions, 11308 flow [2022-12-06 05:38:33,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:33,261 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:33,261 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:38:33,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-06 05:38:33,261 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 1 more)] === [2022-12-06 05:38:33,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:33,261 INFO L85 PathProgramCache]: Analyzing trace with hash -120778609, now seen corresponding path program 1 times [2022-12-06 05:38:33,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:33,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035061469] [2022-12-06 05:38:33,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:33,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:37,756 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 05:38:37,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:37,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035061469] [2022-12-06 05:38:37,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035061469] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:37,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:37,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:38:37,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271079878] [2022-12-06 05:38:37,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:37,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:38:37,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:37,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:38:37,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:38:37,758 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 05:38:37,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 551 transitions, 11308 flow. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:37,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:37,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 05:38:37,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:39,732 INFO L130 PetriNetUnfolder]: 2512/4596 cut-off events. [2022-12-06 05:38:39,737 INFO L131 PetriNetUnfolder]: For 113269/113269 co-relation queries the response was YES. [2022-12-06 05:38:39,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37814 conditions, 4596 events. 2512/4596 cut-off events. For 113269/113269 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 31091 event pairs, 565 based on Foata normal form. 1/4589 useless extension candidates. Maximal degree in co-relation 37659. Up to 3717 conditions per place. [2022-12-06 05:38:39,779 INFO L137 encePairwiseOnDemand]: 29/58 looper letters, 451 selfloop transitions, 136 changer transitions 15/602 dead transitions. [2022-12-06 05:38:39,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 602 transitions, 13014 flow [2022-12-06 05:38:39,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:38:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:38:39,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2022-12-06 05:38:39,781 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23922413793103448 [2022-12-06 05:38:39,781 INFO L175 Difference]: Start difference. First operand has 232 places, 551 transitions, 11308 flow. Second operand 8 states and 111 transitions. [2022-12-06 05:38:39,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 602 transitions, 13014 flow [2022-12-06 05:38:40,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 602 transitions, 12735 flow, removed 19 selfloop flow, removed 5 redundant places. [2022-12-06 05:38:40,326 INFO L231 Difference]: Finished difference. Result has 235 places, 548 transitions, 11247 flow [2022-12-06 05:38:40,326 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=11033, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11247, PETRI_PLACES=235, PETRI_TRANSITIONS=548} [2022-12-06 05:38:40,327 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 206 predicate places. [2022-12-06 05:38:40,327 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:40,327 INFO L89 Accepts]: Start accepts. Operand has 235 places, 548 transitions, 11247 flow [2022-12-06 05:38:40,329 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:40,329 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:40,329 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 235 places, 548 transitions, 11247 flow [2022-12-06 05:38:40,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 548 transitions, 11247 flow [2022-12-06 05:38:40,561 INFO L130 PetriNetUnfolder]: 543/1901 cut-off events. [2022-12-06 05:38:40,561 INFO L131 PetriNetUnfolder]: For 33157/33408 co-relation queries the response was YES. [2022-12-06 05:38:40,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12456 conditions, 1901 events. 543/1901 cut-off events. For 33157/33408 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 17885 event pairs, 18 based on Foata normal form. 31/1898 useless extension candidates. Maximal degree in co-relation 12328. Up to 330 conditions per place. [2022-12-06 05:38:40,598 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 233 places, 548 transitions, 11247 flow [2022-12-06 05:38:40,598 INFO L188 LiptonReduction]: Number of co-enabled transitions 2324 [2022-12-06 05:38:40,600 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:38:40,600 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 273 [2022-12-06 05:38:40,600 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 548 transitions, 11247 flow [2022-12-06 05:38:40,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:40,600 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:40,600 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:38:40,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-06 05:38:40,601 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 1 more)] === [2022-12-06 05:38:40,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:40,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1477865582, now seen corresponding path program 1 times [2022-12-06 05:38:40,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:40,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021172243] [2022-12-06 05:38:40,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:40,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:45,076 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 05:38:45,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:45,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021172243] [2022-12-06 05:38:45,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021172243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:45,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:45,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:38:45,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769132420] [2022-12-06 05:38:45,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:45,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:38:45,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:45,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:38:45,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:38:45,077 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 05:38:45,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 548 transitions, 11247 flow. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:45,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:45,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 05:38:45,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:46,846 INFO L130 PetriNetUnfolder]: 2521/4612 cut-off events. [2022-12-06 05:38:46,846 INFO L131 PetriNetUnfolder]: For 114659/114659 co-relation queries the response was YES. [2022-12-06 05:38:46,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37915 conditions, 4612 events. 2521/4612 cut-off events. For 114659/114659 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 31051 event pairs, 539 based on Foata normal form. 1/4605 useless extension candidates. Maximal degree in co-relation 37762. Up to 3588 conditions per place. [2022-12-06 05:38:46,890 INFO L137 encePairwiseOnDemand]: 21/56 looper letters, 405 selfloop transitions, 182 changer transitions 13/600 dead transitions. [2022-12-06 05:38:46,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 600 transitions, 12990 flow [2022-12-06 05:38:46,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:38:46,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:38:46,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2022-12-06 05:38:46,891 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27040816326530615 [2022-12-06 05:38:46,892 INFO L175 Difference]: Start difference. First operand has 233 places, 548 transitions, 11247 flow. Second operand 7 states and 106 transitions. [2022-12-06 05:38:46,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 600 transitions, 12990 flow [2022-12-06 05:38:47,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 600 transitions, 12722 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-12-06 05:38:47,504 INFO L231 Difference]: Finished difference. Result has 237 places, 552 transitions, 11523 flow [2022-12-06 05:38:47,504 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=10979, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11523, PETRI_PLACES=237, PETRI_TRANSITIONS=552} [2022-12-06 05:38:47,505 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 208 predicate places. [2022-12-06 05:38:47,505 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:47,505 INFO L89 Accepts]: Start accepts. Operand has 237 places, 552 transitions, 11523 flow [2022-12-06 05:38:47,507 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:47,507 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:47,507 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 237 places, 552 transitions, 11523 flow [2022-12-06 05:38:47,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 236 places, 552 transitions, 11523 flow [2022-12-06 05:38:47,736 INFO L130 PetriNetUnfolder]: 550/1914 cut-off events. [2022-12-06 05:38:47,736 INFO L131 PetriNetUnfolder]: For 34633/34875 co-relation queries the response was YES. [2022-12-06 05:38:47,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12786 conditions, 1914 events. 550/1914 cut-off events. For 34633/34875 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 18002 event pairs, 17 based on Foata normal form. 31/1911 useless extension candidates. Maximal degree in co-relation 12656. Up to 331 conditions per place. [2022-12-06 05:38:47,760 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 236 places, 552 transitions, 11523 flow [2022-12-06 05:38:47,760 INFO L188 LiptonReduction]: Number of co-enabled transitions 2338 [2022-12-06 05:38:47,762 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:38:47,896 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:38:47,897 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 392 [2022-12-06 05:38:47,897 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 551 transitions, 11513 flow [2022-12-06 05:38:47,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:47,897 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:47,897 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:38:47,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-06 05:38:47,897 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 1 more)] === [2022-12-06 05:38:47,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:47,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1438650122, now seen corresponding path program 1 times [2022-12-06 05:38:47,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:47,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741903051] [2022-12-06 05:38:47,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:47,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:48,974 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 05:38:48,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:48,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741903051] [2022-12-06 05:38:48,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741903051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:48,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:48,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:38:48,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753960676] [2022-12-06 05:38:48,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:48,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:38:48,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:48,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:38:48,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:38:48,975 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 05:38:48,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 551 transitions, 11513 flow. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:48,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:48,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 05:38:48,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:50,461 INFO L130 PetriNetUnfolder]: 2530/4632 cut-off events. [2022-12-06 05:38:50,461 INFO L131 PetriNetUnfolder]: For 118092/118092 co-relation queries the response was YES. [2022-12-06 05:38:50,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38579 conditions, 4632 events. 2530/4632 cut-off events. For 118092/118092 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 31542 event pairs, 539 based on Foata normal form. 1/4625 useless extension candidates. Maximal degree in co-relation 38424. Up to 3426 conditions per place. [2022-12-06 05:38:50,508 INFO L137 encePairwiseOnDemand]: 22/57 looper letters, 395 selfloop transitions, 192 changer transitions 16/603 dead transitions. [2022-12-06 05:38:50,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 603 transitions, 13298 flow [2022-12-06 05:38:50,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:38:50,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:38:50,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2022-12-06 05:38:50,509 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2631578947368421 [2022-12-06 05:38:50,509 INFO L175 Difference]: Start difference. First operand has 235 places, 551 transitions, 11513 flow. Second operand 7 states and 105 transitions. [2022-12-06 05:38:50,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 603 transitions, 13298 flow [2022-12-06 05:38:51,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 603 transitions, 13174 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-12-06 05:38:51,082 INFO L231 Difference]: Finished difference. Result has 241 places, 551 transitions, 11876 flow [2022-12-06 05:38:51,082 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=11389, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11876, PETRI_PLACES=241, PETRI_TRANSITIONS=551} [2022-12-06 05:38:51,083 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 212 predicate places. [2022-12-06 05:38:51,083 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:51,083 INFO L89 Accepts]: Start accepts. Operand has 241 places, 551 transitions, 11876 flow [2022-12-06 05:38:51,085 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:51,085 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:51,085 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 241 places, 551 transitions, 11876 flow [2022-12-06 05:38:51,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 551 transitions, 11876 flow [2022-12-06 05:38:51,325 INFO L130 PetriNetUnfolder]: 551/1912 cut-off events. [2022-12-06 05:38:51,325 INFO L131 PetriNetUnfolder]: For 39543/39800 co-relation queries the response was YES. [2022-12-06 05:38:51,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13031 conditions, 1912 events. 551/1912 cut-off events. For 39543/39800 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 18069 event pairs, 17 based on Foata normal form. 32/1911 useless extension candidates. Maximal degree in co-relation 12900. Up to 331 conditions per place. [2022-12-06 05:38:51,351 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 239 places, 551 transitions, 11876 flow [2022-12-06 05:38:51,351 INFO L188 LiptonReduction]: Number of co-enabled transitions 2338 [2022-12-06 05:38:51,353 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:38:51,353 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 270 [2022-12-06 05:38:51,353 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 551 transitions, 11876 flow [2022-12-06 05:38:51,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:51,354 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:51,354 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:38:51,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-06 05:38:51,354 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 1 more)] === [2022-12-06 05:38:51,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:51,354 INFO L85 PathProgramCache]: Analyzing trace with hash 227841297, now seen corresponding path program 1 times [2022-12-06 05:38:51,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:51,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075939795] [2022-12-06 05:38:51,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:51,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:52,500 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 05:38:52,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:52,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075939795] [2022-12-06 05:38:52,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075939795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:52,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:52,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:38:52,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573761314] [2022-12-06 05:38:52,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:52,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:38:52,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:52,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:38:52,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:38:52,501 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 05:38:52,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 551 transitions, 11876 flow. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:52,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:52,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 05:38:52,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:53,880 INFO L130 PetriNetUnfolder]: 2530/4640 cut-off events. [2022-12-06 05:38:53,881 INFO L131 PetriNetUnfolder]: For 127492/127492 co-relation queries the response was YES. [2022-12-06 05:38:53,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39368 conditions, 4640 events. 2530/4640 cut-off events. For 127492/127492 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 31575 event pairs, 521 based on Foata normal form. 1/4633 useless extension candidates. Maximal degree in co-relation 39212. Up to 2771 conditions per place. [2022-12-06 05:38:53,925 INFO L137 encePairwiseOnDemand]: 21/56 looper letters, 385 selfloop transitions, 213 changer transitions 14/612 dead transitions. [2022-12-06 05:38:53,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 612 transitions, 13840 flow [2022-12-06 05:38:53,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:38:53,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:38:53,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2022-12-06 05:38:53,926 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27040816326530615 [2022-12-06 05:38:53,926 INFO L175 Difference]: Start difference. First operand has 239 places, 551 transitions, 11876 flow. Second operand 7 states and 106 transitions. [2022-12-06 05:38:53,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 612 transitions, 13840 flow [2022-12-06 05:38:54,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 612 transitions, 13536 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-06 05:38:54,554 INFO L231 Difference]: Finished difference. Result has 243 places, 555 transitions, 12206 flow [2022-12-06 05:38:54,555 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=11574, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=209, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12206, PETRI_PLACES=243, PETRI_TRANSITIONS=555} [2022-12-06 05:38:54,555 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 214 predicate places. [2022-12-06 05:38:54,555 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:54,555 INFO L89 Accepts]: Start accepts. Operand has 243 places, 555 transitions, 12206 flow [2022-12-06 05:38:54,557 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:54,558 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:54,558 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 243 places, 555 transitions, 12206 flow [2022-12-06 05:38:54,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 242 places, 555 transitions, 12206 flow [2022-12-06 05:38:54,799 INFO L130 PetriNetUnfolder]: 548/1924 cut-off events. [2022-12-06 05:38:54,799 INFO L131 PetriNetUnfolder]: For 41324/41589 co-relation queries the response was YES. [2022-12-06 05:38:54,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13237 conditions, 1924 events. 548/1924 cut-off events. For 41324/41589 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 18263 event pairs, 18 based on Foata normal form. 36/1925 useless extension candidates. Maximal degree in co-relation 13105. Up to 336 conditions per place. [2022-12-06 05:38:54,824 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 242 places, 555 transitions, 12206 flow [2022-12-06 05:38:54,824 INFO L188 LiptonReduction]: Number of co-enabled transitions 2350 [2022-12-06 05:38:54,826 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:38:54,943 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:38:54,943 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 388 [2022-12-06 05:38:54,944 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 554 transitions, 12196 flow [2022-12-06 05:38:54,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:54,944 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:54,944 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:38:54,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-06 05:38:54,944 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 1 more)] === [2022-12-06 05:38:54,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:54,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1532385235, now seen corresponding path program 1 times [2022-12-06 05:38:54,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:54,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448045694] [2022-12-06 05:38:54,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:54,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:55,777 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 05:38:55,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:55,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448045694] [2022-12-06 05:38:55,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448045694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:55,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:55,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:38:55,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324877005] [2022-12-06 05:38:55,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:55,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:38:55,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:55,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:38:55,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:38:55,778 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 05:38:55,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 554 transitions, 12196 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:55,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:55,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 05:38:55,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:57,161 INFO L130 PetriNetUnfolder]: 2525/4627 cut-off events. [2022-12-06 05:38:57,161 INFO L131 PetriNetUnfolder]: For 132783/132783 co-relation queries the response was YES. [2022-12-06 05:38:57,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39718 conditions, 4627 events. 2525/4627 cut-off events. For 132783/132783 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 31502 event pairs, 521 based on Foata normal form. 1/4620 useless extension candidates. Maximal degree in co-relation 39561. Up to 2770 conditions per place. [2022-12-06 05:38:57,202 INFO L137 encePairwiseOnDemand]: 22/57 looper letters, 385 selfloop transitions, 211 changer transitions 14/610 dead transitions. [2022-12-06 05:38:57,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 610 transitions, 14062 flow [2022-12-06 05:38:57,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:38:57,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:38:57,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2022-12-06 05:38:57,203 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2631578947368421 [2022-12-06 05:38:57,203 INFO L175 Difference]: Start difference. First operand has 241 places, 554 transitions, 12196 flow. Second operand 7 states and 105 transitions. [2022-12-06 05:38:57,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 610 transitions, 14062 flow [2022-12-06 05:38:57,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 610 transitions, 13842 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-06 05:38:57,764 INFO L231 Difference]: Finished difference. Result has 245 places, 553 transitions, 12378 flow [2022-12-06 05:38:57,765 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=11976, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12378, PETRI_PLACES=245, PETRI_TRANSITIONS=553} [2022-12-06 05:38:57,765 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 216 predicate places. [2022-12-06 05:38:57,765 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:57,765 INFO L89 Accepts]: Start accepts. Operand has 245 places, 553 transitions, 12378 flow [2022-12-06 05:38:57,767 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:57,767 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:57,767 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 245 places, 553 transitions, 12378 flow [2022-12-06 05:38:57,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 243 places, 553 transitions, 12378 flow [2022-12-06 05:38:58,001 INFO L130 PetriNetUnfolder]: 547/1917 cut-off events. [2022-12-06 05:38:58,001 INFO L131 PetriNetUnfolder]: For 43466/43731 co-relation queries the response was YES. [2022-12-06 05:38:58,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13359 conditions, 1917 events. 547/1917 cut-off events. For 43466/43731 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 18263 event pairs, 18 based on Foata normal form. 36/1918 useless extension candidates. Maximal degree in co-relation 13255. Up to 333 conditions per place. [2022-12-06 05:38:58,026 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 243 places, 553 transitions, 12378 flow [2022-12-06 05:38:58,026 INFO L188 LiptonReduction]: Number of co-enabled transitions 2346 [2022-12-06 05:38:58,027 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:38:58,028 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 263 [2022-12-06 05:38:58,028 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 553 transitions, 12378 flow [2022-12-06 05:38:58,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:58,028 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:58,028 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:38:58,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-06 05:38:58,028 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 1 more)] === [2022-12-06 05:38:58,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:58,029 INFO L85 PathProgramCache]: Analyzing trace with hash -902901361, now seen corresponding path program 1 times [2022-12-06 05:38:58,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:58,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110111061] [2022-12-06 05:38:58,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:58,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:59,398 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 05:38:59,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:59,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110111061] [2022-12-06 05:38:59,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110111061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:59,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:59,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:38:59,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805987756] [2022-12-06 05:38:59,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:59,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:38:59,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:59,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:38:59,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:38:59,399 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 05:38:59,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 553 transitions, 12378 flow. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:59,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:59,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 05:38:59,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:39:00,876 INFO L130 PetriNetUnfolder]: 2527/4634 cut-off events. [2022-12-06 05:39:00,877 INFO L131 PetriNetUnfolder]: For 138146/138146 co-relation queries the response was YES. [2022-12-06 05:39:00,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40066 conditions, 4634 events. 2527/4634 cut-off events. For 138146/138146 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 31477 event pairs, 548 based on Foata normal form. 1/4627 useless extension candidates. Maximal degree in co-relation 39909. Up to 3885 conditions per place. [2022-12-06 05:39:00,921 INFO L137 encePairwiseOnDemand]: 29/56 looper letters, 438 selfloop transitions, 151 changer transitions 16/605 dead transitions. [2022-12-06 05:39:00,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 605 transitions, 14250 flow [2022-12-06 05:39:00,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:39:00,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:39:00,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2022-12-06 05:39:00,922 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-06 05:39:00,922 INFO L175 Difference]: Start difference. First operand has 243 places, 553 transitions, 12378 flow. Second operand 7 states and 98 transitions. [2022-12-06 05:39:00,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 605 transitions, 14250 flow [2022-12-06 05:39:01,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 605 transitions, 13929 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-12-06 05:39:01,626 INFO L231 Difference]: Finished difference. Result has 249 places, 567 transitions, 12860 flow [2022-12-06 05:39:01,626 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=12073, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12860, PETRI_PLACES=249, PETRI_TRANSITIONS=567} [2022-12-06 05:39:01,627 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 220 predicate places. [2022-12-06 05:39:01,627 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:39:01,627 INFO L89 Accepts]: Start accepts. Operand has 249 places, 567 transitions, 12860 flow [2022-12-06 05:39:01,629 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:39:01,629 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:01,630 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 249 places, 567 transitions, 12860 flow [2022-12-06 05:39:01,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 567 transitions, 12860 flow [2022-12-06 05:39:01,882 INFO L130 PetriNetUnfolder]: 550/1928 cut-off events. [2022-12-06 05:39:01,882 INFO L131 PetriNetUnfolder]: For 43191/43420 co-relation queries the response was YES. [2022-12-06 05:39:01,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13712 conditions, 1928 events. 550/1928 cut-off events. For 43191/43420 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 18284 event pairs, 18 based on Foata normal form. 34/1928 useless extension candidates. Maximal degree in co-relation 13577. Up to 341 conditions per place. [2022-12-06 05:39:01,911 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 248 places, 567 transitions, 12860 flow [2022-12-06 05:39:01,911 INFO L188 LiptonReduction]: Number of co-enabled transitions 2358 [2022-12-06 05:39:01,913 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:39:02,248 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:39:02,248 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 621 [2022-12-06 05:39:02,248 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 566 transitions, 12864 flow [2022-12-06 05:39:02,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:02,248 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:39:02,248 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:39:02,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-06 05:39:02,249 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 1 more)] === [2022-12-06 05:39:02,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:39:02,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1735273385, now seen corresponding path program 1 times [2022-12-06 05:39:02,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:39:02,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026013842] [2022-12-06 05:39:02,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:02,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:39:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:04,419 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 05:39:04,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:39:04,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026013842] [2022-12-06 05:39:04,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026013842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:39:04,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:39:04,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:39:04,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523466202] [2022-12-06 05:39:04,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:39:04,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:39:04,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:39:04,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:39:04,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:39:04,421 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 05:39:04,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 566 transitions, 12864 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:04,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:39:04,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 05:39:04,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:39:06,218 INFO L130 PetriNetUnfolder]: 2549/4673 cut-off events. [2022-12-06 05:39:06,219 INFO L131 PetriNetUnfolder]: For 142218/142218 co-relation queries the response was YES. [2022-12-06 05:39:06,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41154 conditions, 4673 events. 2549/4673 cut-off events. For 142218/142218 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 31943 event pairs, 548 based on Foata normal form. 1/4666 useless extension candidates. Maximal degree in co-relation 40994. Up to 3870 conditions per place. [2022-12-06 05:39:06,258 INFO L137 encePairwiseOnDemand]: 30/58 looper letters, 443 selfloop transitions, 151 changer transitions 18/612 dead transitions. [2022-12-06 05:39:06,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 612 transitions, 14574 flow [2022-12-06 05:39:06,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:39:06,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:39:06,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-12-06 05:39:06,259 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2536945812807882 [2022-12-06 05:39:06,259 INFO L175 Difference]: Start difference. First operand has 247 places, 566 transitions, 12864 flow. Second operand 7 states and 103 transitions. [2022-12-06 05:39:06,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 612 transitions, 14574 flow [2022-12-06 05:39:06,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 612 transitions, 14363 flow, removed 43 selfloop flow, removed 3 redundant places. [2022-12-06 05:39:06,853 INFO L231 Difference]: Finished difference. Result has 253 places, 565 transitions, 12938 flow [2022-12-06 05:39:06,853 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=12653, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12938, PETRI_PLACES=253, PETRI_TRANSITIONS=565} [2022-12-06 05:39:06,853 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 224 predicate places. [2022-12-06 05:39:06,853 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:39:06,853 INFO L89 Accepts]: Start accepts. Operand has 253 places, 565 transitions, 12938 flow [2022-12-06 05:39:06,856 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:39:06,856 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:06,856 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 253 places, 565 transitions, 12938 flow [2022-12-06 05:39:06,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 251 places, 565 transitions, 12938 flow [2022-12-06 05:39:07,092 INFO L130 PetriNetUnfolder]: 553/1932 cut-off events. [2022-12-06 05:39:07,093 INFO L131 PetriNetUnfolder]: For 45271/45513 co-relation queries the response was YES. [2022-12-06 05:39:07,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13754 conditions, 1932 events. 553/1932 cut-off events. For 45271/45513 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 18380 event pairs, 18 based on Foata normal form. 31/1927 useless extension candidates. Maximal degree in co-relation 13618. Up to 338 conditions per place. [2022-12-06 05:39:07,117 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 251 places, 565 transitions, 12938 flow [2022-12-06 05:39:07,118 INFO L188 LiptonReduction]: Number of co-enabled transitions 2374 [2022-12-06 05:39:07,119 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [690] $Ultimate##0-->thread1EXIT: Formula: (and (not (= (ite (and (<= 0 v_~end~0_545) (< v_~end~0_545 v_~n~0_294)) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_~i~0#1_198| 0) (= (ite (= (mod (select (select |v_#memory_int_522| v_~queue~0.base_288) (+ v_~queue~0.offset_288 (* v_~end~0_545 4))) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_203| 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_86|) (= |v_thread1Thread1of1ForFork2_#res#1.base_84| 0) (= v_~end~0_544 (+ v_~end~0_545 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_86| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_86|) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_198| 4294967296) (mod v_~A~0_280 4294967296))) (= |v_thread1Thread1of1ForFork2_~x~0#1_203| 0) (= |v_thread1Thread1of1ForFork2_#res#1.offset_84| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_86| 0))) InVars {~queue~0.offset=v_~queue~0.offset_288, ~A~0=v_~A~0_280, #memory_int=|v_#memory_int_522|, ~end~0=v_~end~0_545, ~queue~0.base=v_~queue~0.base_288, ~n~0=v_~n~0_294} OutVars{~queue~0.offset=v_~queue~0.offset_288, ~A~0=v_~A~0_280, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_203|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_86|, ~queue~0.base=v_~queue~0.base_288, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_86|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_198|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_86|, #memory_int=|v_#memory_int_522|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_84|, ~end~0=v_~end~0_544, ~n~0=v_~n~0_294, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_84|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_86|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [601] L102-4-->L103-3: Formula: (and (= (store |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre16#1_29|)) |v_#memory_int_148|) (= |v_#pthreadsForks_52| (+ |v_#pthreadsForks_53| 1)) (= |v_ULTIMATE.start_main_#t~pre16#1_29| |v_#pthreadsForks_53|)) InVars {#pthreadsForks=|v_#pthreadsForks_53|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_41|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_148|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_29|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_23|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre14#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet15#1] [2022-12-06 05:39:07,221 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:39:07,222 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 369 [2022-12-06 05:39:07,222 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 564 transitions, 12922 flow [2022-12-06 05:39:07,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:07,222 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:39:07,222 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:39:07,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-06 05:39:07,222 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:39:07,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:39:07,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1065568421, now seen corresponding path program 1 times [2022-12-06 05:39:07,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:39:07,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145303950] [2022-12-06 05:39:07,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:07,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:39:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:08,025 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 05:39:08,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:39:08,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145303950] [2022-12-06 05:39:08,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145303950] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:39:08,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:39:08,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:39:08,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822528571] [2022-12-06 05:39:08,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:39:08,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:39:08,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:39:08,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:39:08,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:39:08,027 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 05:39:08,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 564 transitions, 12922 flow. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:08,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:39:08,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 05:39:08,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:39:09,335 INFO L130 PetriNetUnfolder]: 2540/4653 cut-off events. [2022-12-06 05:39:09,335 INFO L131 PetriNetUnfolder]: For 143372/143372 co-relation queries the response was YES. [2022-12-06 05:39:09,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40867 conditions, 4653 events. 2540/4653 cut-off events. For 143372/143372 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 31696 event pairs, 550 based on Foata normal form. 1/4646 useless extension candidates. Maximal degree in co-relation 40706. Up to 3889 conditions per place. [2022-12-06 05:39:09,381 INFO L137 encePairwiseOnDemand]: 30/56 looper letters, 444 selfloop transitions, 152 changer transitions 13/609 dead transitions. [2022-12-06 05:39:09,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 609 transitions, 14575 flow [2022-12-06 05:39:09,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:39:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:39:09,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-12-06 05:39:09,382 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2602040816326531 [2022-12-06 05:39:09,382 INFO L175 Difference]: Start difference. First operand has 250 places, 564 transitions, 12922 flow. Second operand 7 states and 102 transitions. [2022-12-06 05:39:09,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 609 transitions, 14575 flow [2022-12-06 05:39:10,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 609 transitions, 14251 flow, removed 15 selfloop flow, removed 6 redundant places. [2022-12-06 05:39:10,072 INFO L231 Difference]: Finished difference. Result has 253 places, 569 transitions, 13024 flow [2022-12-06 05:39:10,073 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=12602, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=13024, PETRI_PLACES=253, PETRI_TRANSITIONS=569} [2022-12-06 05:39:10,073 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 224 predicate places. [2022-12-06 05:39:10,073 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:39:10,073 INFO L89 Accepts]: Start accepts. Operand has 253 places, 569 transitions, 13024 flow [2022-12-06 05:39:10,075 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:39:10,075 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:10,075 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 253 places, 569 transitions, 13024 flow [2022-12-06 05:39:10,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 252 places, 569 transitions, 13024 flow [2022-12-06 05:39:10,328 INFO L130 PetriNetUnfolder]: 553/1938 cut-off events. [2022-12-06 05:39:10,328 INFO L131 PetriNetUnfolder]: For 45137/45371 co-relation queries the response was YES. [2022-12-06 05:39:10,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13788 conditions, 1938 events. 553/1938 cut-off events. For 45137/45371 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 18421 event pairs, 18 based on Foata normal form. 27/1930 useless extension candidates. Maximal degree in co-relation 13652. Up to 340 conditions per place. [2022-12-06 05:39:10,354 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 252 places, 569 transitions, 13024 flow [2022-12-06 05:39:10,354 INFO L188 LiptonReduction]: Number of co-enabled transitions 2384 [2022-12-06 05:39:10,356 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:39:10,480 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:39:10,480 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 407 [2022-12-06 05:39:10,481 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 568 transitions, 13014 flow [2022-12-06 05:39:10,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:10,481 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:39:10,481 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:39:10,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-06 05:39:10,481 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:39:10,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:39:10,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1325186672, now seen corresponding path program 1 times [2022-12-06 05:39:10,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:39:10,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433792063] [2022-12-06 05:39:10,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:10,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:39:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:11,217 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 05:39:11,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:39:11,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433792063] [2022-12-06 05:39:11,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433792063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:39:11,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:39:11,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:39:11,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272629690] [2022-12-06 05:39:11,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:39:11,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:39:11,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:39:11,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:39:11,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:39:11,218 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 05:39:11,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 568 transitions, 13014 flow. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:11,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:39:11,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 05:39:11,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:39:12,661 INFO L130 PetriNetUnfolder]: 2540/4659 cut-off events. [2022-12-06 05:39:12,662 INFO L131 PetriNetUnfolder]: For 143390/143390 co-relation queries the response was YES. [2022-12-06 05:39:12,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40864 conditions, 4659 events. 2540/4659 cut-off events. For 143390/143390 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 31783 event pairs, 545 based on Foata normal form. 1/4652 useless extension candidates. Maximal degree in co-relation 40703. Up to 3867 conditions per place. [2022-12-06 05:39:12,706 INFO L137 encePairwiseOnDemand]: 31/57 looper letters, 445 selfloop transitions, 151 changer transitions 16/612 dead transitions. [2022-12-06 05:39:12,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 612 transitions, 14668 flow [2022-12-06 05:39:12,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:39:12,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:39:12,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-12-06 05:39:12,707 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2556390977443609 [2022-12-06 05:39:12,707 INFO L175 Difference]: Start difference. First operand has 251 places, 568 transitions, 13014 flow. Second operand 7 states and 102 transitions. [2022-12-06 05:39:12,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 612 transitions, 14668 flow [2022-12-06 05:39:13,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 612 transitions, 14386 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-12-06 05:39:13,413 INFO L231 Difference]: Finished difference. Result has 256 places, 569 transitions, 13075 flow [2022-12-06 05:39:13,413 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=12732, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=13075, PETRI_PLACES=256, PETRI_TRANSITIONS=569} [2022-12-06 05:39:13,413 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 227 predicate places. [2022-12-06 05:39:13,413 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:39:13,414 INFO L89 Accepts]: Start accepts. Operand has 256 places, 569 transitions, 13075 flow [2022-12-06 05:39:13,416 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:39:13,416 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:13,416 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 256 places, 569 transitions, 13075 flow [2022-12-06 05:39:13,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 254 places, 569 transitions, 13075 flow [2022-12-06 05:39:13,673 INFO L130 PetriNetUnfolder]: 551/1936 cut-off events. [2022-12-06 05:39:13,673 INFO L131 PetriNetUnfolder]: For 45651/45885 co-relation queries the response was YES. [2022-12-06 05:39:13,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13752 conditions, 1936 events. 551/1936 cut-off events. For 45651/45885 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 18402 event pairs, 18 based on Foata normal form. 27/1928 useless extension candidates. Maximal degree in co-relation 13615. Up to 339 conditions per place. [2022-12-06 05:39:13,701 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 254 places, 569 transitions, 13075 flow [2022-12-06 05:39:13,701 INFO L188 LiptonReduction]: Number of co-enabled transitions 2384 [2022-12-06 05:39:13,703 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:39:13,703 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 290 [2022-12-06 05:39:13,703 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 569 transitions, 13075 flow [2022-12-06 05:39:13,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:13,704 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:39:13,704 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:39:13,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-06 05:39:13,704 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:39:13,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:39:13,704 INFO L85 PathProgramCache]: Analyzing trace with hash 951065844, now seen corresponding path program 1 times [2022-12-06 05:39:13,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:39:13,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626650321] [2022-12-06 05:39:13,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:13,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:39:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:39:13,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:39:13,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626650321] [2022-12-06 05:39:13,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626650321] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:39:13,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:39:13,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:39:13,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197143022] [2022-12-06 05:39:13,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:39:13,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:39:13,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:39:13,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:39:13,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:39:13,761 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 05:39:13,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 569 transitions, 13075 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:13,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:39:13,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 05:39:13,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:39:14,877 INFO L130 PetriNetUnfolder]: 2466/4541 cut-off events. [2022-12-06 05:39:14,877 INFO L131 PetriNetUnfolder]: For 144247/144247 co-relation queries the response was YES. [2022-12-06 05:39:14,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39920 conditions, 4541 events. 2466/4541 cut-off events. For 144247/144247 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 30812 event pairs, 749 based on Foata normal form. 17/4550 useless extension candidates. Maximal degree in co-relation 39758. Up to 4511 conditions per place. [2022-12-06 05:39:14,922 INFO L137 encePairwiseOnDemand]: 51/56 looper letters, 553 selfloop transitions, 0 changer transitions 17/570 dead transitions. [2022-12-06 05:39:14,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 570 transitions, 14055 flow [2022-12-06 05:39:14,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:39:14,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:39:14,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-06 05:39:14,923 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3125 [2022-12-06 05:39:14,923 INFO L175 Difference]: Start difference. First operand has 254 places, 569 transitions, 13075 flow. Second operand 4 states and 70 transitions. [2022-12-06 05:39:14,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 570 transitions, 14055 flow [2022-12-06 05:39:15,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 570 transitions, 13728 flow, removed 17 selfloop flow, removed 6 redundant places. [2022-12-06 05:39:15,569 INFO L231 Difference]: Finished difference. Result has 251 places, 553 transitions, 12367 flow [2022-12-06 05:39:15,569 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=12541, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=12367, PETRI_PLACES=251, PETRI_TRANSITIONS=553} [2022-12-06 05:39:15,570 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 222 predicate places. [2022-12-06 05:39:15,570 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:39:15,570 INFO L89 Accepts]: Start accepts. Operand has 251 places, 553 transitions, 12367 flow [2022-12-06 05:39:15,572 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:39:15,572 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:15,572 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 251 places, 553 transitions, 12367 flow [2022-12-06 05:39:15,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 553 transitions, 12367 flow [2022-12-06 05:39:15,805 INFO L130 PetriNetUnfolder]: 538/1879 cut-off events. [2022-12-06 05:39:15,805 INFO L131 PetriNetUnfolder]: For 41722/41924 co-relation queries the response was YES. [2022-12-06 05:39:15,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13128 conditions, 1879 events. 538/1879 cut-off events. For 41722/41924 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 17664 event pairs, 17 based on Foata normal form. 30/1876 useless extension candidates. Maximal degree in co-relation 12961. Up to 329 conditions per place. [2022-12-06 05:39:15,829 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 245 places, 553 transitions, 12367 flow [2022-12-06 05:39:15,829 INFO L188 LiptonReduction]: Number of co-enabled transitions 2316 [2022-12-06 05:39:15,830 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:39:15,831 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 261 [2022-12-06 05:39:15,831 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 553 transitions, 12367 flow [2022-12-06 05:39:15,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:15,831 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:39:15,831 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 05:39:15,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-06 05:39:15,831 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:39:15,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:39:15,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1558787588, now seen corresponding path program 3 times [2022-12-06 05:39:15,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:39:15,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916989912] [2022-12-06 05:39:15,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:15,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:39:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:17,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:39:17,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:39:17,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916989912] [2022-12-06 05:39:17,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916989912] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:39:17,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012320956] [2022-12-06 05:39:17,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 05:39:17,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:39:17,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:39:17,005 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:39:17,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 05:39:17,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 05:39:17,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:39:17,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-06 05:39:17,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:39:17,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:39:17,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:39:17,530 INFO L321 Elim1Store]: treesize reduction 23, result has 14.8 percent of original size [2022-12-06 05:39:17,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 30 [2022-12-06 05:39:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:39:17,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012320956] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:39:17,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:39:17,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2022-12-06 05:39:17,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052197984] [2022-12-06 05:39:17,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:39:17,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 05:39:17,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:39:17,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 05:39:17,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2022-12-06 05:39:17,658 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 05:39:17,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 553 transitions, 12367 flow. Second operand has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 23 states have internal predecessors, (54), 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 05:39:17,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:39:17,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 05:39:17,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:39:21,227 INFO L130 PetriNetUnfolder]: 2808/5124 cut-off events. [2022-12-06 05:39:21,227 INFO L131 PetriNetUnfolder]: For 157525/157525 co-relation queries the response was YES. [2022-12-06 05:39:21,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45211 conditions, 5124 events. 2808/5124 cut-off events. For 157525/157525 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 35394 event pairs, 169 based on Foata normal form. 3/5119 useless extension candidates. Maximal degree in co-relation 44821. Up to 915 conditions per place. [2022-12-06 05:39:21,277 INFO L137 encePairwiseOnDemand]: 15/53 looper letters, 224 selfloop transitions, 525 changer transitions 35/784 dead transitions. [2022-12-06 05:39:21,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 784 transitions, 16833 flow [2022-12-06 05:39:21,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-06 05:39:21,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-06 05:39:21,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 252 transitions. [2022-12-06 05:39:21,278 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1761006289308176 [2022-12-06 05:39:21,278 INFO L175 Difference]: Start difference. First operand has 245 places, 553 transitions, 12367 flow. Second operand 27 states and 252 transitions. [2022-12-06 05:39:21,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 784 transitions, 16833 flow [2022-12-06 05:39:22,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 784 transitions, 16799 flow, removed 17 selfloop flow, removed 2 redundant places. [2022-12-06 05:39:22,124 INFO L231 Difference]: Finished difference. Result has 278 places, 637 transitions, 15789 flow [2022-12-06 05:39:22,124 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=12351, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=445, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=15789, PETRI_PLACES=278, PETRI_TRANSITIONS=637} [2022-12-06 05:39:22,124 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 249 predicate places. [2022-12-06 05:39:22,124 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:39:22,124 INFO L89 Accepts]: Start accepts. Operand has 278 places, 637 transitions, 15789 flow [2022-12-06 05:39:22,128 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:39:22,128 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:22,128 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 278 places, 637 transitions, 15789 flow [2022-12-06 05:39:22,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 637 transitions, 15789 flow [2022-12-06 05:39:22,470 INFO L130 PetriNetUnfolder]: 640/2135 cut-off events. [2022-12-06 05:39:22,471 INFO L131 PetriNetUnfolder]: For 60845/61035 co-relation queries the response was YES. [2022-12-06 05:39:22,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17035 conditions, 2135 events. 640/2135 cut-off events. For 60845/61035 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 20202 event pairs, 17 based on Foata normal form. 37/2141 useless extension candidates. Maximal degree in co-relation 16871. Up to 355 conditions per place. [2022-12-06 05:39:22,501 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 276 places, 637 transitions, 15789 flow [2022-12-06 05:39:22,501 INFO L188 LiptonReduction]: Number of co-enabled transitions 2656 [2022-12-06 05:39:22,503 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:39:22,673 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:39:22,839 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [726] L67-5-->thread2EXIT: Formula: (let ((.cse0 (mod v_~A~0_352 4294967296))) (and (= |v_thread2Thread1of1ForFork0_#res#1.base_147| 0) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_345| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork0_~x~1#1_358| (+ |v_thread2Thread1of1ForFork0_~x~1#1_359| v_~B~0_204)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_147| 0) (not (= (ite (and (< v_~end~0_649 v_~n~0_342) (<= 0 v_~end~0_649)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_157| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_157|) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_358| 4294967296) (mod (select (select |v_#memory_int_590| v_~queue~0.base_336) (+ (* v_~end~0_649 4) v_~queue~0.offset_336)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_157|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_157| 0)) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_344| 4294967296) .cse0)) (= |v_thread2Thread1of1ForFork0_~i~1#1_344| (+ |v_thread2Thread1of1ForFork0_~i~1#1_345| 1)) (= v_~end~0_648 (+ v_~end~0_649 1)))) InVars {~queue~0.offset=v_~queue~0.offset_336, ~A~0=v_~A~0_352, ~B~0=v_~B~0_204, #memory_int=|v_#memory_int_590|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_345|, ~end~0=v_~end~0_649, ~queue~0.base=v_~queue~0.base_336, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_359|, ~n~0=v_~n~0_342} OutVars{~queue~0.offset=v_~queue~0.offset_336, ~A~0=v_~A~0_352, ~B~0=v_~B~0_204, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_147|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_157|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_344|, ~queue~0.base=v_~queue~0.base_336, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_157|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_147|, #memory_int=|v_#memory_int_590|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_157|, ~end~0=v_~end~0_648, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_358|, ~n~0=v_~n~0_342, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_141|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_157|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_~x~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:39:22,965 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:39:22,966 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 842 [2022-12-06 05:39:22,966 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 634 transitions, 15791 flow [2022-12-06 05:39:22,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 23 states have internal predecessors, (54), 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 05:39:22,966 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:39:22,966 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 05:39:22,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 05:39:23,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:39:23,170 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:39:23,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:39:23,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1191078188, now seen corresponding path program 4 times [2022-12-06 05:39:23,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:39:23,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74566829] [2022-12-06 05:39:23,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:23,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:39:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:24,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:39:24,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:39:24,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74566829] [2022-12-06 05:39:24,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74566829] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:39:24,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067991443] [2022-12-06 05:39:24,041 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 05:39:24,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:39:24,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:39:24,042 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:39:24,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 05:39:24,169 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 05:39:24,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:39:24,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 05:39:24,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:39:24,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:39:24,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2022-12-06 05:39:24,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:39:24,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:39:24,495 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1803 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1803) c_~queue~0.base))) (or (not (= (mod (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) 4294967296) (mod |c_thread2Thread1of1ForFork0_~x~1#1| 4294967296))) (let ((.cse1 (* c_~start~0 4))) (= (mod (select .cse0 (+ .cse1 c_~queue~0.offset 4)) 4294967296) (mod (select .cse0 (+ .cse1 c_~queue~0.offset)) 4294967296)))))) is different from false [2022-12-06 05:39:24,506 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1803 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1803) c_~queue~0.base))) (or (let ((.cse1 (* c_~start~0 4))) (= (mod (select .cse0 (+ .cse1 c_~queue~0.offset 4)) 4294967296) (mod (select .cse0 (+ .cse1 c_~queue~0.offset)) 4294967296))) (not (= (mod (+ |c_thread2Thread1of1ForFork0_~x~1#1| c_~B~0) 4294967296) (mod (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) 4294967296)))))) is different from false [2022-12-06 05:39:24,541 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:39:24,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 134 [2022-12-06 05:39:24,562 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:39:24,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 68 [2022-12-06 05:39:24,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 05:39:24,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067991443] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:39:24,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:39:24,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-12-06 05:39:24,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821518338] [2022-12-06 05:39:24,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:39:24,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 05:39:24,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:39:24,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 05:39:24,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=443, Unknown=2, NotChecked=86, Total=600 [2022-12-06 05:39:24,808 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 05:39:24,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 634 transitions, 15791 flow. Second operand has 25 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 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 05:39:24,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:39:24,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 05:39:24,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:39:27,507 INFO L130 PetriNetUnfolder]: 2814/5139 cut-off events. [2022-12-06 05:39:27,507 INFO L131 PetriNetUnfolder]: For 208540/208540 co-relation queries the response was YES. [2022-12-06 05:39:27,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50741 conditions, 5139 events. 2814/5139 cut-off events. For 208540/208540 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 35444 event pairs, 535 based on Foata normal form. 3/5142 useless extension candidates. Maximal degree in co-relation 50552. Up to 3721 conditions per place. [2022-12-06 05:39:27,560 INFO L137 encePairwiseOnDemand]: 14/57 looper letters, 486 selfloop transitions, 229 changer transitions 35/750 dead transitions. [2022-12-06 05:39:27,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 750 transitions, 18615 flow [2022-12-06 05:39:27,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 05:39:27,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 05:39:27,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 180 transitions. [2022-12-06 05:39:27,561 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18575851393188855 [2022-12-06 05:39:27,561 INFO L175 Difference]: Start difference. First operand has 273 places, 634 transitions, 15791 flow. Second operand 17 states and 180 transitions. [2022-12-06 05:39:27,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 750 transitions, 18615 flow [2022-12-06 05:39:28,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 750 transitions, 17762 flow, removed 296 selfloop flow, removed 12 redundant places. [2022-12-06 05:39:28,925 INFO L231 Difference]: Finished difference. Result has 285 places, 641 transitions, 15713 flow [2022-12-06 05:39:28,925 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=15049, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=219, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=15713, PETRI_PLACES=285, PETRI_TRANSITIONS=641} [2022-12-06 05:39:28,926 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 256 predicate places. [2022-12-06 05:39:28,926 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:39:28,926 INFO L89 Accepts]: Start accepts. Operand has 285 places, 641 transitions, 15713 flow [2022-12-06 05:39:28,928 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:39:28,928 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:28,928 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 285 places, 641 transitions, 15713 flow [2022-12-06 05:39:28,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 282 places, 641 transitions, 15713 flow [2022-12-06 05:39:29,233 INFO L130 PetriNetUnfolder]: 650/2153 cut-off events. [2022-12-06 05:39:29,233 INFO L131 PetriNetUnfolder]: For 60357/60660 co-relation queries the response was YES. [2022-12-06 05:39:29,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17379 conditions, 2153 events. 650/2153 cut-off events. For 60357/60660 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 20261 event pairs, 21 based on Foata normal form. 43/2165 useless extension candidates. Maximal degree in co-relation 17250. Up to 489 conditions per place. [2022-12-06 05:39:29,264 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 282 places, 641 transitions, 15713 flow [2022-12-06 05:39:29,264 INFO L188 LiptonReduction]: Number of co-enabled transitions 2638 [2022-12-06 05:39:29,266 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:39:29,266 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 340 [2022-12-06 05:39:29,266 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 641 transitions, 15713 flow [2022-12-06 05:39:29,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 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 05:39:29,267 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:39:29,267 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:39:29,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 05:39:29,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-12-06 05:39:29,472 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:39:29,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:39:29,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1468750431, now seen corresponding path program 1 times [2022-12-06 05:39:29,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:39:29,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277091370] [2022-12-06 05:39:29,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:29,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:39:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:30,211 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 05:39:30,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:39:30,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277091370] [2022-12-06 05:39:30,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277091370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:39:30,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:39:30,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:39:30,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084877598] [2022-12-06 05:39:30,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:39:30,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:39:30,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:39:30,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:39:30,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:39:30,213 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 05:39:30,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 641 transitions, 15713 flow. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:30,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:39:30,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 05:39:30,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:39:31,957 INFO L130 PetriNetUnfolder]: 2779/5074 cut-off events. [2022-12-06 05:39:31,957 INFO L131 PetriNetUnfolder]: For 196429/196429 co-relation queries the response was YES. [2022-12-06 05:39:31,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50095 conditions, 5074 events. 2779/5074 cut-off events. For 196429/196429 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 35119 event pairs, 587 based on Foata normal form. 1/5075 useless extension candidates. Maximal degree in co-relation 49902. Up to 4276 conditions per place. [2022-12-06 05:39:32,015 INFO L137 encePairwiseOnDemand]: 20/56 looper letters, 499 selfloop transitions, 174 changer transitions 14/687 dead transitions. [2022-12-06 05:39:32,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 687 transitions, 17544 flow [2022-12-06 05:39:32,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:39:32,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:39:32,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2022-12-06 05:39:32,019 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2222222222222222 [2022-12-06 05:39:32,019 INFO L175 Difference]: Start difference. First operand has 282 places, 641 transitions, 15713 flow. Second operand 9 states and 112 transitions. [2022-12-06 05:39:32,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 687 transitions, 17544 flow [2022-12-06 05:39:33,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 687 transitions, 17163 flow, removed 36 selfloop flow, removed 11 redundant places. [2022-12-06 05:39:33,084 INFO L231 Difference]: Finished difference. Result has 282 places, 642 transitions, 15726 flow [2022-12-06 05:39:33,084 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=15332, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=641, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15726, PETRI_PLACES=282, PETRI_TRANSITIONS=642} [2022-12-06 05:39:33,084 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 253 predicate places. [2022-12-06 05:39:33,085 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:39:33,085 INFO L89 Accepts]: Start accepts. Operand has 282 places, 642 transitions, 15726 flow [2022-12-06 05:39:33,088 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:39:33,088 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:33,089 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 282 places, 642 transitions, 15726 flow [2022-12-06 05:39:33,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 280 places, 642 transitions, 15726 flow [2022-12-06 05:39:33,465 INFO L130 PetriNetUnfolder]: 650/2162 cut-off events. [2022-12-06 05:39:33,465 INFO L131 PetriNetUnfolder]: For 60325/60653 co-relation queries the response was YES. [2022-12-06 05:39:33,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17632 conditions, 2162 events. 650/2162 cut-off events. For 60325/60653 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 20582 event pairs, 20 based on Foata normal form. 42/2172 useless extension candidates. Maximal degree in co-relation 17507. Up to 493 conditions per place. [2022-12-06 05:39:33,497 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 280 places, 642 transitions, 15726 flow [2022-12-06 05:39:33,497 INFO L188 LiptonReduction]: Number of co-enabled transitions 2654 [2022-12-06 05:39:33,499 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:39:33,499 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 414 [2022-12-06 05:39:33,500 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 642 transitions, 15726 flow [2022-12-06 05:39:33,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:33,500 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:39:33,500 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 05:39:33,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-06 05:39:33,500 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:39:33,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:39:33,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1086721785, now seen corresponding path program 1 times [2022-12-06 05:39:33,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:39:33,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475290889] [2022-12-06 05:39:33,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:33,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:39:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:33,536 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 05:39:33,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:39:33,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475290889] [2022-12-06 05:39:33,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475290889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:39:33,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:39:33,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:39:33,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110465127] [2022-12-06 05:39:33,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:39:33,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:39:33,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:39:33,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:39:33,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:39:33,537 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 05:39:33,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 642 transitions, 15726 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:33,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:39:33,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 05:39:33,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:39:35,151 INFO L130 PetriNetUnfolder]: 2942/5383 cut-off events. [2022-12-06 05:39:35,151 INFO L131 PetriNetUnfolder]: For 205093/205093 co-relation queries the response was YES. [2022-12-06 05:39:35,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53158 conditions, 5383 events. 2942/5383 cut-off events. For 205093/205093 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 37844 event pairs, 693 based on Foata normal form. 13/5396 useless extension candidates. Maximal degree in co-relation 52993. Up to 3308 conditions per place. [2022-12-06 05:39:35,206 INFO L137 encePairwiseOnDemand]: 33/55 looper letters, 617 selfloop transitions, 125 changer transitions 7/749 dead transitions. [2022-12-06 05:39:35,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 749 transitions, 19067 flow [2022-12-06 05:39:35,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:39:35,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:39:35,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-12-06 05:39:35,207 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36818181818181817 [2022-12-06 05:39:35,207 INFO L175 Difference]: Start difference. First operand has 280 places, 642 transitions, 15726 flow. Second operand 4 states and 81 transitions. [2022-12-06 05:39:35,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 749 transitions, 19067 flow [2022-12-06 05:39:36,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 749 transitions, 18591 flow, removed 12 selfloop flow, removed 9 redundant places. [2022-12-06 05:39:36,196 INFO L231 Difference]: Finished difference. Result has 275 places, 637 transitions, 15518 flow [2022-12-06 05:39:36,197 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=15158, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=15518, PETRI_PLACES=275, PETRI_TRANSITIONS=637} [2022-12-06 05:39:36,197 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 246 predicate places. [2022-12-06 05:39:36,197 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:39:36,197 INFO L89 Accepts]: Start accepts. Operand has 275 places, 637 transitions, 15518 flow [2022-12-06 05:39:36,200 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:39:36,200 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:36,201 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 275 places, 637 transitions, 15518 flow [2022-12-06 05:39:36,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 637 transitions, 15518 flow [2022-12-06 05:39:36,540 INFO L130 PetriNetUnfolder]: 668/2283 cut-off events. [2022-12-06 05:39:36,540 INFO L131 PetriNetUnfolder]: For 57304/57606 co-relation queries the response was YES. [2022-12-06 05:39:36,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18229 conditions, 2283 events. 668/2283 cut-off events. For 57304/57606 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 22284 event pairs, 22 based on Foata normal form. 34/2283 useless extension candidates. Maximal degree in co-relation 17843. Up to 533 conditions per place. [2022-12-06 05:39:36,579 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 275 places, 637 transitions, 15518 flow [2022-12-06 05:39:36,580 INFO L188 LiptonReduction]: Number of co-enabled transitions 2638 [2022-12-06 05:39:36,581 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:39:36,582 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 385 [2022-12-06 05:39:36,582 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 637 transitions, 15518 flow [2022-12-06 05:39:36,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:36,582 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:39:36,582 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 05:39:36,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-06 05:39:36,582 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:39:36,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:39:36,582 INFO L85 PathProgramCache]: Analyzing trace with hash 751443402, now seen corresponding path program 1 times [2022-12-06 05:39:36,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:39:36,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514110902] [2022-12-06 05:39:36,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:36,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:39:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:36,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:39:36,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:39:36,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514110902] [2022-12-06 05:39:36,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514110902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:39:36,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:39:36,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:39:36,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041314317] [2022-12-06 05:39:36,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:39:36,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:39:36,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:39:36,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:39:36,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:39:36,631 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 05:39:36,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 637 transitions, 15518 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:36,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:39:36,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 05:39:36,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:39:38,111 INFO L130 PetriNetUnfolder]: 2956/5394 cut-off events. [2022-12-06 05:39:38,112 INFO L131 PetriNetUnfolder]: For 196913/196913 co-relation queries the response was YES. [2022-12-06 05:39:38,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53155 conditions, 5394 events. 2956/5394 cut-off events. For 196913/196913 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 37900 event pairs, 720 based on Foata normal form. 11/5401 useless extension candidates. Maximal degree in co-relation 52128. Up to 3319 conditions per place. [2022-12-06 05:39:38,164 INFO L137 encePairwiseOnDemand]: 36/52 looper letters, 680 selfloop transitions, 69 changer transitions 1/750 dead transitions. [2022-12-06 05:39:38,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 750 transitions, 18972 flow [2022-12-06 05:39:38,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:39:38,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:39:38,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-06 05:39:38,165 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36538461538461536 [2022-12-06 05:39:38,166 INFO L175 Difference]: Start difference. First operand has 275 places, 637 transitions, 15518 flow. Second operand 4 states and 76 transitions. [2022-12-06 05:39:38,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 750 transitions, 18972 flow [2022-12-06 05:39:39,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 750 transitions, 18671 flow, removed 22 selfloop flow, removed 3 redundant places. [2022-12-06 05:39:39,208 INFO L231 Difference]: Finished difference. Result has 276 places, 640 transitions, 15444 flow [2022-12-06 05:39:39,208 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=15244, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=15444, PETRI_PLACES=276, PETRI_TRANSITIONS=640} [2022-12-06 05:39:39,209 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 247 predicate places. [2022-12-06 05:39:39,210 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:39:39,210 INFO L89 Accepts]: Start accepts. Operand has 276 places, 640 transitions, 15444 flow [2022-12-06 05:39:39,212 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:39:39,212 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:39,212 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 276 places, 640 transitions, 15444 flow [2022-12-06 05:39:39,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 640 transitions, 15444 flow [2022-12-06 05:39:39,598 INFO L130 PetriNetUnfolder]: 679/2298 cut-off events. [2022-12-06 05:39:39,598 INFO L131 PetriNetUnfolder]: For 56780/57099 co-relation queries the response was YES. [2022-12-06 05:39:39,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18346 conditions, 2298 events. 679/2298 cut-off events. For 56780/57099 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 22332 event pairs, 21 based on Foata normal form. 43/2306 useless extension candidates. Maximal degree in co-relation 17994. Up to 533 conditions per place. [2022-12-06 05:39:39,636 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 276 places, 640 transitions, 15444 flow [2022-12-06 05:39:39,636 INFO L188 LiptonReduction]: Number of co-enabled transitions 2650 [2022-12-06 05:39:39,637 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:39:39,646 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 436 [2022-12-06 05:39:39,646 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 640 transitions, 15444 flow [2022-12-06 05:39:39,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:39,646 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:39:39,646 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 05:39:39,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-06 05:39:39,647 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:39:39,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:39:39,647 INFO L85 PathProgramCache]: Analyzing trace with hash -691240433, now seen corresponding path program 1 times [2022-12-06 05:39:39,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:39:39,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748979003] [2022-12-06 05:39:39,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:39,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:39:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:39,745 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 05:39:39,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:39:39,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748979003] [2022-12-06 05:39:39,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748979003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:39:39,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:39:39,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:39:39,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462376827] [2022-12-06 05:39:39,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:39:39,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:39:39,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:39:39,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:39:39,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:39:39,747 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 05:39:39,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 640 transitions, 15444 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:39,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:39:39,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 05:39:39,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:39:41,422 INFO L130 PetriNetUnfolder]: 3188/5812 cut-off events. [2022-12-06 05:39:41,423 INFO L131 PetriNetUnfolder]: For 200774/200774 co-relation queries the response was YES. [2022-12-06 05:39:41,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56407 conditions, 5812 events. 3188/5812 cut-off events. For 200774/200774 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 41293 event pairs, 618 based on Foata normal form. 32/5836 useless extension candidates. Maximal degree in co-relation 55301. Up to 4716 conditions per place. [2022-12-06 05:39:41,475 INFO L137 encePairwiseOnDemand]: 28/52 looper letters, 717 selfloop transitions, 46 changer transitions 0/763 dead transitions. [2022-12-06 05:39:41,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 763 transitions, 19151 flow [2022-12-06 05:39:41,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:39:41,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:39:41,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-12-06 05:39:41,476 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41346153846153844 [2022-12-06 05:39:41,476 INFO L175 Difference]: Start difference. First operand has 276 places, 640 transitions, 15444 flow. Second operand 4 states and 86 transitions. [2022-12-06 05:39:41,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 763 transitions, 19151 flow [2022-12-06 05:39:42,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 763 transitions, 19069 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-06 05:39:42,616 INFO L231 Difference]: Finished difference. Result has 280 places, 657 transitions, 15888 flow [2022-12-06 05:39:42,617 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=15362, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=594, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=15888, PETRI_PLACES=280, PETRI_TRANSITIONS=657} [2022-12-06 05:39:42,617 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 251 predicate places. [2022-12-06 05:39:42,617 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:39:42,617 INFO L89 Accepts]: Start accepts. Operand has 280 places, 657 transitions, 15888 flow [2022-12-06 05:39:42,620 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:39:42,620 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:42,620 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 280 places, 657 transitions, 15888 flow [2022-12-06 05:39:42,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 280 places, 657 transitions, 15888 flow [2022-12-06 05:39:43,068 INFO L130 PetriNetUnfolder]: 737/2495 cut-off events. [2022-12-06 05:39:43,068 INFO L131 PetriNetUnfolder]: For 62179/62514 co-relation queries the response was YES. [2022-12-06 05:39:43,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19846 conditions, 2495 events. 737/2495 cut-off events. For 62179/62514 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 24588 event pairs, 23 based on Foata normal form. 51/2512 useless extension candidates. Maximal degree in co-relation 19445. Up to 589 conditions per place. [2022-12-06 05:39:43,104 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 280 places, 657 transitions, 15888 flow [2022-12-06 05:39:43,105 INFO L188 LiptonReduction]: Number of co-enabled transitions 2716 [2022-12-06 05:39:43,118 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [600] L51-5-->L51-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_28| 1) |v_thread1Thread1of1ForFork2_~i~0#1_27|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_28| 4294967296) (mod v_~A~0_57 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_31| (+ |v_thread1Thread1of1ForFork2_~x~0#1_32| v_~B~0_47))) InVars {~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_32|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_28|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_31|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [711] $Ultimate##0-->L51-5: Formula: (and (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_232| 4294967296) (mod v_~A~0_322 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_236| (+ |v_thread1Thread1of1ForFork2_~x~0#1_237| v_~B~0_192)) (= |v_thread2Thread1of1ForFork0_~i~1#1_309| 1) (= |v_thread2Thread1of1ForFork0_~x~1#1_322| v_~B~0_192) (= |v_thread1Thread1of1ForFork2_~i~0#1_231| (+ |v_thread1Thread1of1ForFork2_~i~0#1_232| 1))) InVars {~A~0=v_~A~0_322, ~B~0=v_~B~0_192, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_237|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_232|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_83|, ~A~0=v_~A~0_322, ~B~0=v_~B~0_192, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_236|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_231|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_309|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_127|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_322|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 05:39:43,169 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [691] $Ultimate##0-->L51-5: Formula: (and (< (mod (+ |v_thread1Thread1of1ForFork2_~i~0#1_200| 4294967295) 4294967296) (mod v_~A~0_282 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_205| v_~B~0_156) (= |v_thread1Thread1of1ForFork2_~i~0#1_200| 1)) InVars {~A~0=v_~A~0_282, ~B~0=v_~B~0_156} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_74|, ~A~0=v_~A~0_282, ~B~0=v_~B~0_156, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_205|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_200|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [711] $Ultimate##0-->L51-5: Formula: (and (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_232| 4294967296) (mod v_~A~0_322 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_236| (+ |v_thread1Thread1of1ForFork2_~x~0#1_237| v_~B~0_192)) (= |v_thread2Thread1of1ForFork0_~i~1#1_309| 1) (= |v_thread2Thread1of1ForFork0_~x~1#1_322| v_~B~0_192) (= |v_thread1Thread1of1ForFork2_~i~0#1_231| (+ |v_thread1Thread1of1ForFork2_~i~0#1_232| 1))) InVars {~A~0=v_~A~0_322, ~B~0=v_~B~0_192, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_237|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_232|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_83|, ~A~0=v_~A~0_322, ~B~0=v_~B~0_192, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_236|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_231|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_309|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_127|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_322|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 05:39:43,220 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [711] $Ultimate##0-->L51-5: Formula: (and (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_232| 4294967296) (mod v_~A~0_322 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_236| (+ |v_thread1Thread1of1ForFork2_~x~0#1_237| v_~B~0_192)) (= |v_thread2Thread1of1ForFork0_~i~1#1_309| 1) (= |v_thread2Thread1of1ForFork0_~x~1#1_322| v_~B~0_192) (= |v_thread1Thread1of1ForFork2_~i~0#1_231| (+ |v_thread1Thread1of1ForFork2_~i~0#1_232| 1))) InVars {~A~0=v_~A~0_322, ~B~0=v_~B~0_192, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_237|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_232|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_83|, ~A~0=v_~A~0_322, ~B~0=v_~B~0_192, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_236|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_231|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_309|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_127|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_322|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 05:39:43,272 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [669] $Ultimate##0-->L51-5: Formula: (and (= |v_thread1Thread1of1ForFork2_~x~0#1_186| (* 2 v_~B~0_126)) (= |v_thread1Thread1of1ForFork2_~i~0#1_181| 2) (< (mod (+ |v_thread1Thread1of1ForFork2_~i~0#1_181| 4294967295) 4294967296) (mod v_~A~0_240 4294967296))) InVars {~A~0=v_~A~0_240, ~B~0=v_~B~0_126} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_59|, ~A~0=v_~A~0_240, ~B~0=v_~B~0_126, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_186|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_181|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [711] $Ultimate##0-->L51-5: Formula: (and (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_232| 4294967296) (mod v_~A~0_322 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_236| (+ |v_thread1Thread1of1ForFork2_~x~0#1_237| v_~B~0_192)) (= |v_thread2Thread1of1ForFork0_~i~1#1_309| 1) (= |v_thread2Thread1of1ForFork0_~x~1#1_322| v_~B~0_192) (= |v_thread1Thread1of1ForFork2_~i~0#1_231| (+ |v_thread1Thread1of1ForFork2_~i~0#1_232| 1))) InVars {~A~0=v_~A~0_322, ~B~0=v_~B~0_192, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_237|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_232|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_83|, ~A~0=v_~A~0_322, ~B~0=v_~B~0_192, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_236|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_231|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_309|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_127|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_322|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 05:39:43,326 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [724] L67-5-->L67-5: Formula: (let ((.cse0 (mod v_~A~0_348 4294967296))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork0_~i~1#1_334|) 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_336| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork0_~x~1#1_348| (+ (* 2 v_~B~0_200) |v_thread2Thread1of1ForFork0_~x~1#1_350|)) (= (+ 2 |v_thread2Thread1of1ForFork0_~i~1#1_336|) |v_thread2Thread1of1ForFork0_~i~1#1_334|))) InVars {~A~0=v_~A~0_348, ~B~0=v_~B~0_200, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_336|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_350|} OutVars{~A~0=v_~A~0_348, ~B~0=v_~B~0_200, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_334|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_135|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_348|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [711] $Ultimate##0-->L51-5: Formula: (and (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_232| 4294967296) (mod v_~A~0_322 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_236| (+ |v_thread1Thread1of1ForFork2_~x~0#1_237| v_~B~0_192)) (= |v_thread2Thread1of1ForFork0_~i~1#1_309| 1) (= |v_thread2Thread1of1ForFork0_~x~1#1_322| v_~B~0_192) (= |v_thread1Thread1of1ForFork2_~i~0#1_231| (+ |v_thread1Thread1of1ForFork2_~i~0#1_232| 1))) InVars {~A~0=v_~A~0_322, ~B~0=v_~B~0_192, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_237|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_232|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_83|, ~A~0=v_~A~0_322, ~B~0=v_~B~0_192, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_236|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_231|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_309|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_127|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_322|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 05:39:43,386 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [725] L67-5-->L104-3: Formula: (and (= (store |v_#memory_int_587| |v_ULTIMATE.start_main_~#t3~0#1.base_202| (store (select |v_#memory_int_587| |v_ULTIMATE.start_main_~#t3~0#1.base_202|) |v_ULTIMATE.start_main_~#t3~0#1.offset_184| |v_ULTIMATE.start_main_#t~pre18#1_194|)) |v_#memory_int_586|) (= |v_thread2Thread1of1ForFork0_~i~1#1_340| (+ |v_thread2Thread1of1ForFork0_~i~1#1_341| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_194| |v_#pthreadsForks_373|) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_341| 4294967296) (mod v_~A~0_350 4294967296)) (= |v_thread2Thread1of1ForFork0_~x~1#1_354| (+ |v_thread2Thread1of1ForFork0_~x~1#1_355| v_~B~0_202)) (= |v_#pthreadsForks_372| (+ |v_#pthreadsForks_373| 1))) InVars {~A~0=v_~A~0_350, #pthreadsForks=|v_#pthreadsForks_373|, ~B~0=v_~B~0_202, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_184|, #memory_int=|v_#memory_int_587|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_202|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_341|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_355|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_194|, ~A~0=v_~A~0_350, #pthreadsForks=|v_#pthreadsForks_372|, ~B~0=v_~B~0_202, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_184|, #memory_int=|v_#memory_int_586|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_202|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_206|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_340|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_175|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_139|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_354|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread2Thread1of1ForFork0_~i~1#1, ULTIMATE.start_main_#t~nondet17#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [711] $Ultimate##0-->L51-5: Formula: (and (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_232| 4294967296) (mod v_~A~0_322 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_236| (+ |v_thread1Thread1of1ForFork2_~x~0#1_237| v_~B~0_192)) (= |v_thread2Thread1of1ForFork0_~i~1#1_309| 1) (= |v_thread2Thread1of1ForFork0_~x~1#1_322| v_~B~0_192) (= |v_thread1Thread1of1ForFork2_~i~0#1_231| (+ |v_thread1Thread1of1ForFork2_~i~0#1_232| 1))) InVars {~A~0=v_~A~0_322, ~B~0=v_~B~0_192, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_237|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_232|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_83|, ~A~0=v_~A~0_322, ~B~0=v_~B~0_192, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_236|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_231|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_309|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_127|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_322|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 05:39:43,449 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [600] L51-5-->L51-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_28| 1) |v_thread1Thread1of1ForFork2_~i~0#1_27|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_28| 4294967296) (mod v_~A~0_57 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_31| (+ |v_thread1Thread1of1ForFork2_~x~0#1_32| v_~B~0_47))) InVars {~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_32|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_28|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_31|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [711] $Ultimate##0-->L51-5: Formula: (and (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_232| 4294967296) (mod v_~A~0_322 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_236| (+ |v_thread1Thread1of1ForFork2_~x~0#1_237| v_~B~0_192)) (= |v_thread2Thread1of1ForFork0_~i~1#1_309| 1) (= |v_thread2Thread1of1ForFork0_~x~1#1_322| v_~B~0_192) (= |v_thread1Thread1of1ForFork2_~i~0#1_231| (+ |v_thread1Thread1of1ForFork2_~i~0#1_232| 1))) InVars {~A~0=v_~A~0_322, ~B~0=v_~B~0_192, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_237|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_232|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_83|, ~A~0=v_~A~0_322, ~B~0=v_~B~0_192, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_236|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_231|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_309|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_127|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_322|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 05:39:43,501 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [703] L67-5-->L67-5: Formula: (let ((.cse0 (mod v_~A~0_306 4294967296))) (and (= |v_thread2Thread1of1ForFork0_~x~1#1_290| (+ |v_thread2Thread1of1ForFork0_~x~1#1_292| (* 2 v_~B~0_178))) (= |v_thread2Thread1of1ForFork0_~i~1#1_277| (+ 2 |v_thread2Thread1of1ForFork0_~i~1#1_279|)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_279| 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork0_~i~1#1_277|) 4294967296) .cse0))) InVars {~A~0=v_~A~0_306, ~B~0=v_~B~0_178, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_279|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_292|} OutVars{~A~0=v_~A~0_306, ~B~0=v_~B~0_178, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_277|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_111|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_290|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [711] $Ultimate##0-->L51-5: Formula: (and (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_232| 4294967296) (mod v_~A~0_322 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_236| (+ |v_thread1Thread1of1ForFork2_~x~0#1_237| v_~B~0_192)) (= |v_thread2Thread1of1ForFork0_~i~1#1_309| 1) (= |v_thread2Thread1of1ForFork0_~x~1#1_322| v_~B~0_192) (= |v_thread1Thread1of1ForFork2_~i~0#1_231| (+ |v_thread1Thread1of1ForFork2_~i~0#1_232| 1))) InVars {~A~0=v_~A~0_322, ~B~0=v_~B~0_192, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_237|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_232|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_83|, ~A~0=v_~A~0_322, ~B~0=v_~B~0_192, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_236|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_231|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_309|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_127|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_322|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 05:39:43,564 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [600] L51-5-->L51-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_28| 1) |v_thread1Thread1of1ForFork2_~i~0#1_27|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_28| 4294967296) (mod v_~A~0_57 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_31| (+ |v_thread1Thread1of1ForFork2_~x~0#1_32| v_~B~0_47))) InVars {~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_32|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_28|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_31|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [711] $Ultimate##0-->L51-5: Formula: (and (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_232| 4294967296) (mod v_~A~0_322 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_236| (+ |v_thread1Thread1of1ForFork2_~x~0#1_237| v_~B~0_192)) (= |v_thread2Thread1of1ForFork0_~i~1#1_309| 1) (= |v_thread2Thread1of1ForFork0_~x~1#1_322| v_~B~0_192) (= |v_thread1Thread1of1ForFork2_~i~0#1_231| (+ |v_thread1Thread1of1ForFork2_~i~0#1_232| 1))) InVars {~A~0=v_~A~0_322, ~B~0=v_~B~0_192, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_237|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_232|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_83|, ~A~0=v_~A~0_322, ~B~0=v_~B~0_192, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_236|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_231|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_309|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_127|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_322|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 05:39:43,614 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [701] L67-5-->thread1EXIT: Formula: (let ((.cse0 (mod v_~A~0_302 4294967296))) (and (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_270| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_93| 0)) (= v_~end~0_576 (+ v_~end~0_577 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_93| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (< v_~end~0_577 v_~n~0_308) (<= 0 v_~end~0_577)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~x~1#1_282| (+ |v_thread2Thread1of1ForFork0_~x~1#1_283| v_~B~0_174)) (= |v_thread1Thread1of1ForFork2_#res#1.base_91| 0) (= |v_thread1Thread1of1ForFork2_#res#1.offset_91| 0) (= (ite (= (mod (select (select |v_#memory_int_538| v_~queue~0.base_302) (+ (* v_~end~0_577 4) v_~queue~0.offset_302)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_224| 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_93|) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_219| 4294967296) .cse0)) (= |v_thread2Thread1of1ForFork0_~i~1#1_269| (+ |v_thread2Thread1of1ForFork0_~i~1#1_270| 1)))) InVars {~queue~0.offset=v_~queue~0.offset_302, ~A~0=v_~A~0_302, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_224|, ~B~0=v_~B~0_174, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_219|, #memory_int=|v_#memory_int_538|, ~end~0=v_~end~0_577, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_270|, ~queue~0.base=v_~queue~0.base_302, ~n~0=v_~n~0_308, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_283|} OutVars{~queue~0.offset=v_~queue~0.offset_302, ~A~0=v_~A~0_302, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_224|, ~B~0=v_~B~0_174, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_93|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_269|, ~queue~0.base=v_~queue~0.base_302, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_93|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_219|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_93|, #memory_int=|v_#memory_int_538|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_91|, ~end~0=v_~end~0_576, ~n~0=v_~n~0_308, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_107|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_282|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_91|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_93|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [711] $Ultimate##0-->L51-5: Formula: (and (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_232| 4294967296) (mod v_~A~0_322 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_236| (+ |v_thread1Thread1of1ForFork2_~x~0#1_237| v_~B~0_192)) (= |v_thread2Thread1of1ForFork0_~i~1#1_309| 1) (= |v_thread2Thread1of1ForFork0_~x~1#1_322| v_~B~0_192) (= |v_thread1Thread1of1ForFork2_~i~0#1_231| (+ |v_thread1Thread1of1ForFork2_~i~0#1_232| 1))) InVars {~A~0=v_~A~0_322, ~B~0=v_~B~0_192, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_237|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_232|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_83|, ~A~0=v_~A~0_322, ~B~0=v_~B~0_192, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_236|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_231|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_309|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_127|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_322|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 05:39:43,619 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [693] $Ultimate##0-->L51-5: Formula: (and (< (mod (+ |v_thread1Thread1of1ForFork2_~i~0#1_206| 4294967295) 4294967296) (mod v_~A~0_286 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_211| v_~B~0_158) (= |v_thread1Thread1of1ForFork2_~i~0#1_206| 1)) InVars {~A~0=v_~A~0_286, ~B~0=v_~B~0_158} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_76|, ~A~0=v_~A~0_286, ~B~0=v_~B~0_158, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_211|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_206|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [711] $Ultimate##0-->L51-5: Formula: (and (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_232| 4294967296) (mod v_~A~0_322 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_236| (+ |v_thread1Thread1of1ForFork2_~x~0#1_237| v_~B~0_192)) (= |v_thread2Thread1of1ForFork0_~i~1#1_309| 1) (= |v_thread2Thread1of1ForFork0_~x~1#1_322| v_~B~0_192) (= |v_thread1Thread1of1ForFork2_~i~0#1_231| (+ |v_thread1Thread1of1ForFork2_~i~0#1_232| 1))) InVars {~A~0=v_~A~0_322, ~B~0=v_~B~0_192, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_237|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_232|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_83|, ~A~0=v_~A~0_322, ~B~0=v_~B~0_192, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_236|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_231|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_309|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_127|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_322|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 05:39:43,668 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [705] L67-5-->thread1EXIT: Formula: (let ((.cse0 (mod v_~A~0_310 4294967296))) (and (= v_~end~0_584 (+ v_~end~0_585 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_288| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_95| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_95|) (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_288| 1) |v_thread2Thread1of1ForFork0_~i~1#1_287|) (not (= (ite (and (< v_~end~0_585 v_~n~0_312) (<= 0 v_~end~0_585)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_95| 0)) (= |v_thread2Thread1of1ForFork0_~x~1#1_300| (+ |v_thread2Thread1of1ForFork0_~x~1#1_301| v_~B~0_182)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_225| 4294967296) .cse0)) (= (ite (= (mod (select (select |v_#memory_int_542| v_~queue~0.base_306) (+ v_~queue~0.offset_306 (* v_~end~0_585 4))) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_230| 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_95|) (= |v_thread1Thread1of1ForFork2_#res#1.base_93| 0) (= |v_thread1Thread1of1ForFork2_#res#1.offset_93| 0))) InVars {~queue~0.offset=v_~queue~0.offset_306, ~A~0=v_~A~0_310, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_230|, ~B~0=v_~B~0_182, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_225|, #memory_int=|v_#memory_int_542|, ~end~0=v_~end~0_585, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_288|, ~queue~0.base=v_~queue~0.base_306, ~n~0=v_~n~0_312, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_301|} OutVars{~queue~0.offset=v_~queue~0.offset_306, ~A~0=v_~A~0_310, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_230|, ~B~0=v_~B~0_182, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_95|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_287|, ~queue~0.base=v_~queue~0.base_306, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_95|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_225|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_95|, #memory_int=|v_#memory_int_542|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_93|, ~end~0=v_~end~0_584, ~n~0=v_~n~0_312, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_117|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_300|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_93|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_95|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [711] $Ultimate##0-->L51-5: Formula: (and (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_232| 4294967296) (mod v_~A~0_322 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_236| (+ |v_thread1Thread1of1ForFork2_~x~0#1_237| v_~B~0_192)) (= |v_thread2Thread1of1ForFork0_~i~1#1_309| 1) (= |v_thread2Thread1of1ForFork0_~x~1#1_322| v_~B~0_192) (= |v_thread1Thread1of1ForFork2_~i~0#1_231| (+ |v_thread1Thread1of1ForFork2_~i~0#1_232| 1))) InVars {~A~0=v_~A~0_322, ~B~0=v_~B~0_192, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_237|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_232|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_83|, ~A~0=v_~A~0_322, ~B~0=v_~B~0_192, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_236|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_231|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_309|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_127|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_322|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 05:39:43,676 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:39:43,677 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1060 [2022-12-06 05:39:43,677 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 658 transitions, 16187 flow [2022-12-06 05:39:43,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:43,677 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:39:43,677 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 05:39:43,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-12-06 05:39:43,677 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:39:43,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:39:43,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1501012330, now seen corresponding path program 1 times [2022-12-06 05:39:43,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:39:43,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569249255] [2022-12-06 05:39:43,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:43,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:39:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:43,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:39:43,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:39:43,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569249255] [2022-12-06 05:39:43,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569249255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:39:43,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:39:43,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:39:43,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413259027] [2022-12-06 05:39:43,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:39:43,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:39:43,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:39:43,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:39:43,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:39:43,741 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 05:39:43,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 658 transitions, 16187 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:43,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:39:43,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 05:39:43,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:39:45,682 INFO L130 PetriNetUnfolder]: 3741/6843 cut-off events. [2022-12-06 05:39:45,682 INFO L131 PetriNetUnfolder]: For 256069/256069 co-relation queries the response was YES. [2022-12-06 05:39:45,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67559 conditions, 6843 events. 3741/6843 cut-off events. For 256069/256069 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 50444 event pairs, 910 based on Foata normal form. 11/6854 useless extension candidates. Maximal degree in co-relation 66265. Up to 4392 conditions per place. [2022-12-06 05:39:45,754 INFO L137 encePairwiseOnDemand]: 48/63 looper letters, 679 selfloop transitions, 64 changer transitions 8/751 dead transitions. [2022-12-06 05:39:45,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 751 transitions, 18901 flow [2022-12-06 05:39:45,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:39:45,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:39:45,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-06 05:39:45,756 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29365079365079366 [2022-12-06 05:39:45,756 INFO L175 Difference]: Start difference. First operand has 281 places, 658 transitions, 16187 flow. Second operand 4 states and 74 transitions. [2022-12-06 05:39:45,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 751 transitions, 18901 flow [2022-12-06 05:39:47,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 751 transitions, 18878 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-06 05:39:47,254 INFO L231 Difference]: Finished difference. Result has 283 places, 641 transitions, 15626 flow [2022-12-06 05:39:47,255 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=15611, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=644, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=15626, PETRI_PLACES=283, PETRI_TRANSITIONS=641} [2022-12-06 05:39:47,255 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 254 predicate places. [2022-12-06 05:39:47,255 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:39:47,255 INFO L89 Accepts]: Start accepts. Operand has 283 places, 641 transitions, 15626 flow [2022-12-06 05:39:47,258 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:39:47,258 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:47,258 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 283 places, 641 transitions, 15626 flow [2022-12-06 05:39:47,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 282 places, 641 transitions, 15626 flow [2022-12-06 05:39:47,672 INFO L130 PetriNetUnfolder]: 852/2933 cut-off events. [2022-12-06 05:39:47,672 INFO L131 PetriNetUnfolder]: For 75481/75930 co-relation queries the response was YES. [2022-12-06 05:39:47,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23495 conditions, 2933 events. 852/2933 cut-off events. For 75481/75930 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 30198 event pairs, 25 based on Foata normal form. 55/2951 useless extension candidates. Maximal degree in co-relation 23044. Up to 702 conditions per place. [2022-12-06 05:39:47,717 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 282 places, 641 transitions, 15626 flow [2022-12-06 05:39:47,717 INFO L188 LiptonReduction]: Number of co-enabled transitions 2630 [2022-12-06 05:39:47,719 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [729] $Ultimate##0-->L51-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~x~1#1_372| v_~B~0_210) (= |v_thread1Thread1of1ForFork2_~x~0#1_267| (* 2 v_~B~0_210)) (< (mod (+ |v_thread1Thread1of1ForFork2_~i~0#1_262| 4294967295) 4294967296) (mod v_~A~0_358 4294967296)) (= |v_thread2Thread1of1ForFork0_~i~1#1_357| 1) (= |v_thread1Thread1of1ForFork2_~i~0#1_262| 2)) InVars {~A~0=v_~A~0_358, ~B~0=v_~B~0_210} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_94|, ~A~0=v_~A~0_358, ~B~0=v_~B~0_210, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_267|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_262|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_357|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_149|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_372|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [702] L67-5-->thread2EXIT: Formula: (let ((.cse0 (mod v_~A~0_304 4294967296))) (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_143|) (= |v_thread2Thread1of1ForFork0_#res#1.base_133| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_133| 0) (= v_~end~0_580 (+ v_~end~0_581 1)) (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_274| 1) |v_thread2Thread1of1ForFork0_~i~1#1_273|) (= |v_thread2Thread1of1ForFork0_~x~1#1_286| (+ |v_thread2Thread1of1ForFork0_~x~1#1_287| v_~B~0_176)) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_273| 4294967296) .cse0)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| 0)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_274| 4294967296) .cse0) (not (= (ite (and (<= 0 v_~end~0_581) (< v_~end~0_581 v_~n~0_310)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_143| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_286| 4294967296) (mod (select (select |v_#memory_int_540| v_~queue~0.base_304) (+ (* v_~end~0_581 4) v_~queue~0.offset_304)) 4294967296)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_304, ~A~0=v_~A~0_304, ~B~0=v_~B~0_176, #memory_int=|v_#memory_int_540|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_274|, ~end~0=v_~end~0_581, ~queue~0.base=v_~queue~0.base_304, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_287|, ~n~0=v_~n~0_310} OutVars{~queue~0.offset=v_~queue~0.offset_304, ~A~0=v_~A~0_304, ~B~0=v_~B~0_176, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_133|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_143|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_273|, ~queue~0.base=v_~queue~0.base_304, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_133|, #memory_int=|v_#memory_int_540|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_143|, ~end~0=v_~end~0_580, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_286|, ~n~0=v_~n~0_310, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_109|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_143|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_~x~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 05:39:47,909 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [729] $Ultimate##0-->L51-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~x~1#1_372| v_~B~0_210) (= |v_thread1Thread1of1ForFork2_~x~0#1_267| (* 2 v_~B~0_210)) (< (mod (+ |v_thread1Thread1of1ForFork2_~i~0#1_262| 4294967295) 4294967296) (mod v_~A~0_358 4294967296)) (= |v_thread2Thread1of1ForFork0_~i~1#1_357| 1) (= |v_thread1Thread1of1ForFork2_~i~0#1_262| 2)) InVars {~A~0=v_~A~0_358, ~B~0=v_~B~0_210} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_94|, ~A~0=v_~A~0_358, ~B~0=v_~B~0_210, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_267|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_262|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_357|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_149|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_372|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [701] L67-5-->thread1EXIT: Formula: (let ((.cse0 (mod v_~A~0_302 4294967296))) (and (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_270| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_93| 0)) (= v_~end~0_576 (+ v_~end~0_577 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_93| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (< v_~end~0_577 v_~n~0_308) (<= 0 v_~end~0_577)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~x~1#1_282| (+ |v_thread2Thread1of1ForFork0_~x~1#1_283| v_~B~0_174)) (= |v_thread1Thread1of1ForFork2_#res#1.base_91| 0) (= |v_thread1Thread1of1ForFork2_#res#1.offset_91| 0) (= (ite (= (mod (select (select |v_#memory_int_538| v_~queue~0.base_302) (+ (* v_~end~0_577 4) v_~queue~0.offset_302)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_224| 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_93|) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_219| 4294967296) .cse0)) (= |v_thread2Thread1of1ForFork0_~i~1#1_269| (+ |v_thread2Thread1of1ForFork0_~i~1#1_270| 1)))) InVars {~queue~0.offset=v_~queue~0.offset_302, ~A~0=v_~A~0_302, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_224|, ~B~0=v_~B~0_174, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_219|, #memory_int=|v_#memory_int_538|, ~end~0=v_~end~0_577, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_270|, ~queue~0.base=v_~queue~0.base_302, ~n~0=v_~n~0_308, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_283|} OutVars{~queue~0.offset=v_~queue~0.offset_302, ~A~0=v_~A~0_302, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_224|, ~B~0=v_~B~0_174, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_93|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_269|, ~queue~0.base=v_~queue~0.base_302, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_93|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_219|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_93|, #memory_int=|v_#memory_int_538|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_91|, ~end~0=v_~end~0_576, ~n~0=v_~n~0_308, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_107|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_282|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_91|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_93|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 05:39:48,193 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:39:48,193 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 938 [2022-12-06 05:39:48,193 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 641 transitions, 15672 flow [2022-12-06 05:39:48,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:48,193 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:39:48,193 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:39:48,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-06 05:39:48,194 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:39:48,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:39:48,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1892063846, now seen corresponding path program 1 times [2022-12-06 05:39:48,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:39:48,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896293237] [2022-12-06 05:39:48,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:48,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:39:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:49,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:39:49,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:39:49,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896293237] [2022-12-06 05:39:49,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896293237] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:39:49,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709679930] [2022-12-06 05:39:49,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:49,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:39:49,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:39:49,195 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:39:49,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 05:39:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:49,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 05:39:49,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:39:49,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:39:49,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2022-12-06 05:39:49,736 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:39:49,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 43 [2022-12-06 05:39:49,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:39:49,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:39:49,939 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 05:39:49,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 90 [2022-12-06 05:39:49,955 INFO L321 Elim1Store]: treesize reduction 23, result has 14.8 percent of original size [2022-12-06 05:39:49,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 46 [2022-12-06 05:39:50,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:39:50,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709679930] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:39:50,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:39:50,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 05:39:50,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378313796] [2022-12-06 05:39:50,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:39:50,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 05:39:50,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:39:50,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 05:39:50,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-12-06 05:39:50,017 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 05:39:50,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 641 transitions, 15672 flow. Second operand has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 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 05:39:50,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:39:50,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 05:39:50,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:39:54,542 INFO L130 PetriNetUnfolder]: 4091/7482 cut-off events. [2022-12-06 05:39:54,543 INFO L131 PetriNetUnfolder]: For 273146/273146 co-relation queries the response was YES. [2022-12-06 05:39:54,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74165 conditions, 7482 events. 4091/7482 cut-off events. For 273146/273146 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 56406 event pairs, 352 based on Foata normal form. 2/7484 useless extension candidates. Maximal degree in co-relation 72487. Up to 1636 conditions per place. [2022-12-06 05:39:54,624 INFO L137 encePairwiseOnDemand]: 19/51 looper letters, 331 selfloop transitions, 513 changer transitions 32/876 dead transitions. [2022-12-06 05:39:54,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 876 transitions, 20700 flow [2022-12-06 05:39:54,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-06 05:39:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-06 05:39:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 247 transitions. [2022-12-06 05:39:54,626 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1793754538852578 [2022-12-06 05:39:54,626 INFO L175 Difference]: Start difference. First operand has 282 places, 641 transitions, 15672 flow. Second operand 27 states and 247 transitions. [2022-12-06 05:39:54,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 876 transitions, 20700 flow [2022-12-06 05:39:56,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 876 transitions, 20350 flow, removed 53 selfloop flow, removed 4 redundant places. [2022-12-06 05:39:56,665 INFO L231 Difference]: Finished difference. Result has 313 places, 731 transitions, 19096 flow [2022-12-06 05:39:56,665 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=15412, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=641, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=431, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=19096, PETRI_PLACES=313, PETRI_TRANSITIONS=731} [2022-12-06 05:39:56,665 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 284 predicate places. [2022-12-06 05:39:56,665 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:39:56,665 INFO L89 Accepts]: Start accepts. Operand has 313 places, 731 transitions, 19096 flow [2022-12-06 05:39:56,668 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:39:56,668 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:56,668 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 313 places, 731 transitions, 19096 flow [2022-12-06 05:39:56,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 309 places, 731 transitions, 19096 flow [2022-12-06 05:39:57,159 INFO L130 PetriNetUnfolder]: 926/3207 cut-off events. [2022-12-06 05:39:57,159 INFO L131 PetriNetUnfolder]: For 92039/92534 co-relation queries the response was YES. [2022-12-06 05:39:57,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27133 conditions, 3207 events. 926/3207 cut-off events. For 92039/92534 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 33849 event pairs, 25 based on Foata normal form. 55/3226 useless extension candidates. Maximal degree in co-relation 27017. Up to 778 conditions per place. [2022-12-06 05:39:57,214 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 309 places, 731 transitions, 19096 flow [2022-12-06 05:39:57,215 INFO L188 LiptonReduction]: Number of co-enabled transitions 3052 [2022-12-06 05:39:57,224 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 05:39:57,260 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] and [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 05:39:57,438 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [725] L67-5-->L104-3: Formula: (and (= (store |v_#memory_int_587| |v_ULTIMATE.start_main_~#t3~0#1.base_202| (store (select |v_#memory_int_587| |v_ULTIMATE.start_main_~#t3~0#1.base_202|) |v_ULTIMATE.start_main_~#t3~0#1.offset_184| |v_ULTIMATE.start_main_#t~pre18#1_194|)) |v_#memory_int_586|) (= |v_thread2Thread1of1ForFork0_~i~1#1_340| (+ |v_thread2Thread1of1ForFork0_~i~1#1_341| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_194| |v_#pthreadsForks_373|) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_341| 4294967296) (mod v_~A~0_350 4294967296)) (= |v_thread2Thread1of1ForFork0_~x~1#1_354| (+ |v_thread2Thread1of1ForFork0_~x~1#1_355| v_~B~0_202)) (= |v_#pthreadsForks_372| (+ |v_#pthreadsForks_373| 1))) InVars {~A~0=v_~A~0_350, #pthreadsForks=|v_#pthreadsForks_373|, ~B~0=v_~B~0_202, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_184|, #memory_int=|v_#memory_int_587|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_202|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_341|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_355|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_194|, ~A~0=v_~A~0_350, #pthreadsForks=|v_#pthreadsForks_372|, ~B~0=v_~B~0_202, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_184|, #memory_int=|v_#memory_int_586|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_202|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_206|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_340|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_175|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_139|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_354|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread2Thread1of1ForFork0_~i~1#1, ULTIMATE.start_main_#t~nondet17#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 05:39:57,641 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:39:57,641 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 976 [2022-12-06 05:39:57,641 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 729 transitions, 19130 flow [2022-12-06 05:39:57,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 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 05:39:57,641 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:39:57,641 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:39:57,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-06 05:39:57,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:39:57,848 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:39:57,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:39:57,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1634624499, now seen corresponding path program 1 times [2022-12-06 05:39:57,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:39:57,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292655063] [2022-12-06 05:39:57,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:57,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:39:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:59,481 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 05:39:59,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:39:59,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292655063] [2022-12-06 05:39:59,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292655063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:39:59,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:39:59,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:39:59,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723184680] [2022-12-06 05:39:59,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:39:59,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:39:59,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:39:59,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:39:59,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:39:59,486 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 05:39:59,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 729 transitions, 19130 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:59,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:39:59,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 05:39:59,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:02,282 INFO L130 PetriNetUnfolder]: 4047/7394 cut-off events. [2022-12-06 05:40:02,282 INFO L131 PetriNetUnfolder]: For 301856/301856 co-relation queries the response was YES. [2022-12-06 05:40:02,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76898 conditions, 7394 events. 4047/7394 cut-off events. For 301856/301856 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 55130 event pairs, 720 based on Foata normal form. 1/7394 useless extension candidates. Maximal degree in co-relation 76710. Up to 4283 conditions per place. [2022-12-06 05:40:02,354 INFO L137 encePairwiseOnDemand]: 33/55 looper letters, 537 selfloop transitions, 213 changer transitions 16/766 dead transitions. [2022-12-06 05:40:02,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 766 transitions, 21089 flow [2022-12-06 05:40:02,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:40:02,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:40:02,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-12-06 05:40:02,355 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2878787878787879 [2022-12-06 05:40:02,355 INFO L175 Difference]: Start difference. First operand has 307 places, 729 transitions, 19130 flow. Second operand 6 states and 95 transitions. [2022-12-06 05:40:02,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 766 transitions, 21089 flow [2022-12-06 05:40:04,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 766 transitions, 20442 flow, removed 211 selfloop flow, removed 11 redundant places. [2022-12-06 05:40:04,768 INFO L231 Difference]: Finished difference. Result has 304 places, 729 transitions, 19086 flow [2022-12-06 05:40:04,769 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=18501, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=19086, PETRI_PLACES=304, PETRI_TRANSITIONS=729} [2022-12-06 05:40:04,771 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 275 predicate places. [2022-12-06 05:40:04,771 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:04,771 INFO L89 Accepts]: Start accepts. Operand has 304 places, 729 transitions, 19086 flow [2022-12-06 05:40:04,774 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:04,774 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:04,774 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 304 places, 729 transitions, 19086 flow [2022-12-06 05:40:04,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 302 places, 729 transitions, 19086 flow [2022-12-06 05:40:05,322 INFO L130 PetriNetUnfolder]: 925/3210 cut-off events. [2022-12-06 05:40:05,322 INFO L131 PetriNetUnfolder]: For 90372/90844 co-relation queries the response was YES. [2022-12-06 05:40:05,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26543 conditions, 3210 events. 925/3210 cut-off events. For 90372/90844 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 33761 event pairs, 25 based on Foata normal form. 44/3217 useless extension candidates. Maximal degree in co-relation 26389. Up to 787 conditions per place. [2022-12-06 05:40:05,382 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 302 places, 729 transitions, 19086 flow [2022-12-06 05:40:05,383 INFO L188 LiptonReduction]: Number of co-enabled transitions 3016 [2022-12-06 05:40:05,386 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:40:05,519 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:40:05,531 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 760 [2022-12-06 05:40:05,531 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 728 transitions, 19072 flow [2022-12-06 05:40:05,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:05,532 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:05,532 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:05,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-06 05:40:05,532 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:40:05,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:05,532 INFO L85 PathProgramCache]: Analyzing trace with hash 39073969, now seen corresponding path program 1 times [2022-12-06 05:40:05,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:05,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568972917] [2022-12-06 05:40:05,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:05,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:06,627 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 05:40:06,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:06,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568972917] [2022-12-06 05:40:06,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568972917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:06,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:06,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:40:06,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038207231] [2022-12-06 05:40:06,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:06,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:40:06,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:06,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:40:06,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:40:06,628 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 05:40:06,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 728 transitions, 19072 flow. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:06,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:06,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 05:40:06,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:08,894 INFO L130 PetriNetUnfolder]: 4037/7364 cut-off events. [2022-12-06 05:40:08,894 INFO L131 PetriNetUnfolder]: For 274675/274675 co-relation queries the response was YES. [2022-12-06 05:40:08,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74472 conditions, 7364 events. 4037/7364 cut-off events. For 274675/274675 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 54772 event pairs, 732 based on Foata normal form. 1/7364 useless extension candidates. Maximal degree in co-relation 74291. Up to 4261 conditions per place. [2022-12-06 05:40:08,974 INFO L137 encePairwiseOnDemand]: 34/56 looper letters, 536 selfloop transitions, 211 changer transitions 14/761 dead transitions. [2022-12-06 05:40:08,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 761 transitions, 20917 flow [2022-12-06 05:40:08,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:40:08,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:40:08,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2022-12-06 05:40:08,975 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27976190476190477 [2022-12-06 05:40:08,975 INFO L175 Difference]: Start difference. First operand has 301 places, 728 transitions, 19072 flow. Second operand 6 states and 94 transitions. [2022-12-06 05:40:08,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 761 transitions, 20917 flow [2022-12-06 05:40:11,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 761 transitions, 20503 flow, removed 16 selfloop flow, removed 6 redundant places. [2022-12-06 05:40:11,122 INFO L231 Difference]: Finished difference. Result has 301 places, 726 transitions, 19034 flow [2022-12-06 05:40:11,122 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=18662, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=19034, PETRI_PLACES=301, PETRI_TRANSITIONS=726} [2022-12-06 05:40:11,123 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 272 predicate places. [2022-12-06 05:40:11,123 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:11,123 INFO L89 Accepts]: Start accepts. Operand has 301 places, 726 transitions, 19034 flow [2022-12-06 05:40:11,126 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:11,126 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:11,126 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 301 places, 726 transitions, 19034 flow [2022-12-06 05:40:11,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 726 transitions, 19034 flow [2022-12-06 05:40:11,625 INFO L130 PetriNetUnfolder]: 924/3189 cut-off events. [2022-12-06 05:40:11,625 INFO L131 PetriNetUnfolder]: For 89950/90422 co-relation queries the response was YES. [2022-12-06 05:40:11,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26369 conditions, 3189 events. 924/3189 cut-off events. For 89950/90422 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 33438 event pairs, 25 based on Foata normal form. 44/3196 useless extension candidates. Maximal degree in co-relation 26217. Up to 775 conditions per place. [2022-12-06 05:40:11,678 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 299 places, 726 transitions, 19034 flow [2022-12-06 05:40:11,678 INFO L188 LiptonReduction]: Number of co-enabled transitions 3006 [2022-12-06 05:40:11,680 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:40:11,680 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 557 [2022-12-06 05:40:11,681 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 726 transitions, 19034 flow [2022-12-06 05:40:11,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:11,681 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:11,681 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:11,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-06 05:40:11,681 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:40:11,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:11,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1206919043, now seen corresponding path program 1 times [2022-12-06 05:40:11,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:11,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451649691] [2022-12-06 05:40:11,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:11,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:11,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:11,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:11,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451649691] [2022-12-06 05:40:11,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451649691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:11,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:11,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:40:11,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021310629] [2022-12-06 05:40:11,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:11,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:40:11,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:11,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:40:11,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:40:11,735 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 05:40:11,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 726 transitions, 19034 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:11,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:11,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 05:40:11,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:13,863 INFO L130 PetriNetUnfolder]: 4020/7327 cut-off events. [2022-12-06 05:40:13,863 INFO L131 PetriNetUnfolder]: For 274355/274355 co-relation queries the response was YES. [2022-12-06 05:40:13,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73679 conditions, 7327 events. 4020/7327 cut-off events. For 274355/274355 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 54294 event pairs, 1102 based on Foata normal form. 1/7327 useless extension candidates. Maximal degree in co-relation 73500. Up to 7327 conditions per place. [2022-12-06 05:40:13,935 INFO L137 encePairwiseOnDemand]: 52/55 looper letters, 721 selfloop transitions, 2 changer transitions 0/723 dead transitions. [2022-12-06 05:40:13,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 723 transitions, 20408 flow [2022-12-06 05:40:13,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:40:13,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:40:13,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-06 05:40:13,936 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3393939393939394 [2022-12-06 05:40:13,936 INFO L175 Difference]: Start difference. First operand has 299 places, 726 transitions, 19034 flow. Second operand 3 states and 56 transitions. [2022-12-06 05:40:13,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 723 transitions, 20408 flow [2022-12-06 05:40:15,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 723 transitions, 19986 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-12-06 05:40:15,851 INFO L231 Difference]: Finished difference. Result has 298 places, 723 transitions, 18548 flow [2022-12-06 05:40:15,851 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=18540, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=721, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=18548, PETRI_PLACES=298, PETRI_TRANSITIONS=723} [2022-12-06 05:40:15,852 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 269 predicate places. [2022-12-06 05:40:15,852 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:15,852 INFO L89 Accepts]: Start accepts. Operand has 298 places, 723 transitions, 18548 flow [2022-12-06 05:40:15,861 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:15,861 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:15,862 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 298 places, 723 transitions, 18548 flow [2022-12-06 05:40:15,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 298 places, 723 transitions, 18548 flow [2022-12-06 05:40:16,368 INFO L130 PetriNetUnfolder]: 922/3192 cut-off events. [2022-12-06 05:40:16,368 INFO L131 PetriNetUnfolder]: For 83600/84056 co-relation queries the response was YES. [2022-12-06 05:40:16,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25863 conditions, 3192 events. 922/3192 cut-off events. For 83600/84056 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 33474 event pairs, 24 based on Foata normal form. 44/3198 useless extension candidates. Maximal degree in co-relation 25646. Up to 777 conditions per place. [2022-12-06 05:40:16,422 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 298 places, 723 transitions, 18548 flow [2022-12-06 05:40:16,422 INFO L188 LiptonReduction]: Number of co-enabled transitions 2990 [2022-12-06 05:40:16,426 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [746] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (mod v_~A~0_392 4294967296))) (and (= |v_thread1Thread1of1ForFork2_~x~0#1_321| (* 2 v_~B~0_242)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_126| 0)) (< (mod (+ |v_thread1Thread1of1ForFork2_~i~0#1_316| 4294967295) 4294967296) .cse0) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_316| 4294967296) .cse0)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_126| (ite (= (mod (select (select |v_#memory_int_630| v_~queue~0.base_350) (+ (* v_~end~0_684 4) v_~queue~0.offset_350)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_321| 4294967296)) 1 0)) (= |v_thread1Thread1of1ForFork2_~i~0#1_316| 2) (not (= (ite (and (< v_~end~0_684 v_~n~0_356) (<= 0 v_~end~0_684)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~x~1#1_448| v_~B~0_242) (= |v_thread1Thread1of1ForFork2_#res#1.offset_124| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_126| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_126|) (= |v_thread2Thread1of1ForFork0_~i~1#1_432| 1) (= v_~end~0_683 (+ v_~end~0_684 1)) (= |v_thread1Thread1of1ForFork2_#res#1.base_124| 0))) InVars {~queue~0.offset=v_~queue~0.offset_350, ~A~0=v_~A~0_392, ~B~0=v_~B~0_242, #memory_int=|v_#memory_int_630|, ~end~0=v_~end~0_684, ~queue~0.base=v_~queue~0.base_350, ~n~0=v_~n~0_356} OutVars{~queue~0.offset=v_~queue~0.offset_350, ~A~0=v_~A~0_392, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_321|, ~B~0=v_~B~0_242, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_126|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_432|, ~queue~0.base=v_~queue~0.base_350, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_132|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_126|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_316|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_126|, #memory_int=|v_#memory_int_630|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_124|, ~end~0=v_~end~0_683, ~n~0=v_~n~0_356, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_204|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_448|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_124|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_126|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [725] L67-5-->L104-3: Formula: (and (= (store |v_#memory_int_587| |v_ULTIMATE.start_main_~#t3~0#1.base_202| (store (select |v_#memory_int_587| |v_ULTIMATE.start_main_~#t3~0#1.base_202|) |v_ULTIMATE.start_main_~#t3~0#1.offset_184| |v_ULTIMATE.start_main_#t~pre18#1_194|)) |v_#memory_int_586|) (= |v_thread2Thread1of1ForFork0_~i~1#1_340| (+ |v_thread2Thread1of1ForFork0_~i~1#1_341| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_194| |v_#pthreadsForks_373|) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_341| 4294967296) (mod v_~A~0_350 4294967296)) (= |v_thread2Thread1of1ForFork0_~x~1#1_354| (+ |v_thread2Thread1of1ForFork0_~x~1#1_355| v_~B~0_202)) (= |v_#pthreadsForks_372| (+ |v_#pthreadsForks_373| 1))) InVars {~A~0=v_~A~0_350, #pthreadsForks=|v_#pthreadsForks_373|, ~B~0=v_~B~0_202, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_184|, #memory_int=|v_#memory_int_587|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_202|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_341|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_355|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_194|, ~A~0=v_~A~0_350, #pthreadsForks=|v_#pthreadsForks_372|, ~B~0=v_~B~0_202, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_184|, #memory_int=|v_#memory_int_586|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_202|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_206|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_340|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_175|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_139|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_354|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread2Thread1of1ForFork0_~i~1#1, ULTIMATE.start_main_#t~nondet17#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 05:40:16,674 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [724] L67-5-->L67-5: Formula: (let ((.cse0 (mod v_~A~0_348 4294967296))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork0_~i~1#1_334|) 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_336| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork0_~x~1#1_348| (+ (* 2 v_~B~0_200) |v_thread2Thread1of1ForFork0_~x~1#1_350|)) (= (+ 2 |v_thread2Thread1of1ForFork0_~i~1#1_336|) |v_thread2Thread1of1ForFork0_~i~1#1_334|))) InVars {~A~0=v_~A~0_348, ~B~0=v_~B~0_200, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_336|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_350|} OutVars{~A~0=v_~A~0_348, ~B~0=v_~B~0_200, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_334|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_135|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_348|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 05:40:16,840 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:40:16,841 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 989 [2022-12-06 05:40:16,841 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 722 transitions, 18562 flow [2022-12-06 05:40:16,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:16,841 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:16,841 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:16,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-12-06 05:40:16,841 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:40:16,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:16,842 INFO L85 PathProgramCache]: Analyzing trace with hash -2006504606, now seen corresponding path program 1 times [2022-12-06 05:40:16,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:16,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113048073] [2022-12-06 05:40:16,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:16,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:16,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:16,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:16,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113048073] [2022-12-06 05:40:16,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113048073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:16,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:16,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:40:16,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246729769] [2022-12-06 05:40:16,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:16,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:40:16,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:16,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:40:16,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:40:16,890 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 05:40:16,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 722 transitions, 18562 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:16,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:16,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 05:40:16,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:19,104 INFO L130 PetriNetUnfolder]: 3991/7304 cut-off events. [2022-12-06 05:40:19,104 INFO L131 PetriNetUnfolder]: For 258134/258134 co-relation queries the response was YES. [2022-12-06 05:40:19,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72357 conditions, 7304 events. 3991/7304 cut-off events. For 258134/258134 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 54452 event pairs, 1109 based on Foata normal form. 11/7314 useless extension candidates. Maximal degree in co-relation 72208. Up to 7215 conditions per place. [2022-12-06 05:40:19,177 INFO L137 encePairwiseOnDemand]: 51/55 looper letters, 726 selfloop transitions, 1 changer transitions 3/730 dead transitions. [2022-12-06 05:40:19,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 730 transitions, 20054 flow [2022-12-06 05:40:19,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:40:19,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:40:19,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-06 05:40:19,178 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2022-12-06 05:40:19,178 INFO L175 Difference]: Start difference. First operand has 297 places, 722 transitions, 18562 flow. Second operand 3 states and 68 transitions. [2022-12-06 05:40:19,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 730 transitions, 20054 flow [2022-12-06 05:40:21,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 730 transitions, 20042 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 05:40:21,043 INFO L231 Difference]: Finished difference. Result has 298 places, 714 transitions, 18311 flow [2022-12-06 05:40:21,043 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=18439, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=717, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=716, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=18311, PETRI_PLACES=298, PETRI_TRANSITIONS=714} [2022-12-06 05:40:21,043 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 269 predicate places. [2022-12-06 05:40:21,044 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:21,044 INFO L89 Accepts]: Start accepts. Operand has 298 places, 714 transitions, 18311 flow [2022-12-06 05:40:21,046 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:21,046 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:21,046 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 298 places, 714 transitions, 18311 flow [2022-12-06 05:40:21,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 298 places, 714 transitions, 18311 flow [2022-12-06 05:40:21,562 INFO L130 PetriNetUnfolder]: 913/3174 cut-off events. [2022-12-06 05:40:21,562 INFO L131 PetriNetUnfolder]: For 82893/83379 co-relation queries the response was YES. [2022-12-06 05:40:21,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25728 conditions, 3174 events. 913/3174 cut-off events. For 82893/83379 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 33383 event pairs, 25 based on Foata normal form. 44/3181 useless extension candidates. Maximal degree in co-relation 25364. Up to 769 conditions per place. [2022-12-06 05:40:21,615 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 298 places, 714 transitions, 18311 flow [2022-12-06 05:40:21,615 INFO L188 LiptonReduction]: Number of co-enabled transitions 2950 [2022-12-06 05:40:21,616 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:40:21,617 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 573 [2022-12-06 05:40:21,617 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 714 transitions, 18311 flow [2022-12-06 05:40:21,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:21,617 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:21,617 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:21,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-12-06 05:40:21,617 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:40:21,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:21,617 INFO L85 PathProgramCache]: Analyzing trace with hash -557413677, now seen corresponding path program 1 times [2022-12-06 05:40:21,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:21,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463409893] [2022-12-06 05:40:21,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:21,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:21,670 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 05:40:21,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:21,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463409893] [2022-12-06 05:40:21,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463409893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:21,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:21,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:40:21,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093991981] [2022-12-06 05:40:21,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:21,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:40:21,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:21,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:40:21,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:40:21,671 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 05:40:21,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 714 transitions, 18311 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:21,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:21,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 05:40:21,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:23,799 INFO L130 PetriNetUnfolder]: 3979/7276 cut-off events. [2022-12-06 05:40:23,799 INFO L131 PetriNetUnfolder]: For 256720/256720 co-relation queries the response was YES. [2022-12-06 05:40:23,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72057 conditions, 7276 events. 3979/7276 cut-off events. For 256720/256720 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 54219 event pairs, 1103 based on Foata normal form. 3/7278 useless extension candidates. Maximal degree in co-relation 71203. Up to 7261 conditions per place. [2022-12-06 05:40:23,873 INFO L137 encePairwiseOnDemand]: 47/53 looper letters, 716 selfloop transitions, 5 changer transitions 0/721 dead transitions. [2022-12-06 05:40:23,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 721 transitions, 19764 flow [2022-12-06 05:40:23,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:40:23,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:40:23,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-06 05:40:23,874 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39622641509433965 [2022-12-06 05:40:23,874 INFO L175 Difference]: Start difference. First operand has 298 places, 714 transitions, 18311 flow. Second operand 3 states and 63 transitions. [2022-12-06 05:40:23,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 721 transitions, 19764 flow [2022-12-06 05:40:25,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 721 transitions, 19760 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 05:40:25,769 INFO L231 Difference]: Finished difference. Result has 298 places, 713 transitions, 18282 flow [2022-12-06 05:40:25,769 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=18272, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=713, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=708, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=18282, PETRI_PLACES=298, PETRI_TRANSITIONS=713} [2022-12-06 05:40:25,769 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 269 predicate places. [2022-12-06 05:40:25,769 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:25,769 INFO L89 Accepts]: Start accepts. Operand has 298 places, 713 transitions, 18282 flow [2022-12-06 05:40:25,772 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:25,772 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:25,772 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 298 places, 713 transitions, 18282 flow [2022-12-06 05:40:25,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 298 places, 713 transitions, 18282 flow [2022-12-06 05:40:26,283 INFO L130 PetriNetUnfolder]: 909/3165 cut-off events. [2022-12-06 05:40:26,283 INFO L131 PetriNetUnfolder]: For 82485/82943 co-relation queries the response was YES. [2022-12-06 05:40:26,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25646 conditions, 3165 events. 909/3165 cut-off events. For 82485/82943 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 33291 event pairs, 23 based on Foata normal form. 44/3172 useless extension candidates. Maximal degree in co-relation 25097. Up to 763 conditions per place. [2022-12-06 05:40:26,334 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 298 places, 713 transitions, 18282 flow [2022-12-06 05:40:26,334 INFO L188 LiptonReduction]: Number of co-enabled transitions 2946 [2022-12-06 05:40:26,336 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:40:26,336 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 567 [2022-12-06 05:40:26,336 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 713 transitions, 18282 flow [2022-12-06 05:40:26,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:26,336 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:26,336 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:26,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-12-06 05:40:26,336 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:40:26,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:26,337 INFO L85 PathProgramCache]: Analyzing trace with hash 898828689, now seen corresponding path program 1 times [2022-12-06 05:40:26,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:26,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440628275] [2022-12-06 05:40:26,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:26,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:26,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:26,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440628275] [2022-12-06 05:40:26,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440628275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:26,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:26,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:40:26,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018373744] [2022-12-06 05:40:26,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:26,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:40:26,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:26,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:40:26,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:40:26,396 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 05:40:26,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 713 transitions, 18282 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:26,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:26,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 05:40:26,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:28,374 INFO L130 PetriNetUnfolder]: 3944/7201 cut-off events. [2022-12-06 05:40:28,374 INFO L131 PetriNetUnfolder]: For 255478/255478 co-relation queries the response was YES. [2022-12-06 05:40:28,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71364 conditions, 7201 events. 3944/7201 cut-off events. For 255478/255478 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 53396 event pairs, 762 based on Foata normal form. 4/7204 useless extension candidates. Maximal degree in co-relation 69648. Up to 5419 conditions per place. [2022-12-06 05:40:28,443 INFO L137 encePairwiseOnDemand]: 45/52 looper letters, 582 selfloop transitions, 125 changer transitions 2/709 dead transitions. [2022-12-06 05:40:28,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 709 transitions, 19560 flow [2022-12-06 05:40:28,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:40:28,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:40:28,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-06 05:40:28,444 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.391025641025641 [2022-12-06 05:40:28,444 INFO L175 Difference]: Start difference. First operand has 298 places, 713 transitions, 18282 flow. Second operand 3 states and 61 transitions. [2022-12-06 05:40:28,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 709 transitions, 19560 flow [2022-12-06 05:40:30,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 709 transitions, 19394 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 05:40:30,371 INFO L231 Difference]: Finished difference. Result has 297 places, 702 transitions, 18066 flow [2022-12-06 05:40:30,371 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=17892, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=704, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=18066, PETRI_PLACES=297, PETRI_TRANSITIONS=702} [2022-12-06 05:40:30,372 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 268 predicate places. [2022-12-06 05:40:30,372 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:30,372 INFO L89 Accepts]: Start accepts. Operand has 297 places, 702 transitions, 18066 flow [2022-12-06 05:40:30,374 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:30,374 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:30,375 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 297 places, 702 transitions, 18066 flow [2022-12-06 05:40:30,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 296 places, 702 transitions, 18066 flow [2022-12-06 05:40:30,848 INFO L130 PetriNetUnfolder]: 903/3128 cut-off events. [2022-12-06 05:40:30,848 INFO L131 PetriNetUnfolder]: For 83803/84251 co-relation queries the response was YES. [2022-12-06 05:40:30,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25405 conditions, 3128 events. 903/3128 cut-off events. For 83803/84251 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 32743 event pairs, 23 based on Foata normal form. 44/3135 useless extension candidates. Maximal degree in co-relation 24845. Up to 754 conditions per place. [2022-12-06 05:40:30,899 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 296 places, 702 transitions, 18066 flow [2022-12-06 05:40:30,899 INFO L188 LiptonReduction]: Number of co-enabled transitions 2916 [2022-12-06 05:40:30,902 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:40:31,032 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] $Ultimate##0-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork1_#res#1.offset_11| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_11| 0) (not (= (ite (and (<= 0 v_~start~0_60) (< (+ v_~start~0_60 1) v_~n~0_91)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|) (= (ite (= (ite (let ((.cse0 (select |v_#memory_int_128| v_~queue~0.base_79)) (.cse1 (* v_~start~0_60 4))) (= (mod (select .cse0 (+ .cse1 v_~queue~0.offset_79)) 4294967296) (mod (select .cse0 (+ .cse1 4 v_~queue~0.offset_79)) 4294967296))) 1 0) 0) 0 1) v_~ok~0_26) (= (ite (= v_~end~0_158 (+ v_~start~0_60 2)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~start~0=v_~start~0_60, ~queue~0.offset=v_~queue~0.offset_79, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~queue~0.base=v_~queue~0.base_79, ~n~0=v_~n~0_91} OutVars{~start~0=v_~start~0_60, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~queue~0.offset=v_~queue~0.offset_79, ~ok~0=v_~ok~0_26, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~queue~0.base=v_~queue~0.base_79, thread3Thread1of1ForFork1_#t~mem7#1=|v_thread3Thread1of1ForFork1_#t~mem7#1_29|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_11|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_11|, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~n~0=v_~n~0_91, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_31|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~ok~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~mem8#1, thread3Thread1of1ForFork1_#t~mem7#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:40:31,117 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] $Ultimate##0-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork1_#res#1.offset_11| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_11| 0) (not (= (ite (and (<= 0 v_~start~0_60) (< (+ v_~start~0_60 1) v_~n~0_91)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|) (= (ite (= (ite (let ((.cse0 (select |v_#memory_int_128| v_~queue~0.base_79)) (.cse1 (* v_~start~0_60 4))) (= (mod (select .cse0 (+ .cse1 v_~queue~0.offset_79)) 4294967296) (mod (select .cse0 (+ .cse1 4 v_~queue~0.offset_79)) 4294967296))) 1 0) 0) 0 1) v_~ok~0_26) (= (ite (= v_~end~0_158 (+ v_~start~0_60 2)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~start~0=v_~start~0_60, ~queue~0.offset=v_~queue~0.offset_79, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~queue~0.base=v_~queue~0.base_79, ~n~0=v_~n~0_91} OutVars{~start~0=v_~start~0_60, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~queue~0.offset=v_~queue~0.offset_79, ~ok~0=v_~ok~0_26, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~queue~0.base=v_~queue~0.base_79, thread3Thread1of1ForFork1_#t~mem7#1=|v_thread3Thread1of1ForFork1_#t~mem7#1_29|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_11|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_11|, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~n~0=v_~n~0_91, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_31|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~ok~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~mem8#1, thread3Thread1of1ForFork1_#t~mem7#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:40:31,203 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:40:31,333 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] $Ultimate##0-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork1_#res#1.offset_11| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_11| 0) (not (= (ite (and (<= 0 v_~start~0_60) (< (+ v_~start~0_60 1) v_~n~0_91)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|) (= (ite (= (ite (let ((.cse0 (select |v_#memory_int_128| v_~queue~0.base_79)) (.cse1 (* v_~start~0_60 4))) (= (mod (select .cse0 (+ .cse1 v_~queue~0.offset_79)) 4294967296) (mod (select .cse0 (+ .cse1 4 v_~queue~0.offset_79)) 4294967296))) 1 0) 0) 0 1) v_~ok~0_26) (= (ite (= v_~end~0_158 (+ v_~start~0_60 2)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~start~0=v_~start~0_60, ~queue~0.offset=v_~queue~0.offset_79, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~queue~0.base=v_~queue~0.base_79, ~n~0=v_~n~0_91} OutVars{~start~0=v_~start~0_60, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~queue~0.offset=v_~queue~0.offset_79, ~ok~0=v_~ok~0_26, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~queue~0.base=v_~queue~0.base_79, thread3Thread1of1ForFork1_#t~mem7#1=|v_thread3Thread1of1ForFork1_#t~mem7#1_29|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_11|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_11|, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~n~0=v_~n~0_91, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_31|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~ok~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~mem8#1, thread3Thread1of1ForFork1_#t~mem7#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:40:31,417 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] $Ultimate##0-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork1_#res#1.offset_11| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_11| 0) (not (= (ite (and (<= 0 v_~start~0_60) (< (+ v_~start~0_60 1) v_~n~0_91)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|) (= (ite (= (ite (let ((.cse0 (select |v_#memory_int_128| v_~queue~0.base_79)) (.cse1 (* v_~start~0_60 4))) (= (mod (select .cse0 (+ .cse1 v_~queue~0.offset_79)) 4294967296) (mod (select .cse0 (+ .cse1 4 v_~queue~0.offset_79)) 4294967296))) 1 0) 0) 0 1) v_~ok~0_26) (= (ite (= v_~end~0_158 (+ v_~start~0_60 2)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~start~0=v_~start~0_60, ~queue~0.offset=v_~queue~0.offset_79, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~queue~0.base=v_~queue~0.base_79, ~n~0=v_~n~0_91} OutVars{~start~0=v_~start~0_60, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~queue~0.offset=v_~queue~0.offset_79, ~ok~0=v_~ok~0_26, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~queue~0.base=v_~queue~0.base_79, thread3Thread1of1ForFork1_#t~mem7#1=|v_thread3Thread1of1ForFork1_#t~mem7#1_29|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_11|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_11|, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~n~0=v_~n~0_91, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_31|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~ok~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~mem8#1, thread3Thread1of1ForFork1_#t~mem7#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:40:31,507 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] $Ultimate##0-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork1_#res#1.offset_11| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_11| 0) (not (= (ite (and (<= 0 v_~start~0_60) (< (+ v_~start~0_60 1) v_~n~0_91)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|) (= (ite (= (ite (let ((.cse0 (select |v_#memory_int_128| v_~queue~0.base_79)) (.cse1 (* v_~start~0_60 4))) (= (mod (select .cse0 (+ .cse1 v_~queue~0.offset_79)) 4294967296) (mod (select .cse0 (+ .cse1 4 v_~queue~0.offset_79)) 4294967296))) 1 0) 0) 0 1) v_~ok~0_26) (= (ite (= v_~end~0_158 (+ v_~start~0_60 2)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~start~0=v_~start~0_60, ~queue~0.offset=v_~queue~0.offset_79, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~queue~0.base=v_~queue~0.base_79, ~n~0=v_~n~0_91} OutVars{~start~0=v_~start~0_60, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~queue~0.offset=v_~queue~0.offset_79, ~ok~0=v_~ok~0_26, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~queue~0.base=v_~queue~0.base_79, thread3Thread1of1ForFork1_#t~mem7#1=|v_thread3Thread1of1ForFork1_#t~mem7#1_29|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_11|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_11|, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~n~0=v_~n~0_91, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_31|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~ok~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~mem8#1, thread3Thread1of1ForFork1_#t~mem7#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:40:31,594 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] $Ultimate##0-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork1_#res#1.offset_11| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_11| 0) (not (= (ite (and (<= 0 v_~start~0_60) (< (+ v_~start~0_60 1) v_~n~0_91)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|) (= (ite (= (ite (let ((.cse0 (select |v_#memory_int_128| v_~queue~0.base_79)) (.cse1 (* v_~start~0_60 4))) (= (mod (select .cse0 (+ .cse1 v_~queue~0.offset_79)) 4294967296) (mod (select .cse0 (+ .cse1 4 v_~queue~0.offset_79)) 4294967296))) 1 0) 0) 0 1) v_~ok~0_26) (= (ite (= v_~end~0_158 (+ v_~start~0_60 2)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~start~0=v_~start~0_60, ~queue~0.offset=v_~queue~0.offset_79, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~queue~0.base=v_~queue~0.base_79, ~n~0=v_~n~0_91} OutVars{~start~0=v_~start~0_60, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~queue~0.offset=v_~queue~0.offset_79, ~ok~0=v_~ok~0_26, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~queue~0.base=v_~queue~0.base_79, thread3Thread1of1ForFork1_#t~mem7#1=|v_thread3Thread1of1ForFork1_#t~mem7#1_29|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_11|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_11|, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~n~0=v_~n~0_91, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_31|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~ok~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~mem8#1, thread3Thread1of1ForFork1_#t~mem7#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:40:31,679 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] $Ultimate##0-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork1_#res#1.offset_11| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_11| 0) (not (= (ite (and (<= 0 v_~start~0_60) (< (+ v_~start~0_60 1) v_~n~0_91)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|) (= (ite (= (ite (let ((.cse0 (select |v_#memory_int_128| v_~queue~0.base_79)) (.cse1 (* v_~start~0_60 4))) (= (mod (select .cse0 (+ .cse1 v_~queue~0.offset_79)) 4294967296) (mod (select .cse0 (+ .cse1 4 v_~queue~0.offset_79)) 4294967296))) 1 0) 0) 0 1) v_~ok~0_26) (= (ite (= v_~end~0_158 (+ v_~start~0_60 2)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~start~0=v_~start~0_60, ~queue~0.offset=v_~queue~0.offset_79, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~queue~0.base=v_~queue~0.base_79, ~n~0=v_~n~0_91} OutVars{~start~0=v_~start~0_60, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~queue~0.offset=v_~queue~0.offset_79, ~ok~0=v_~ok~0_26, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~queue~0.base=v_~queue~0.base_79, thread3Thread1of1ForFork1_#t~mem7#1=|v_thread3Thread1of1ForFork1_#t~mem7#1_29|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_11|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_11|, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~n~0=v_~n~0_91, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_31|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~ok~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~mem8#1, thread3Thread1of1ForFork1_#t~mem7#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:40:31,766 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] $Ultimate##0-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork1_#res#1.offset_11| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_11| 0) (not (= (ite (and (<= 0 v_~start~0_60) (< (+ v_~start~0_60 1) v_~n~0_91)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|) (= (ite (= (ite (let ((.cse0 (select |v_#memory_int_128| v_~queue~0.base_79)) (.cse1 (* v_~start~0_60 4))) (= (mod (select .cse0 (+ .cse1 v_~queue~0.offset_79)) 4294967296) (mod (select .cse0 (+ .cse1 4 v_~queue~0.offset_79)) 4294967296))) 1 0) 0) 0 1) v_~ok~0_26) (= (ite (= v_~end~0_158 (+ v_~start~0_60 2)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~start~0=v_~start~0_60, ~queue~0.offset=v_~queue~0.offset_79, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~queue~0.base=v_~queue~0.base_79, ~n~0=v_~n~0_91} OutVars{~start~0=v_~start~0_60, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~queue~0.offset=v_~queue~0.offset_79, ~ok~0=v_~ok~0_26, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~queue~0.base=v_~queue~0.base_79, thread3Thread1of1ForFork1_#t~mem7#1=|v_thread3Thread1of1ForFork1_#t~mem7#1_29|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_11|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_11|, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~n~0=v_~n~0_91, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_31|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~ok~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~mem8#1, thread3Thread1of1ForFork1_#t~mem7#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:40:31,851 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] $Ultimate##0-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork1_#res#1.offset_11| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_11| 0) (not (= (ite (and (<= 0 v_~start~0_60) (< (+ v_~start~0_60 1) v_~n~0_91)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|) (= (ite (= (ite (let ((.cse0 (select |v_#memory_int_128| v_~queue~0.base_79)) (.cse1 (* v_~start~0_60 4))) (= (mod (select .cse0 (+ .cse1 v_~queue~0.offset_79)) 4294967296) (mod (select .cse0 (+ .cse1 4 v_~queue~0.offset_79)) 4294967296))) 1 0) 0) 0 1) v_~ok~0_26) (= (ite (= v_~end~0_158 (+ v_~start~0_60 2)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~start~0=v_~start~0_60, ~queue~0.offset=v_~queue~0.offset_79, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~queue~0.base=v_~queue~0.base_79, ~n~0=v_~n~0_91} OutVars{~start~0=v_~start~0_60, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~queue~0.offset=v_~queue~0.offset_79, ~ok~0=v_~ok~0_26, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~queue~0.base=v_~queue~0.base_79, thread3Thread1of1ForFork1_#t~mem7#1=|v_thread3Thread1of1ForFork1_#t~mem7#1_29|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_11|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_11|, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~n~0=v_~n~0_91, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_31|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~ok~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~mem8#1, thread3Thread1of1ForFork1_#t~mem7#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:40:31,941 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] $Ultimate##0-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork1_#res#1.offset_11| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_11| 0) (not (= (ite (and (<= 0 v_~start~0_60) (< (+ v_~start~0_60 1) v_~n~0_91)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|) (= (ite (= (ite (let ((.cse0 (select |v_#memory_int_128| v_~queue~0.base_79)) (.cse1 (* v_~start~0_60 4))) (= (mod (select .cse0 (+ .cse1 v_~queue~0.offset_79)) 4294967296) (mod (select .cse0 (+ .cse1 4 v_~queue~0.offset_79)) 4294967296))) 1 0) 0) 0 1) v_~ok~0_26) (= (ite (= v_~end~0_158 (+ v_~start~0_60 2)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~start~0=v_~start~0_60, ~queue~0.offset=v_~queue~0.offset_79, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~queue~0.base=v_~queue~0.base_79, ~n~0=v_~n~0_91} OutVars{~start~0=v_~start~0_60, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~queue~0.offset=v_~queue~0.offset_79, ~ok~0=v_~ok~0_26, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~queue~0.base=v_~queue~0.base_79, thread3Thread1of1ForFork1_#t~mem7#1=|v_thread3Thread1of1ForFork1_#t~mem7#1_29|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_11|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_11|, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~n~0=v_~n~0_91, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_31|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~ok~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~mem8#1, thread3Thread1of1ForFork1_#t~mem7#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:40:32,030 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] $Ultimate##0-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork1_#res#1.offset_11| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_11| 0) (not (= (ite (and (<= 0 v_~start~0_60) (< (+ v_~start~0_60 1) v_~n~0_91)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|) (= (ite (= (ite (let ((.cse0 (select |v_#memory_int_128| v_~queue~0.base_79)) (.cse1 (* v_~start~0_60 4))) (= (mod (select .cse0 (+ .cse1 v_~queue~0.offset_79)) 4294967296) (mod (select .cse0 (+ .cse1 4 v_~queue~0.offset_79)) 4294967296))) 1 0) 0) 0 1) v_~ok~0_26) (= (ite (= v_~end~0_158 (+ v_~start~0_60 2)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~start~0=v_~start~0_60, ~queue~0.offset=v_~queue~0.offset_79, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~queue~0.base=v_~queue~0.base_79, ~n~0=v_~n~0_91} OutVars{~start~0=v_~start~0_60, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~queue~0.offset=v_~queue~0.offset_79, ~ok~0=v_~ok~0_26, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~queue~0.base=v_~queue~0.base_79, thread3Thread1of1ForFork1_#t~mem7#1=|v_thread3Thread1of1ForFork1_#t~mem7#1_29|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_11|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_11|, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~n~0=v_~n~0_91, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_31|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~ok~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~mem8#1, thread3Thread1of1ForFork1_#t~mem7#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:40:32,113 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] $Ultimate##0-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork1_#res#1.offset_11| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_11| 0) (not (= (ite (and (<= 0 v_~start~0_60) (< (+ v_~start~0_60 1) v_~n~0_91)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|) (= (ite (= (ite (let ((.cse0 (select |v_#memory_int_128| v_~queue~0.base_79)) (.cse1 (* v_~start~0_60 4))) (= (mod (select .cse0 (+ .cse1 v_~queue~0.offset_79)) 4294967296) (mod (select .cse0 (+ .cse1 4 v_~queue~0.offset_79)) 4294967296))) 1 0) 0) 0 1) v_~ok~0_26) (= (ite (= v_~end~0_158 (+ v_~start~0_60 2)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~start~0=v_~start~0_60, ~queue~0.offset=v_~queue~0.offset_79, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~queue~0.base=v_~queue~0.base_79, ~n~0=v_~n~0_91} OutVars{~start~0=v_~start~0_60, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~queue~0.offset=v_~queue~0.offset_79, ~ok~0=v_~ok~0_26, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~queue~0.base=v_~queue~0.base_79, thread3Thread1of1ForFork1_#t~mem7#1=|v_thread3Thread1of1ForFork1_#t~mem7#1_29|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_11|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_11|, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~n~0=v_~n~0_91, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_31|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~ok~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~mem8#1, thread3Thread1of1ForFork1_#t~mem7#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:40:32,196 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] $Ultimate##0-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork1_#res#1.offset_11| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_11| 0) (not (= (ite (and (<= 0 v_~start~0_60) (< (+ v_~start~0_60 1) v_~n~0_91)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|) (= (ite (= (ite (let ((.cse0 (select |v_#memory_int_128| v_~queue~0.base_79)) (.cse1 (* v_~start~0_60 4))) (= (mod (select .cse0 (+ .cse1 v_~queue~0.offset_79)) 4294967296) (mod (select .cse0 (+ .cse1 4 v_~queue~0.offset_79)) 4294967296))) 1 0) 0) 0 1) v_~ok~0_26) (= (ite (= v_~end~0_158 (+ v_~start~0_60 2)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~start~0=v_~start~0_60, ~queue~0.offset=v_~queue~0.offset_79, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~queue~0.base=v_~queue~0.base_79, ~n~0=v_~n~0_91} OutVars{~start~0=v_~start~0_60, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~queue~0.offset=v_~queue~0.offset_79, ~ok~0=v_~ok~0_26, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~queue~0.base=v_~queue~0.base_79, thread3Thread1of1ForFork1_#t~mem7#1=|v_thread3Thread1of1ForFork1_#t~mem7#1_29|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_11|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_11|, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~n~0=v_~n~0_91, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_31|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~ok~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~mem8#1, thread3Thread1of1ForFork1_#t~mem7#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:40:32,285 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] $Ultimate##0-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork1_#res#1.offset_11| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_11| 0) (not (= (ite (and (<= 0 v_~start~0_60) (< (+ v_~start~0_60 1) v_~n~0_91)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|) (= (ite (= (ite (let ((.cse0 (select |v_#memory_int_128| v_~queue~0.base_79)) (.cse1 (* v_~start~0_60 4))) (= (mod (select .cse0 (+ .cse1 v_~queue~0.offset_79)) 4294967296) (mod (select .cse0 (+ .cse1 4 v_~queue~0.offset_79)) 4294967296))) 1 0) 0) 0 1) v_~ok~0_26) (= (ite (= v_~end~0_158 (+ v_~start~0_60 2)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~start~0=v_~start~0_60, ~queue~0.offset=v_~queue~0.offset_79, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~queue~0.base=v_~queue~0.base_79, ~n~0=v_~n~0_91} OutVars{~start~0=v_~start~0_60, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~queue~0.offset=v_~queue~0.offset_79, ~ok~0=v_~ok~0_26, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~queue~0.base=v_~queue~0.base_79, thread3Thread1of1ForFork1_#t~mem7#1=|v_thread3Thread1of1ForFork1_#t~mem7#1_29|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_11|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_11|, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~n~0=v_~n~0_91, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_31|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~ok~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~mem8#1, thread3Thread1of1ForFork1_#t~mem7#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:40:32,371 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] $Ultimate##0-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork1_#res#1.offset_11| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_11| 0) (not (= (ite (and (<= 0 v_~start~0_60) (< (+ v_~start~0_60 1) v_~n~0_91)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|) (= (ite (= (ite (let ((.cse0 (select |v_#memory_int_128| v_~queue~0.base_79)) (.cse1 (* v_~start~0_60 4))) (= (mod (select .cse0 (+ .cse1 v_~queue~0.offset_79)) 4294967296) (mod (select .cse0 (+ .cse1 4 v_~queue~0.offset_79)) 4294967296))) 1 0) 0) 0 1) v_~ok~0_26) (= (ite (= v_~end~0_158 (+ v_~start~0_60 2)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~start~0=v_~start~0_60, ~queue~0.offset=v_~queue~0.offset_79, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~queue~0.base=v_~queue~0.base_79, ~n~0=v_~n~0_91} OutVars{~start~0=v_~start~0_60, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~queue~0.offset=v_~queue~0.offset_79, ~ok~0=v_~ok~0_26, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~queue~0.base=v_~queue~0.base_79, thread3Thread1of1ForFork1_#t~mem7#1=|v_thread3Thread1of1ForFork1_#t~mem7#1_29|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_11|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_11|, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~n~0=v_~n~0_91, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_31|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~ok~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~mem8#1, thread3Thread1of1ForFork1_#t~mem7#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:40:32,456 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] $Ultimate##0-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork1_#res#1.offset_11| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_11| 0) (not (= (ite (and (<= 0 v_~start~0_60) (< (+ v_~start~0_60 1) v_~n~0_91)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|) (= (ite (= (ite (let ((.cse0 (select |v_#memory_int_128| v_~queue~0.base_79)) (.cse1 (* v_~start~0_60 4))) (= (mod (select .cse0 (+ .cse1 v_~queue~0.offset_79)) 4294967296) (mod (select .cse0 (+ .cse1 4 v_~queue~0.offset_79)) 4294967296))) 1 0) 0) 0 1) v_~ok~0_26) (= (ite (= v_~end~0_158 (+ v_~start~0_60 2)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~start~0=v_~start~0_60, ~queue~0.offset=v_~queue~0.offset_79, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~queue~0.base=v_~queue~0.base_79, ~n~0=v_~n~0_91} OutVars{~start~0=v_~start~0_60, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~queue~0.offset=v_~queue~0.offset_79, ~ok~0=v_~ok~0_26, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~queue~0.base=v_~queue~0.base_79, thread3Thread1of1ForFork1_#t~mem7#1=|v_thread3Thread1of1ForFork1_#t~mem7#1_29|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_11|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_11|, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~n~0=v_~n~0_91, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_31|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~ok~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~mem8#1, thread3Thread1of1ForFork1_#t~mem7#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:40:32,546 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] $Ultimate##0-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork1_#res#1.offset_11| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_11| 0) (not (= (ite (and (<= 0 v_~start~0_60) (< (+ v_~start~0_60 1) v_~n~0_91)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|) (= (ite (= (ite (let ((.cse0 (select |v_#memory_int_128| v_~queue~0.base_79)) (.cse1 (* v_~start~0_60 4))) (= (mod (select .cse0 (+ .cse1 v_~queue~0.offset_79)) 4294967296) (mod (select .cse0 (+ .cse1 4 v_~queue~0.offset_79)) 4294967296))) 1 0) 0) 0 1) v_~ok~0_26) (= (ite (= v_~end~0_158 (+ v_~start~0_60 2)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~start~0=v_~start~0_60, ~queue~0.offset=v_~queue~0.offset_79, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~queue~0.base=v_~queue~0.base_79, ~n~0=v_~n~0_91} OutVars{~start~0=v_~start~0_60, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~queue~0.offset=v_~queue~0.offset_79, ~ok~0=v_~ok~0_26, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~queue~0.base=v_~queue~0.base_79, thread3Thread1of1ForFork1_#t~mem7#1=|v_thread3Thread1of1ForFork1_#t~mem7#1_29|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_11|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_11|, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~n~0=v_~n~0_91, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_31|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~ok~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~mem8#1, thread3Thread1of1ForFork1_#t~mem7#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:40:32,638 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] $Ultimate##0-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork1_#res#1.offset_11| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_11| 0) (not (= (ite (and (<= 0 v_~start~0_60) (< (+ v_~start~0_60 1) v_~n~0_91)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|) (= (ite (= (ite (let ((.cse0 (select |v_#memory_int_128| v_~queue~0.base_79)) (.cse1 (* v_~start~0_60 4))) (= (mod (select .cse0 (+ .cse1 v_~queue~0.offset_79)) 4294967296) (mod (select .cse0 (+ .cse1 4 v_~queue~0.offset_79)) 4294967296))) 1 0) 0) 0 1) v_~ok~0_26) (= (ite (= v_~end~0_158 (+ v_~start~0_60 2)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~start~0=v_~start~0_60, ~queue~0.offset=v_~queue~0.offset_79, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~queue~0.base=v_~queue~0.base_79, ~n~0=v_~n~0_91} OutVars{~start~0=v_~start~0_60, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~queue~0.offset=v_~queue~0.offset_79, ~ok~0=v_~ok~0_26, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~queue~0.base=v_~queue~0.base_79, thread3Thread1of1ForFork1_#t~mem7#1=|v_thread3Thread1of1ForFork1_#t~mem7#1_29|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_11|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_11|, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~n~0=v_~n~0_91, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_31|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~ok~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~mem8#1, thread3Thread1of1ForFork1_#t~mem7#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:40:32,728 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] $Ultimate##0-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork1_#res#1.offset_11| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_11| 0) (not (= (ite (and (<= 0 v_~start~0_60) (< (+ v_~start~0_60 1) v_~n~0_91)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|) (= (ite (= (ite (let ((.cse0 (select |v_#memory_int_128| v_~queue~0.base_79)) (.cse1 (* v_~start~0_60 4))) (= (mod (select .cse0 (+ .cse1 v_~queue~0.offset_79)) 4294967296) (mod (select .cse0 (+ .cse1 4 v_~queue~0.offset_79)) 4294967296))) 1 0) 0) 0 1) v_~ok~0_26) (= (ite (= v_~end~0_158 (+ v_~start~0_60 2)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~start~0=v_~start~0_60, ~queue~0.offset=v_~queue~0.offset_79, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~queue~0.base=v_~queue~0.base_79, ~n~0=v_~n~0_91} OutVars{~start~0=v_~start~0_60, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~queue~0.offset=v_~queue~0.offset_79, ~ok~0=v_~ok~0_26, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~queue~0.base=v_~queue~0.base_79, thread3Thread1of1ForFork1_#t~mem7#1=|v_thread3Thread1of1ForFork1_#t~mem7#1_29|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_11|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_11|, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~n~0=v_~n~0_91, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_31|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~ok~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~mem8#1, thread3Thread1of1ForFork1_#t~mem7#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:40:32,811 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] $Ultimate##0-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork1_#res#1.offset_11| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_11| 0) (not (= (ite (and (<= 0 v_~start~0_60) (< (+ v_~start~0_60 1) v_~n~0_91)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|) (= (ite (= (ite (let ((.cse0 (select |v_#memory_int_128| v_~queue~0.base_79)) (.cse1 (* v_~start~0_60 4))) (= (mod (select .cse0 (+ .cse1 v_~queue~0.offset_79)) 4294967296) (mod (select .cse0 (+ .cse1 4 v_~queue~0.offset_79)) 4294967296))) 1 0) 0) 0 1) v_~ok~0_26) (= (ite (= v_~end~0_158 (+ v_~start~0_60 2)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~start~0=v_~start~0_60, ~queue~0.offset=v_~queue~0.offset_79, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~queue~0.base=v_~queue~0.base_79, ~n~0=v_~n~0_91} OutVars{~start~0=v_~start~0_60, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~queue~0.offset=v_~queue~0.offset_79, ~ok~0=v_~ok~0_26, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~queue~0.base=v_~queue~0.base_79, thread3Thread1of1ForFork1_#t~mem7#1=|v_thread3Thread1of1ForFork1_#t~mem7#1_29|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_11|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_11|, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~n~0=v_~n~0_91, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_31|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~ok~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~mem8#1, thread3Thread1of1ForFork1_#t~mem7#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:40:32,899 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] $Ultimate##0-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork1_#res#1.offset_11| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_11| 0) (not (= (ite (and (<= 0 v_~start~0_60) (< (+ v_~start~0_60 1) v_~n~0_91)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|) (= (ite (= (ite (let ((.cse0 (select |v_#memory_int_128| v_~queue~0.base_79)) (.cse1 (* v_~start~0_60 4))) (= (mod (select .cse0 (+ .cse1 v_~queue~0.offset_79)) 4294967296) (mod (select .cse0 (+ .cse1 4 v_~queue~0.offset_79)) 4294967296))) 1 0) 0) 0 1) v_~ok~0_26) (= (ite (= v_~end~0_158 (+ v_~start~0_60 2)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~start~0=v_~start~0_60, ~queue~0.offset=v_~queue~0.offset_79, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~queue~0.base=v_~queue~0.base_79, ~n~0=v_~n~0_91} OutVars{~start~0=v_~start~0_60, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~queue~0.offset=v_~queue~0.offset_79, ~ok~0=v_~ok~0_26, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~queue~0.base=v_~queue~0.base_79, thread3Thread1of1ForFork1_#t~mem7#1=|v_thread3Thread1of1ForFork1_#t~mem7#1_29|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_11|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_11|, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~n~0=v_~n~0_91, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_31|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~ok~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~mem8#1, thread3Thread1of1ForFork1_#t~mem7#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:40:32,991 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] $Ultimate##0-->thread3EXIT: Formula: (and (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork1_#res#1.offset_11| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_11| 0) (not (= (ite (and (<= 0 v_~start~0_60) (< (+ v_~start~0_60 1) v_~n~0_91)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|) (= (ite (= (ite (let ((.cse0 (select |v_#memory_int_128| v_~queue~0.base_79)) (.cse1 (* v_~start~0_60 4))) (= (mod (select .cse0 (+ .cse1 v_~queue~0.offset_79)) 4294967296) (mod (select .cse0 (+ .cse1 4 v_~queue~0.offset_79)) 4294967296))) 1 0) 0) 0 1) v_~ok~0_26) (= (ite (= v_~end~0_158 (+ v_~start~0_60 2)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~start~0=v_~start~0_60, ~queue~0.offset=v_~queue~0.offset_79, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~queue~0.base=v_~queue~0.base_79, ~n~0=v_~n~0_91} OutVars{~start~0=v_~start~0_60, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~queue~0.offset=v_~queue~0.offset_79, ~ok~0=v_~ok~0_26, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~queue~0.base=v_~queue~0.base_79, thread3Thread1of1ForFork1_#t~mem7#1=|v_thread3Thread1of1ForFork1_#t~mem7#1_29|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_11|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_11|, #memory_int=|v_#memory_int_128|, ~end~0=v_~end~0_158, ~n~0=v_~n~0_91, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_31|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#res#1.offset, ~ok~0, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~mem8#1, thread3Thread1of1ForFork1_#t~mem7#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 05:40:33,085 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-06 05:40:33,092 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [705] L67-5-->thread1EXIT: Formula: (let ((.cse0 (mod v_~A~0_310 4294967296))) (and (= v_~end~0_584 (+ v_~end~0_585 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_288| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_95| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_95|) (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_288| 1) |v_thread2Thread1of1ForFork0_~i~1#1_287|) (not (= (ite (and (< v_~end~0_585 v_~n~0_312) (<= 0 v_~end~0_585)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_95| 0)) (= |v_thread2Thread1of1ForFork0_~x~1#1_300| (+ |v_thread2Thread1of1ForFork0_~x~1#1_301| v_~B~0_182)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_225| 4294967296) .cse0)) (= (ite (= (mod (select (select |v_#memory_int_542| v_~queue~0.base_306) (+ v_~queue~0.offset_306 (* v_~end~0_585 4))) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_230| 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_95|) (= |v_thread1Thread1of1ForFork2_#res#1.base_93| 0) (= |v_thread1Thread1of1ForFork2_#res#1.offset_93| 0))) InVars {~queue~0.offset=v_~queue~0.offset_306, ~A~0=v_~A~0_310, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_230|, ~B~0=v_~B~0_182, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_225|, #memory_int=|v_#memory_int_542|, ~end~0=v_~end~0_585, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_288|, ~queue~0.base=v_~queue~0.base_306, ~n~0=v_~n~0_312, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_301|} OutVars{~queue~0.offset=v_~queue~0.offset_306, ~A~0=v_~A~0_310, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_230|, ~B~0=v_~B~0_182, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_95|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_287|, ~queue~0.base=v_~queue~0.base_306, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_95|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_225|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_95|, #memory_int=|v_#memory_int_542|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_93|, ~end~0=v_~end~0_584, ~n~0=v_~n~0_312, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_117|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_300|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_93|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_95|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 05:40:33,241 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:40:33,242 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-06 05:40:33,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-12-06 05:40:33,242 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 05:40:33,245 INFO L158 Benchmark]: Toolchain (without parser) took 241632.34ms. Allocated memory was 198.2MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 173.6MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-06 05:40:33,245 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 198.2MB. Free memory is still 174.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:40:33,245 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.98ms. Allocated memory is still 198.2MB. Free memory was 173.1MB in the beginning and 160.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 05:40:33,245 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.40ms. Allocated memory is still 198.2MB. Free memory was 160.5MB in the beginning and 158.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:40:33,245 INFO L158 Benchmark]: Boogie Preprocessor took 34.77ms. Allocated memory is still 198.2MB. Free memory was 157.9MB in the beginning and 156.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 05:40:33,245 INFO L158 Benchmark]: RCFGBuilder took 513.81ms. Allocated memory is still 198.2MB. Free memory was 156.3MB in the beginning and 130.1MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 05:40:33,259 INFO L158 Benchmark]: TraceAbstraction took 240744.35ms. Allocated memory was 198.2MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 129.6MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-12-06 05:40:33,260 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 198.2MB. Free memory is still 174.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 279.98ms. Allocated memory is still 198.2MB. Free memory was 173.1MB in the beginning and 160.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.40ms. Allocated memory is still 198.2MB. Free memory was 160.5MB in the beginning and 158.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.77ms. Allocated memory is still 198.2MB. Free memory was 157.9MB in the beginning and 156.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 513.81ms. Allocated memory is still 198.2MB. Free memory was 156.3MB in the beginning and 130.1MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 240744.35ms. Allocated memory was 198.2MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 129.6MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 132 PlacesBefore, 29 PlacesAfterwards, 131 TransitionsBefore, 22 TransitionsAfterwards, 1464 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 68 TrivialYvCompositions, 35 ConcurrentYvCompositions, 6 ChoiceCompositions, 109 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 748, independent: 743, independent conditional: 743, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 748, independent: 743, independent conditional: 0, independent unconditional: 743, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 748, independent: 743, independent conditional: 0, independent unconditional: 743, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 748, independent: 743, independent conditional: 0, independent unconditional: 743, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 748, independent: 743, independent conditional: 0, independent unconditional: 743, 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: 748, independent: 741, independent conditional: 0, independent unconditional: 741, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 748, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 748, unknown conditional: 0, unknown unconditional: 748] , Statistics on independence cache: Total cache size (in pairs): 1213, Positive cache size: 1208, Positive conditional cache size: 0, Positive unconditional cache size: 1208, 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: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 27 PlacesBefore, 26 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.1s, 28 PlacesBefore, 27 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 3.0s, 41 PlacesBefore, 39 PlacesAfterwards, 38 TransitionsBefore, 36 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 33, independent conditional: 33, 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: 33, independent: 33, independent conditional: 33, 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: 33, independent: 33, independent conditional: 11, independent unconditional: 22, 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: 33, independent: 33, independent conditional: 11, independent unconditional: 22, 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: 13, independent: 13, independent conditional: 5, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 33, independent: 20, independent conditional: 6, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 13, unknown conditional: 5, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 14, Positive conditional cache size: 5, Positive unconditional cache size: 9, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 298 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): 14, Positive cache size: 14, Positive conditional cache size: 5, Positive unconditional cache size: 9, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 47 PlacesBefore, 47 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 276 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): 14, Positive cache size: 14, Positive conditional cache size: 5, Positive unconditional cache size: 9, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 46 PlacesBefore, 45 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 20, Positive conditional cache size: 11, Positive unconditional cache size: 9, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 52 PlacesBefore, 52 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, independent: 31, independent conditional: 27, independent unconditional: 4, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 44, independent: 31, independent conditional: 27, independent unconditional: 4, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 44, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 48, Positive conditional cache size: 39, Positive unconditional cache size: 9, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 218 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): 59, Positive cache size: 48, Positive conditional cache size: 39, Positive unconditional cache size: 9, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, 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, 43 PlacesBefore, 43 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 238 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): 59, Positive cache size: 48, Positive conditional cache size: 39, Positive unconditional cache size: 9, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, 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, 48 PlacesBefore, 48 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 312 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): 59, Positive cache size: 48, Positive conditional cache size: 39, Positive unconditional cache size: 9, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, 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, 53 PlacesBefore, 53 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 342 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): 59, Positive cache size: 48, Positive conditional cache size: 39, Positive unconditional cache size: 9, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, 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, 63 PlacesBefore, 62 PlacesAfterwards, 68 TransitionsBefore, 67 TransitionsAfterwards, 408 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): 59, Positive cache size: 48, Positive conditional cache size: 39, Positive unconditional cache size: 9, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, 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, 67 PlacesBefore, 67 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 416 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): 59, Positive cache size: 48, Positive conditional cache size: 39, Positive unconditional cache size: 9, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, 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: 3.4s, 76 PlacesBefore, 75 PlacesAfterwards, 84 TransitionsBefore, 83 TransitionsAfterwards, 536 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, independent: 54, independent conditional: 54, 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: 54, independent: 54, independent conditional: 54, 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: 54, independent: 54, independent conditional: 25, independent unconditional: 29, 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: 54, independent: 54, independent conditional: 25, independent unconditional: 29, 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: 54, independent: 50, independent conditional: 21, independent unconditional: 29, 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): 65, Positive cache size: 54, Positive conditional cache size: 44, Positive unconditional cache size: 10, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 29, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 79 PlacesBefore, 78 PlacesAfterwards, 95 TransitionsBefore, 94 TransitionsAfterwards, 570 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 0, 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: 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] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 54, Positive conditional cache size: 44, Positive unconditional cache size: 10, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, 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, 93 TransitionsBefore, 93 TransitionsAfterwards, 562 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): 65, Positive cache size: 54, Positive conditional cache size: 44, Positive unconditional cache size: 10, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, 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, 80 PlacesBefore, 80 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 574 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): 65, Positive cache size: 54, Positive conditional cache size: 44, Positive unconditional cache size: 10, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, 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, 78 PlacesBefore, 78 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 542 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, 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: 58, Positive conditional cache size: 48, Positive unconditional cache size: 10, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, 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, 85 PlacesBefore, 84 PlacesAfterwards, 97 TransitionsBefore, 96 TransitionsAfterwards, 552 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): 70, Positive cache size: 58, Positive conditional cache size: 48, Positive unconditional cache size: 10, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, 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, 89 PlacesBefore, 87 PlacesAfterwards, 98 TransitionsBefore, 96 TransitionsAfterwards, 556 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 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: 3, independent unconditional: 2, 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: 3, independent unconditional: 2, 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: 5, independent: 2, independent conditional: 0, independent unconditional: 2, 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): 73, Positive cache size: 61, Positive conditional cache size: 51, Positive unconditional cache size: 10, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 89 PlacesBefore, 89 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 550 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): 73, Positive cache size: 61, Positive conditional cache size: 51, Positive unconditional cache size: 10, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, 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, 83 PlacesBefore, 81 PlacesAfterwards, 90 TransitionsBefore, 88 TransitionsAfterwards, 528 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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: 4, independent unconditional: 2, 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: 4, independent unconditional: 2, 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: 2, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 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: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 65, Positive conditional cache size: 53, Positive unconditional cache size: 12, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 82 PlacesBefore, 82 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 528 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 2, independent unconditional: 3, 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: 2, independent unconditional: 3, 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: 1, 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: 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: 5, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 67, Positive conditional cache size: 54, Positive unconditional cache size: 13, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 88 PlacesBefore, 86 PlacesAfterwards, 93 TransitionsBefore, 91 TransitionsAfterwards, 532 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 16, independent: 15, independent conditional: 12, independent unconditional: 3, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 15, independent conditional: 12, independent unconditional: 3, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 10, independent conditional: 7, independent unconditional: 3, 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): 85, Positive cache size: 72, Positive conditional cache size: 59, Positive unconditional cache size: 13, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 89 PlacesBefore, 88 PlacesAfterwards, 91 TransitionsBefore, 90 TransitionsAfterwards, 526 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 1, independent unconditional: 3, 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: 1, independent unconditional: 3, 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: 4, independent: 4, independent conditional: 1, independent unconditional: 3, 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): 85, Positive cache size: 72, Positive conditional cache size: 59, Positive unconditional cache size: 13, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 81 PlacesBefore, 81 PlacesAfterwards, 89 TransitionsBefore, 89 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): 85, Positive cache size: 72, Positive conditional cache size: 59, Positive unconditional cache size: 13, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 80 PlacesBefore, 80 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 516 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): 85, Positive cache size: 72, Positive conditional cache size: 59, Positive unconditional cache size: 13, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 87 PlacesBefore, 86 PlacesAfterwards, 95 TransitionsBefore, 94 TransitionsAfterwards, 560 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: 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): 87, Positive cache size: 74, Positive conditional cache size: 61, Positive unconditional cache size: 13, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 88 PlacesBefore, 88 PlacesAfterwards, 95 TransitionsBefore, 95 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): 87, Positive cache size: 74, Positive conditional cache size: 61, Positive unconditional cache size: 13, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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.0s, 121 PlacesBefore, 115 PlacesAfterwards, 196 TransitionsBefore, 190 TransitionsAfterwards, 964 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 36, independent unconditional: 4, 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: 40, independent: 40, independent conditional: 36, independent unconditional: 4, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, independent: 22, independent conditional: 18, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 104, Positive conditional cache size: 85, Positive unconditional cache size: 19, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 120 PlacesBefore, 118 PlacesAfterwards, 200 TransitionsBefore, 198 TransitionsAfterwards, 978 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19, independent: 19, independent conditional: 17, independent unconditional: 2, 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: 19, independent: 19, independent conditional: 17, independent unconditional: 2, 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: 19, independent: 11, independent conditional: 9, independent unconditional: 2, 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): 127, Positive cache size: 114, Positive conditional cache size: 93, Positive unconditional cache size: 21, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 120 PlacesBefore, 120 PlacesAfterwards, 200 TransitionsBefore, 200 TransitionsAfterwards, 970 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): 127, Positive cache size: 114, Positive conditional cache size: 93, Positive unconditional cache size: 21, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 121 PlacesBefore, 121 PlacesAfterwards, 199 TransitionsBefore, 199 TransitionsAfterwards, 970 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): 127, Positive cache size: 114, Positive conditional cache size: 93, Positive unconditional cache size: 21, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 125 PlacesBefore, 125 PlacesAfterwards, 204 TransitionsBefore, 204 TransitionsAfterwards, 1000 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): 127, Positive cache size: 114, Positive conditional cache size: 93, Positive unconditional cache size: 21, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 132 PlacesBefore, 131 PlacesAfterwards, 205 TransitionsBefore, 204 TransitionsAfterwards, 1008 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 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: 4, independent: 0, independent conditional: 0, 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): 132, Positive cache size: 119, Positive conditional cache size: 97, Positive unconditional cache size: 22, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 127 PlacesBefore, 127 PlacesAfterwards, 206 TransitionsBefore, 206 TransitionsAfterwards, 1002 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): 132, Positive cache size: 119, Positive conditional cache size: 97, Positive unconditional cache size: 22, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 154 PlacesBefore, 152 PlacesAfterwards, 244 TransitionsBefore, 242 TransitionsAfterwards, 1098 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 8, independent: 4, independent conditional: 4, 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): 152, Positive cache size: 139, Positive conditional cache size: 113, Positive unconditional cache size: 26, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 170 PlacesBefore, 169 PlacesAfterwards, 292 TransitionsBefore, 291 TransitionsAfterwards, 1362 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 152, Positive cache size: 139, Positive conditional cache size: 113, Positive unconditional cache size: 26, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 173 PlacesBefore, 171 PlacesAfterwards, 296 TransitionsBefore, 294 TransitionsAfterwards, 1390 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 171, Positive conditional cache size: 143, Positive unconditional cache size: 28, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 165 PlacesBefore, 164 PlacesAfterwards, 284 TransitionsBefore, 283 TransitionsAfterwards, 1340 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 1, independent unconditional: 4, 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: 1, independent unconditional: 4, 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: 1, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 175, Positive conditional cache size: 144, Positive unconditional cache size: 31, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 200 PlacesBefore, 200 PlacesAfterwards, 428 TransitionsBefore, 428 TransitionsAfterwards, 1860 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): 188, Positive cache size: 175, Positive conditional cache size: 144, Positive unconditional cache size: 31, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 200 PlacesBefore, 199 PlacesAfterwards, 429 TransitionsBefore, 428 TransitionsAfterwards, 1876 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 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: 5, independent: 0, independent conditional: 0, 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): 194, Positive cache size: 181, Positive conditional cache size: 149, Positive unconditional cache size: 32, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 204 PlacesBefore, 203 PlacesAfterwards, 454 TransitionsBefore, 453 TransitionsAfterwards, 1970 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 14, independent unconditional: 20, 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: 34, independent: 34, independent conditional: 14, independent unconditional: 20, 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: 34, independent: 34, independent conditional: 14, independent unconditional: 20, 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): 196, Positive cache size: 183, Positive conditional cache size: 151, Positive unconditional cache size: 32, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 234 PlacesBefore, 233 PlacesAfterwards, 548 TransitionsBefore, 547 TransitionsAfterwards, 2328 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 66, independent conditional: 66, 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: 66, independent: 66, independent conditional: 66, 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: 66, independent: 66, independent conditional: 36, independent unconditional: 30, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 66, independent conditional: 36, independent unconditional: 30, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 6, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, independent: 59, independent conditional: 30, independent unconditional: 29, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 266, Positive cache size: 253, Positive conditional cache size: 216, Positive unconditional cache size: 37, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 232 PlacesBefore, 232 PlacesAfterwards, 551 TransitionsBefore, 551 TransitionsAfterwards, 2334 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): 266, Positive cache size: 253, Positive conditional cache size: 216, Positive unconditional cache size: 37, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 233 PlacesBefore, 233 PlacesAfterwards, 548 TransitionsBefore, 548 TransitionsAfterwards, 2324 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): 266, Positive cache size: 253, Positive conditional cache size: 216, Positive unconditional cache size: 37, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 236 PlacesBefore, 235 PlacesAfterwards, 552 TransitionsBefore, 551 TransitionsAfterwards, 2338 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 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: 4, independent: 0, independent conditional: 0, 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): 270, Positive cache size: 257, Positive conditional cache size: 220, Positive unconditional cache size: 37, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 239 PlacesBefore, 239 PlacesAfterwards, 551 TransitionsBefore, 551 TransitionsAfterwards, 2338 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): 270, Positive cache size: 257, Positive conditional cache size: 220, Positive unconditional cache size: 37, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 242 PlacesBefore, 241 PlacesAfterwards, 555 TransitionsBefore, 554 TransitionsAfterwards, 2350 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: 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): 272, Positive cache size: 259, Positive conditional cache size: 222, Positive unconditional cache size: 37, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 243 PlacesBefore, 243 PlacesAfterwards, 553 TransitionsBefore, 553 TransitionsAfterwards, 2346 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): 272, Positive cache size: 259, Positive conditional cache size: 222, Positive unconditional cache size: 37, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 248 PlacesBefore, 247 PlacesAfterwards, 567 TransitionsBefore, 566 TransitionsAfterwards, 2358 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 4, independent unconditional: 8, 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: 4, independent unconditional: 8, 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: 12, independent: 12, independent conditional: 4, independent unconditional: 8, 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): 272, Positive cache size: 259, Positive conditional cache size: 222, Positive unconditional cache size: 37, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 251 PlacesBefore, 250 PlacesAfterwards, 565 TransitionsBefore, 564 TransitionsAfterwards, 2374 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 272, Positive cache size: 259, Positive conditional cache size: 222, Positive unconditional cache size: 37, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 252 PlacesBefore, 251 PlacesAfterwards, 569 TransitionsBefore, 568 TransitionsAfterwards, 2384 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 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: 4, independent: 0, independent conditional: 0, 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): 276, Positive cache size: 263, Positive conditional cache size: 226, Positive unconditional cache size: 37, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 254 PlacesBefore, 254 PlacesAfterwards, 569 TransitionsBefore, 569 TransitionsAfterwards, 2384 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): 276, Positive cache size: 263, Positive conditional cache size: 226, Positive unconditional cache size: 37, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 245 PlacesBefore, 245 PlacesAfterwards, 553 TransitionsBefore, 553 TransitionsAfterwards, 2316 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): 276, Positive cache size: 263, Positive conditional cache size: 226, Positive unconditional cache size: 37, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 276 PlacesBefore, 273 PlacesAfterwards, 637 TransitionsBefore, 634 TransitionsAfterwards, 2656 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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): 319, Positive cache size: 306, Positive conditional cache size: 267, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 282 PlacesBefore, 282 PlacesAfterwards, 641 TransitionsBefore, 641 TransitionsAfterwards, 2638 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): 319, Positive cache size: 306, Positive conditional cache size: 267, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 280 PlacesBefore, 280 PlacesAfterwards, 642 TransitionsBefore, 642 TransitionsAfterwards, 2654 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): 319, Positive cache size: 306, Positive conditional cache size: 267, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 275 PlacesBefore, 275 PlacesAfterwards, 637 TransitionsBefore, 637 TransitionsAfterwards, 2638 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): 319, Positive cache size: 306, Positive conditional cache size: 267, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 276 PlacesBefore, 276 PlacesAfterwards, 640 TransitionsBefore, 640 TransitionsAfterwards, 2650 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): 319, Positive cache size: 306, Positive conditional cache size: 267, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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.6s, 280 PlacesBefore, 281 PlacesAfterwards, 657 TransitionsBefore, 658 TransitionsAfterwards, 2716 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 105, independent: 105, independent conditional: 105, 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: 105, independent: 105, independent conditional: 100, independent unconditional: 5, 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: 105, independent: 105, independent conditional: 67, independent unconditional: 38, 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: 105, independent: 105, independent conditional: 67, independent unconditional: 38, 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: 53, independent: 53, independent conditional: 30, independent unconditional: 23, 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: 53, independent: 53, independent conditional: 0, independent unconditional: 53, 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: 105, independent: 52, independent conditional: 37, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 53, unknown conditional: 30, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 372, Positive cache size: 359, Positive conditional cache size: 297, Positive unconditional cache size: 62, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 282 PlacesBefore, 282 PlacesAfterwards, 641 TransitionsBefore, 641 TransitionsAfterwards, 2630 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 0, independent unconditional: 4, 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: 0, independent unconditional: 4, 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: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 374, Positive cache size: 361, Positive conditional cache size: 297, Positive unconditional cache size: 64, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 309 PlacesBefore, 307 PlacesAfterwards, 731 TransitionsBefore, 729 TransitionsAfterwards, 3052 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 16, independent unconditional: 2, 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: 18, independent: 18, independent conditional: 16, independent unconditional: 2, 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: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 18, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 393, Positive cache size: 380, Positive conditional cache size: 313, Positive unconditional cache size: 67, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 302 PlacesBefore, 301 PlacesAfterwards, 729 TransitionsBefore, 728 TransitionsAfterwards, 3016 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 393, Positive cache size: 380, Positive conditional cache size: 313, Positive unconditional cache size: 67, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 299 PlacesBefore, 299 PlacesAfterwards, 726 TransitionsBefore, 726 TransitionsAfterwards, 3006 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): 393, Positive cache size: 380, Positive conditional cache size: 313, Positive unconditional cache size: 67, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 298 PlacesBefore, 297 PlacesAfterwards, 723 TransitionsBefore, 722 TransitionsAfterwards, 2990 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 393, Positive cache size: 380, Positive conditional cache size: 313, Positive unconditional cache size: 67, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 298 PlacesBefore, 298 PlacesAfterwards, 714 TransitionsBefore, 714 TransitionsAfterwards, 2950 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): 393, Positive cache size: 380, Positive conditional cache size: 313, Positive unconditional cache size: 67, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 298 PlacesBefore, 298 PlacesAfterwards, 713 TransitionsBefore, 713 TransitionsAfterwards, 2946 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): 393, Positive cache size: 380, Positive conditional cache size: 313, Positive unconditional cache size: 67, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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: 2.3s, 296 PlacesBefore, 293 PlacesAfterwards, 702 TransitionsBefore, 677 TransitionsAfterwards, 2916 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 226, independent: 226, independent conditional: 226, 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: 226, independent: 226, independent conditional: 221, independent unconditional: 5, 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: 226, independent: 226, independent conditional: 221, independent unconditional: 5, 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: 226, independent: 226, independent conditional: 221, independent unconditional: 5, 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: 21, independent: 21, independent conditional: 16, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 226, independent: 205, independent conditional: 205, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 21, unknown conditional: 16, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 438, Positive cache size: 425, Positive conditional cache size: 353, Positive unconditional cache size: 72, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 05:40:33,332 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...