/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-min-max-dec.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 10:45:30,904 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 10:45:30,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 10:45:30,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 10:45:30,939 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 10:45:30,942 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 10:45:30,944 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 10:45:30,948 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 10:45:30,951 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 10:45:30,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 10:45:30,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 10:45:30,956 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 10:45:30,957 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 10:45:30,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 10:45:30,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 10:45:30,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 10:45:30,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 10:45:30,963 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 10:45:30,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 10:45:30,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 10:45:30,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 10:45:30,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 10:45:30,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 10:45:30,972 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 10:45:30,978 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 10:45:30,978 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 10:45:30,978 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 10:45:30,979 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 10:45:30,980 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 10:45:30,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 10:45:30,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 10:45:30,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 10:45:30,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 10:45:30,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 10:45:30,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 10:45:30,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 10:45:30,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 10:45:30,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 10:45:30,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 10:45:30,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 10:45:30,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 10:45:30,990 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-13 10:45:31,016 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 10:45:31,016 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 10:45:31,018 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 10:45:31,018 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 10:45:31,018 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 10:45:31,019 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 10:45:31,019 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 10:45:31,019 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 10:45:31,019 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 10:45:31,019 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 10:45:31,020 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 10:45:31,020 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 10:45:31,020 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 10:45:31,020 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 10:45:31,020 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 10:45:31,020 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 10:45:31,020 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 10:45:31,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 10:45:31,021 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 10:45:31,021 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 10:45:31,021 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 10:45:31,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:45:31,021 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 10:45:31,021 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 10:45:31,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 10:45:31,021 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 10:45:31,021 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 10:45:31,022 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 10:45:31,022 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 10:45:31,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-13 10:45:31,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 10:45:31,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 10:45:31,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 10:45:31,321 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 10:45:31,321 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 10:45:31,322 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2022-12-13 10:45:32,232 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 10:45:32,437 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 10:45:32,437 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2022-12-13 10:45:32,449 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c3863ba5/67c668673c88453ab172eb13549b2258/FLAG0a415b012 [2022-12-13 10:45:32,462 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c3863ba5/67c668673c88453ab172eb13549b2258 [2022-12-13 10:45:32,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 10:45:32,465 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 10:45:32,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 10:45:32,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 10:45:32,469 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 10:45:32,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:45:32" (1/1) ... [2022-12-13 10:45:32,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ed0358d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:45:32, skipping insertion in model container [2022-12-13 10:45:32,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:45:32" (1/1) ... [2022-12-13 10:45:32,474 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 10:45:32,494 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 10:45:32,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:45:32,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:45:32,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:45:32,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:45:32,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:45:32,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:45:32,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:45:32,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:45:32,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:45:32,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:45:32,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:45:32,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:45:32,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:45:32,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:45:32,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:45:32,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:45:32,642 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-min-max-dec.wvr.c[3019,3032] [2022-12-13 10:45:32,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:45:32,661 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 10:45:32,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:45:32,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:45:32,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:45:32,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:45:32,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:45:32,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:45:32,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:45:32,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:45:32,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:45:32,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:45:32,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:45:32,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:45:32,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:45:32,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:45:32,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:45:32,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:45:32,697 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-min-max-dec.wvr.c[3019,3032] [2022-12-13 10:45:32,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:45:32,710 INFO L208 MainTranslator]: Completed translation [2022-12-13 10:45:32,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:45:32 WrapperNode [2022-12-13 10:45:32,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 10:45:32,712 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 10:45:32,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 10:45:32,712 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 10:45:32,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:45:32" (1/1) ... [2022-12-13 10:45:32,732 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:45:32" (1/1) ... [2022-12-13 10:45:32,754 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2022-12-13 10:45:32,754 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 10:45:32,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 10:45:32,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 10:45:32,755 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 10:45:32,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:45:32" (1/1) ... [2022-12-13 10:45:32,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:45:32" (1/1) ... [2022-12-13 10:45:32,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:45:32" (1/1) ... [2022-12-13 10:45:32,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:45:32" (1/1) ... [2022-12-13 10:45:32,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:45:32" (1/1) ... [2022-12-13 10:45:32,784 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:45:32" (1/1) ... [2022-12-13 10:45:32,785 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:45:32" (1/1) ... [2022-12-13 10:45:32,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:45:32" (1/1) ... [2022-12-13 10:45:32,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 10:45:32,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 10:45:32,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 10:45:32,788 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 10:45:32,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:45:32" (1/1) ... [2022-12-13 10:45:32,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:45:32,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:45:32,835 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-13 10:45:32,843 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-13 10:45:32,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 10:45:32,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 10:45:32,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 10:45:32,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 10:45:32,868 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 10:45:32,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 10:45:32,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 10:45:32,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 10:45:32,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 10:45:32,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 10:45:32,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-13 10:45:32,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-13 10:45:32,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 10:45:32,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 10:45:32,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 10:45:32,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 10:45:32,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 10:45:32,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 10:45:32,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 10:45:32,870 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 10:45:32,945 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 10:45:32,946 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 10:45:33,151 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 10:45:33,208 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 10:45:33,208 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 10:45:33,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:45:33 BoogieIcfgContainer [2022-12-13 10:45:33,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 10:45:33,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 10:45:33,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 10:45:33,214 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 10:45:33,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:45:32" (1/3) ... [2022-12-13 10:45:33,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b4d166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:45:33, skipping insertion in model container [2022-12-13 10:45:33,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:45:32" (2/3) ... [2022-12-13 10:45:33,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b4d166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:45:33, skipping insertion in model container [2022-12-13 10:45:33,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:45:33" (3/3) ... [2022-12-13 10:45:33,216 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-dec.wvr.c [2022-12-13 10:45:33,228 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 10:45:33,229 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 10:45:33,229 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 10:45:33,278 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-13 10:45:33,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 160 transitions, 352 flow [2022-12-13 10:45:33,355 INFO L130 PetriNetUnfolder]: 12/156 cut-off events. [2022-12-13 10:45:33,355 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 10:45:33,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 156 events. 12/156 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 113 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2022-12-13 10:45:33,360 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 160 transitions, 352 flow [2022-12-13 10:45:33,366 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 144 transitions, 312 flow [2022-12-13 10:45:33,367 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:33,379 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 144 transitions, 312 flow [2022-12-13 10:45:33,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 144 transitions, 312 flow [2022-12-13 10:45:33,409 INFO L130 PetriNetUnfolder]: 12/144 cut-off events. [2022-12-13 10:45:33,409 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 10:45:33,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 144 events. 12/144 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 112 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2022-12-13 10:45:33,413 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 144 transitions, 312 flow [2022-12-13 10:45:33,413 INFO L226 LiptonReduction]: Number of co-enabled transitions 2280 [2022-12-13 10:45:38,209 INFO L241 LiptonReduction]: Total number of compositions: 113 [2022-12-13 10:45:38,220 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 10:45:38,223 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;@1e9307c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 10:45:38,224 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 10:45:38,229 INFO L130 PetriNetUnfolder]: 4/30 cut-off events. [2022-12-13 10:45:38,229 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 10:45:38,229 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:38,229 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:38,229 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:45:38,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:38,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1695043003, now seen corresponding path program 1 times [2022-12-13 10:45:38,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:38,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770099787] [2022-12-13 10:45:38,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:38,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:38,598 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-13 10:45:38,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:38,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770099787] [2022-12-13 10:45:38,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770099787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:45:38,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:45:38,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:45:38,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674915485] [2022-12-13 10:45:38,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:45:38,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:45:38,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:38,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:45:38,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:45:38,624 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-13 10:45:38,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:38,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:38,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-13 10:45:38,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:38,818 INFO L130 PetriNetUnfolder]: 1420/1898 cut-off events. [2022-12-13 10:45:38,818 INFO L131 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2022-12-13 10:45:38,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3999 conditions, 1898 events. 1420/1898 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7133 event pairs, 765 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 3498. Up to 1552 conditions per place. [2022-12-13 10:45:38,828 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 42 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2022-12-13 10:45:38,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 215 flow [2022-12-13 10:45:38,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:45:38,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:45:38,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-13 10:45:38,836 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2022-12-13 10:45:38,837 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 86 flow. Second operand 4 states and 50 transitions. [2022-12-13 10:45:38,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 215 flow [2022-12-13 10:45:38,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 193 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-12-13 10:45:38,842 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 84 flow [2022-12-13 10:45:38,843 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2022-12-13 10:45:38,845 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2022-12-13 10:45:38,845 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:38,845 INFO L89 Accepts]: Start accepts. Operand has 36 places, 32 transitions, 84 flow [2022-12-13 10:45:38,847 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:38,848 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:38,848 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 32 transitions, 84 flow [2022-12-13 10:45:38,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 84 flow [2022-12-13 10:45:38,852 INFO L130 PetriNetUnfolder]: 4/32 cut-off events. [2022-12-13 10:45:38,852 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 10:45:38,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 4/32 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 30. Up to 4 conditions per place. [2022-12-13 10:45:38,853 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 32 transitions, 84 flow [2022-12-13 10:45:38,853 INFO L226 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-13 10:45:38,871 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:45:38,872 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 10:45:38,872 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 84 flow [2022-12-13 10:45:38,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:38,872 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:38,873 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:38,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 10:45:38,873 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:45:38,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:38,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1731643137, now seen corresponding path program 1 times [2022-12-13 10:45:38,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:38,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004673445] [2022-12-13 10:45:38,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:38,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:38,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:45:38,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:38,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004673445] [2022-12-13 10:45:38,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004673445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:45:38,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:45:38,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:45:38,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398844547] [2022-12-13 10:45:38,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:45:38,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:45:38,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:38,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:45:38,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:45:38,952 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 10:45:38,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:38,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:38,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 10:45:38,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:39,145 INFO L130 PetriNetUnfolder]: 1718/2336 cut-off events. [2022-12-13 10:45:39,145 INFO L131 PetriNetUnfolder]: For 541/541 co-relation queries the response was YES. [2022-12-13 10:45:39,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5313 conditions, 2336 events. 1718/2336 cut-off events. For 541/541 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8137 event pairs, 977 based on Foata normal form. 0/1943 useless extension candidates. Maximal degree in co-relation 2424. Up to 1790 conditions per place. [2022-12-13 10:45:39,155 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 47 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2022-12-13 10:45:39,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 233 flow [2022-12-13 10:45:39,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:45:39,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:45:39,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-13 10:45:39,156 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3951612903225806 [2022-12-13 10:45:39,157 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 84 flow. Second operand 4 states and 49 transitions. [2022-12-13 10:45:39,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 233 flow [2022-12-13 10:45:39,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 223 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 10:45:39,158 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2022-12-13 10:45:39,158 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2022-12-13 10:45:39,159 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2022-12-13 10:45:39,159 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:39,159 INFO L89 Accepts]: Start accepts. Operand has 38 places, 33 transitions, 92 flow [2022-12-13 10:45:39,160 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:39,160 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:39,160 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 33 transitions, 92 flow [2022-12-13 10:45:39,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 92 flow [2022-12-13 10:45:39,165 INFO L130 PetriNetUnfolder]: 4/33 cut-off events. [2022-12-13 10:45:39,165 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 10:45:39,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 33 events. 4/33 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 33. Up to 4 conditions per place. [2022-12-13 10:45:39,165 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 33 transitions, 92 flow [2022-12-13 10:45:39,166 INFO L226 LiptonReduction]: Number of co-enabled transitions 334 [2022-12-13 10:45:39,249 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:45:39,250 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 10:45:39,250 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 88 flow [2022-12-13 10:45:39,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:39,250 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:39,250 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:39,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 10:45:39,251 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:45:39,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:39,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1115120276, now seen corresponding path program 1 times [2022-12-13 10:45:39,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:39,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67668272] [2022-12-13 10:45:39,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:39,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:45:39,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:39,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67668272] [2022-12-13 10:45:39,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67668272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:45:39,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:45:39,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:45:39,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278159886] [2022-12-13 10:45:39,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:45:39,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:45:39,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:39,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:45:39,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:45:39,317 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 10:45:39,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:39,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:39,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 10:45:39,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:39,471 INFO L130 PetriNetUnfolder]: 1632/2222 cut-off events. [2022-12-13 10:45:39,472 INFO L131 PetriNetUnfolder]: For 867/867 co-relation queries the response was YES. [2022-12-13 10:45:39,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5558 conditions, 2222 events. 1632/2222 cut-off events. For 867/867 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7613 event pairs, 977 based on Foata normal form. 0/1833 useless extension candidates. Maximal degree in co-relation 1664. Up to 1790 conditions per place. [2022-12-13 10:45:39,482 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 46 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2022-12-13 10:45:39,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 237 flow [2022-12-13 10:45:39,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:45:39,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:45:39,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-13 10:45:39,483 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2022-12-13 10:45:39,483 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 88 flow. Second operand 4 states and 48 transitions. [2022-12-13 10:45:39,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 237 flow [2022-12-13 10:45:39,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 219 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-13 10:45:39,485 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2022-12-13 10:45:39,486 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2022-12-13 10:45:39,486 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2022-12-13 10:45:39,486 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:39,486 INFO L89 Accepts]: Start accepts. Operand has 38 places, 33 transitions, 92 flow [2022-12-13 10:45:39,487 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:39,487 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:39,487 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 33 transitions, 92 flow [2022-12-13 10:45:39,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 92 flow [2022-12-13 10:45:39,491 INFO L130 PetriNetUnfolder]: 4/33 cut-off events. [2022-12-13 10:45:39,491 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 10:45:39,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 33 events. 4/33 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 31 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 32. Up to 4 conditions per place. [2022-12-13 10:45:39,491 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 33 transitions, 92 flow [2022-12-13 10:45:39,491 INFO L226 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-13 10:45:39,504 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:45:39,505 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 10:45:39,505 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 92 flow [2022-12-13 10:45:39,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:39,505 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:39,505 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:39,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 10:45:39,505 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:45:39,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:39,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1272676707, now seen corresponding path program 1 times [2022-12-13 10:45:39,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:39,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75183863] [2022-12-13 10:45:39,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:39,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:39,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 10:45:39,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:39,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75183863] [2022-12-13 10:45:39,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75183863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:45:39,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:45:39,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 10:45:39,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136403483] [2022-12-13 10:45:39,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:45:39,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:45:39,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:39,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:45:39,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:45:39,588 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 10:45:39,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:39,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:39,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 10:45:39,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:39,730 INFO L130 PetriNetUnfolder]: 1632/2223 cut-off events. [2022-12-13 10:45:39,731 INFO L131 PetriNetUnfolder]: For 699/699 co-relation queries the response was YES. [2022-12-13 10:45:39,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5424 conditions, 2223 events. 1632/2223 cut-off events. For 699/699 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7397 event pairs, 1243 based on Foata normal form. 0/1834 useless extension candidates. Maximal degree in co-relation 1727. Up to 2223 conditions per place. [2022-12-13 10:45:39,740 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 32 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2022-12-13 10:45:39,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 162 flow [2022-12-13 10:45:39,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:45:39,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:45:39,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-13 10:45:39,752 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2022-12-13 10:45:39,752 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 92 flow. Second operand 3 states and 33 transitions. [2022-12-13 10:45:39,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 162 flow [2022-12-13 10:45:39,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 34 transitions, 156 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 10:45:39,754 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 98 flow [2022-12-13 10:45:39,754 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2022-12-13 10:45:39,754 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2022-12-13 10:45:39,754 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:39,754 INFO L89 Accepts]: Start accepts. Operand has 39 places, 34 transitions, 98 flow [2022-12-13 10:45:39,755 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:39,755 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:39,755 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 34 transitions, 98 flow [2022-12-13 10:45:39,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 34 transitions, 98 flow [2022-12-13 10:45:39,761 INFO L130 PetriNetUnfolder]: 4/34 cut-off events. [2022-12-13 10:45:39,761 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 10:45:39,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 34 events. 4/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 44. Up to 4 conditions per place. [2022-12-13 10:45:39,762 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 34 transitions, 98 flow [2022-12-13 10:45:39,762 INFO L226 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-13 10:45:40,878 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:45:40,879 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1125 [2022-12-13 10:45:40,879 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 94 flow [2022-12-13 10:45:40,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:40,880 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:40,880 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:40,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 10:45:40,880 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:45:40,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:40,880 INFO L85 PathProgramCache]: Analyzing trace with hash -922744889, now seen corresponding path program 1 times [2022-12-13 10:45:40,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:40,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114703122] [2022-12-13 10:45:40,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:40,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:41,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:45:41,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:41,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114703122] [2022-12-13 10:45:41,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114703122] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:45:41,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631662443] [2022-12-13 10:45:41,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:41,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:41,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:45:41,895 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-13 10:45:41,913 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-13 10:45:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:42,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 10:45:42,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:45:42,056 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 11 treesize of output 7 [2022-12-13 10:45:42,090 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-13 10:45:42,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:45:42,191 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 14 treesize of output 16 [2022-12-13 10:45:42,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:45:42,319 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 14 treesize of output 16 [2022-12-13 10:45:42,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:45:42,433 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 21 treesize of output 21 [2022-12-13 10:45:42,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 35 treesize of output 19 [2022-12-13 10:45:42,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 44 treesize of output 28 [2022-12-13 10:45:42,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:45:42,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:45:43,012 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) c_~A~0.base) c_~A~0.offset))) (or (< 2147483646 .cse0) (< c_~min~0 (+ .cse0 2))))) (= (mod c_~b1~0 256) 0)) is different from false [2022-12-13 10:45:43,195 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (or (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 (+ 2 .cse0)) (< 2147483646 .cse0)))) (not (< c_~min~0 (select (select .cse1 c_~A~0.base) c_~A~0.offset)))))) (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse2 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 .cse2) (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) c_~A~0.base) c_~A~0.offset))) (or (< .cse2 (+ 2 .cse3)) (< 2147483646 .cse3))))))))) is different from false [2022-12-13 10:45:43,216 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) c_~A~0.base) c_~A~0.offset)) (.cse0 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (< .cse0 (+ 3 .cse1)) (< 2147483646 .cse1) (< .cse0 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1)))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse4 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) c_~A~0.base) c_~A~0.offset))) (or (< (select (select .cse3 c_~A~0.base) c_~A~0.offset) (+ 2 .cse4)) (< 2147483646 .cse4)))))) is different from false [2022-12-13 10:45:43,243 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183))) (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse0 (+ (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (< .cse0 (+ .cse2 3)) (< 2147483646 .cse2)))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse5 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse5 2)) (< 2147483646 .cse5)))))) is different from false [2022-12-13 10:45:43,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:45:43,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631662443] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:45:43,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:45:43,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2022-12-13 10:45:43,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043209978] [2022-12-13 10:45:43,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:45:43,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-13 10:45:43,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:43,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-13 10:45:43,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1131, Unknown=9, NotChecked=292, Total=1640 [2022-12-13 10:45:43,247 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 10:45:43,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 94 flow. Second operand has 41 states, 40 states have (on average 2.175) internal successors, (87), 40 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:43,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:43,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 10:45:43,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:59,652 INFO L130 PetriNetUnfolder]: 23026/31879 cut-off events. [2022-12-13 10:45:59,652 INFO L131 PetriNetUnfolder]: For 5551/5551 co-relation queries the response was YES. [2022-12-13 10:45:59,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75266 conditions, 31879 events. 23026/31879 cut-off events. For 5551/5551 co-relation queries the response was YES. Maximal size of possible extension queue 1152. Compared 183478 event pairs, 312 based on Foata normal form. 30/23917 useless extension candidates. Maximal degree in co-relation 75256. Up to 6489 conditions per place. [2022-12-13 10:45:59,743 INFO L137 encePairwiseOnDemand]: 18/31 looper letters, 803 selfloop transitions, 235 changer transitions 1145/2183 dead transitions. [2022-12-13 10:45:59,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 2183 transitions, 10163 flow [2022-12-13 10:45:59,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2022-12-13 10:45:59,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2022-12-13 10:45:59,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 2177 transitions. [2022-12-13 10:45:59,752 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3879878809481376 [2022-12-13 10:45:59,752 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 94 flow. Second operand 181 states and 2177 transitions. [2022-12-13 10:45:59,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 2183 transitions, 10163 flow [2022-12-13 10:45:59,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 2183 transitions, 10151 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 10:45:59,890 INFO L231 Difference]: Finished difference. Result has 319 places, 343 transitions, 2108 flow [2022-12-13 10:45:59,890 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=181, PETRI_FLOW=2108, PETRI_PLACES=319, PETRI_TRANSITIONS=343} [2022-12-13 10:45:59,892 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 279 predicate places. [2022-12-13 10:45:59,893 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:59,893 INFO L89 Accepts]: Start accepts. Operand has 319 places, 343 transitions, 2108 flow [2022-12-13 10:45:59,899 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:59,899 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:59,899 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 319 places, 343 transitions, 2108 flow [2022-12-13 10:45:59,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 230 places, 343 transitions, 2108 flow [2022-12-13 10:46:00,248 INFO L130 PetriNetUnfolder]: 723/1870 cut-off events. [2022-12-13 10:46:00,248 INFO L131 PetriNetUnfolder]: For 28238/28385 co-relation queries the response was YES. [2022-12-13 10:46:00,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5515 conditions, 1870 events. 723/1870 cut-off events. For 28238/28385 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 14480 event pairs, 3 based on Foata normal form. 0/1774 useless extension candidates. Maximal degree in co-relation 5396. Up to 403 conditions per place. [2022-12-13 10:46:00,276 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 230 places, 343 transitions, 2108 flow [2022-12-13 10:46:00,277 INFO L226 LiptonReduction]: Number of co-enabled transitions 4202 [2022-12-13 10:46:00,296 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [532] L84-4-->L84-4: Formula: (let ((.cse0 (select |v_#memory_int_126| v_~A~0.base_66)) (.cse1 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_34| 4) v_~A~0.offset_66))) (let ((.cse2 (select .cse0 .cse1))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_#memory_int_125| (store |v_#memory_int_126| v_~A~0.base_66 (store .cse0 .cse1 (+ .cse2 (- 1))))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| (ite (< 0 (+ .cse2 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_33| (+ |v_thread3Thread1of1ForFork0_~i~2#1_34| 1)) (< |v_thread3Thread1of1ForFork0_~i~2#1_34| v_~N~0_29) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|)))) InVars {~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_34|} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_17|, ~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, #memory_int=|v_#memory_int_125|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_19|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_33|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_17|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] and [620] L56-4-->L56-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_35 (+ v_thread1Thread1of1ForFork1_~i~0_36 1)) (< v_thread1Thread1of1ForFork1_~i~0_36 v_~N~0_77) (let ((.cse1 (select (select |v_#memory_int_213| v_~A~0.base_104) (+ v_~A~0.offset_104 (* v_thread1Thread1of1ForFork1_~i~0_36 4))))) (let ((.cse0 (< v_~min~0_74 .cse1))) (or (and (= v_~min~0_74 v_~min~0_73) .cse0 (= |v_thread1_#t~mem4_34| |v_thread1Thread1of1ForFork1_#t~mem4_22|)) (and (not .cse0) (= v_~min~0_73 |v_thread1_#t~mem4_34|) (= .cse1 |v_thread1_#t~mem4_34|)))))) InVars {~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_22|, ~min~0=v_~min~0_74, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_36, ~N~0=v_~N~0_77} OutVars{~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_13|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_17|, ~min~0=v_~min~0_73, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, ~N~0=v_~N~0_77, thread1Thread1of1ForFork1_#t~ite5=|v_thread1Thread1of1ForFork1_#t~ite5_13|} AuxVars[|v_thread1_#t~mem4_34|] AssignedVars[thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~post2, ~min~0, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#t~ite5] [2022-12-13 10:46:00,428 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [532] L84-4-->L84-4: Formula: (let ((.cse0 (select |v_#memory_int_126| v_~A~0.base_66)) (.cse1 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_34| 4) v_~A~0.offset_66))) (let ((.cse2 (select .cse0 .cse1))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_#memory_int_125| (store |v_#memory_int_126| v_~A~0.base_66 (store .cse0 .cse1 (+ .cse2 (- 1))))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| (ite (< 0 (+ .cse2 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_33| (+ |v_thread3Thread1of1ForFork0_~i~2#1_34| 1)) (< |v_thread3Thread1of1ForFork0_~i~2#1_34| v_~N~0_29) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|)))) InVars {~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_34|} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_17|, ~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, #memory_int=|v_#memory_int_125|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_19|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_33|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_17|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] and [593] L74-4-->L74-4: Formula: (and (= v_thread2Thread1of1ForFork3_~i~1_31 (+ v_thread2Thread1of1ForFork3_~i~1_32 1)) (let ((.cse1 (select (select |v_#memory_int_177| v_~A~0.base_88) (+ v_~A~0.offset_88 (* v_thread2Thread1of1ForFork3_~i~1_32 4))))) (let ((.cse0 (< .cse1 v_~max~0_69))) (or (and .cse0 (= v_~max~0_69 v_~max~0_68) (= |v_thread2_#t~mem9_36| |v_thread2Thread1of1ForFork3_#t~mem9_22|)) (and (not .cse0) (= .cse1 |v_thread2_#t~mem9_36|) (= |v_thread2_#t~mem9_36| v_~max~0_68))))) (< v_thread2Thread1of1ForFork3_~i~1_32 v_~N~0_55)) InVars {~A~0.base=v_~A~0.base_88, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_32, ~A~0.offset=v_~A~0.offset_88, thread2Thread1of1ForFork3_#t~mem9=|v_thread2Thread1of1ForFork3_#t~mem9_22|, #memory_int=|v_#memory_int_177|, ~max~0=v_~max~0_69, ~N~0=v_~N~0_55} OutVars{~A~0.base=v_~A~0.base_88, thread2Thread1of1ForFork3_#t~ite10=|v_thread2Thread1of1ForFork3_#t~ite10_13|, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_31, ~A~0.offset=v_~A~0.offset_88, thread2Thread1of1ForFork3_#t~post7=|v_thread2Thread1of1ForFork3_#t~post7_19|, thread2Thread1of1ForFork3_#t~mem8=|v_thread2Thread1of1ForFork3_#t~mem8_13|, #memory_int=|v_#memory_int_177|, ~max~0=v_~max~0_68, ~N~0=v_~N~0_55} AuxVars[|v_thread2_#t~mem9_36|] AssignedVars[thread2Thread1of1ForFork3_#t~ite10, thread2Thread1of1ForFork3_~i~1, thread2Thread1of1ForFork3_#t~post7, thread2Thread1of1ForFork3_#t~mem9, thread2Thread1of1ForFork3_#t~mem8, ~max~0] [2022-12-13 10:46:00,561 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [532] L84-4-->L84-4: Formula: (let ((.cse0 (select |v_#memory_int_126| v_~A~0.base_66)) (.cse1 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_34| 4) v_~A~0.offset_66))) (let ((.cse2 (select .cse0 .cse1))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_#memory_int_125| (store |v_#memory_int_126| v_~A~0.base_66 (store .cse0 .cse1 (+ .cse2 (- 1))))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| (ite (< 0 (+ .cse2 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_33| (+ |v_thread3Thread1of1ForFork0_~i~2#1_34| 1)) (< |v_thread3Thread1of1ForFork0_~i~2#1_34| v_~N~0_29) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|)))) InVars {~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_34|} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_17|, ~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, #memory_int=|v_#memory_int_125|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_19|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_33|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_17|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] and [593] L74-4-->L74-4: Formula: (and (= v_thread2Thread1of1ForFork3_~i~1_31 (+ v_thread2Thread1of1ForFork3_~i~1_32 1)) (let ((.cse1 (select (select |v_#memory_int_177| v_~A~0.base_88) (+ v_~A~0.offset_88 (* v_thread2Thread1of1ForFork3_~i~1_32 4))))) (let ((.cse0 (< .cse1 v_~max~0_69))) (or (and .cse0 (= v_~max~0_69 v_~max~0_68) (= |v_thread2_#t~mem9_36| |v_thread2Thread1of1ForFork3_#t~mem9_22|)) (and (not .cse0) (= .cse1 |v_thread2_#t~mem9_36|) (= |v_thread2_#t~mem9_36| v_~max~0_68))))) (< v_thread2Thread1of1ForFork3_~i~1_32 v_~N~0_55)) InVars {~A~0.base=v_~A~0.base_88, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_32, ~A~0.offset=v_~A~0.offset_88, thread2Thread1of1ForFork3_#t~mem9=|v_thread2Thread1of1ForFork3_#t~mem9_22|, #memory_int=|v_#memory_int_177|, ~max~0=v_~max~0_69, ~N~0=v_~N~0_55} OutVars{~A~0.base=v_~A~0.base_88, thread2Thread1of1ForFork3_#t~ite10=|v_thread2Thread1of1ForFork3_#t~ite10_13|, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_31, ~A~0.offset=v_~A~0.offset_88, thread2Thread1of1ForFork3_#t~post7=|v_thread2Thread1of1ForFork3_#t~post7_19|, thread2Thread1of1ForFork3_#t~mem8=|v_thread2Thread1of1ForFork3_#t~mem8_13|, #memory_int=|v_#memory_int_177|, ~max~0=v_~max~0_68, ~N~0=v_~N~0_55} AuxVars[|v_thread2_#t~mem9_36|] AssignedVars[thread2Thread1of1ForFork3_#t~ite10, thread2Thread1of1ForFork3_~i~1, thread2Thread1of1ForFork3_#t~post7, thread2Thread1of1ForFork3_#t~mem9, thread2Thread1of1ForFork3_#t~mem8, ~max~0] [2022-12-13 10:46:00,674 WARN L322 ript$VariableManager]: TermVariable LBE276 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:46:00,674 WARN L322 ript$VariableManager]: TermVariable LBE271 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:46:00,830 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [620] L56-4-->L56-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_35 (+ v_thread1Thread1of1ForFork1_~i~0_36 1)) (< v_thread1Thread1of1ForFork1_~i~0_36 v_~N~0_77) (let ((.cse1 (select (select |v_#memory_int_213| v_~A~0.base_104) (+ v_~A~0.offset_104 (* v_thread1Thread1of1ForFork1_~i~0_36 4))))) (let ((.cse0 (< v_~min~0_74 .cse1))) (or (and (= v_~min~0_74 v_~min~0_73) .cse0 (= |v_thread1_#t~mem4_34| |v_thread1Thread1of1ForFork1_#t~mem4_22|)) (and (not .cse0) (= v_~min~0_73 |v_thread1_#t~mem4_34|) (= .cse1 |v_thread1_#t~mem4_34|)))))) InVars {~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_22|, ~min~0=v_~min~0_74, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_36, ~N~0=v_~N~0_77} OutVars{~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_13|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_17|, ~min~0=v_~min~0_73, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, ~N~0=v_~N~0_77, thread1Thread1of1ForFork1_#t~ite5=|v_thread1Thread1of1ForFork1_#t~ite5_13|} AuxVars[|v_thread1_#t~mem4_34|] AssignedVars[thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~post2, ~min~0, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#t~ite5] and [593] L74-4-->L74-4: Formula: (and (= v_thread2Thread1of1ForFork3_~i~1_31 (+ v_thread2Thread1of1ForFork3_~i~1_32 1)) (let ((.cse1 (select (select |v_#memory_int_177| v_~A~0.base_88) (+ v_~A~0.offset_88 (* v_thread2Thread1of1ForFork3_~i~1_32 4))))) (let ((.cse0 (< .cse1 v_~max~0_69))) (or (and .cse0 (= v_~max~0_69 v_~max~0_68) (= |v_thread2_#t~mem9_36| |v_thread2Thread1of1ForFork3_#t~mem9_22|)) (and (not .cse0) (= .cse1 |v_thread2_#t~mem9_36|) (= |v_thread2_#t~mem9_36| v_~max~0_68))))) (< v_thread2Thread1of1ForFork3_~i~1_32 v_~N~0_55)) InVars {~A~0.base=v_~A~0.base_88, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_32, ~A~0.offset=v_~A~0.offset_88, thread2Thread1of1ForFork3_#t~mem9=|v_thread2Thread1of1ForFork3_#t~mem9_22|, #memory_int=|v_#memory_int_177|, ~max~0=v_~max~0_69, ~N~0=v_~N~0_55} OutVars{~A~0.base=v_~A~0.base_88, thread2Thread1of1ForFork3_#t~ite10=|v_thread2Thread1of1ForFork3_#t~ite10_13|, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_31, ~A~0.offset=v_~A~0.offset_88, thread2Thread1of1ForFork3_#t~post7=|v_thread2Thread1of1ForFork3_#t~post7_19|, thread2Thread1of1ForFork3_#t~mem8=|v_thread2Thread1of1ForFork3_#t~mem8_13|, #memory_int=|v_#memory_int_177|, ~max~0=v_~max~0_68, ~N~0=v_~N~0_55} AuxVars[|v_thread2_#t~mem9_36|] AssignedVars[thread2Thread1of1ForFork3_#t~ite10, thread2Thread1of1ForFork3_~i~1, thread2Thread1of1ForFork3_#t~post7, thread2Thread1of1ForFork3_#t~mem9, thread2Thread1of1ForFork3_#t~mem8, ~max~0] [2022-12-13 10:46:01,084 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [583] L50-->L56-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_31 0) (= v_~b1~0_26 1)) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, ~b1~0=v_~b1~0_26} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, ~b1~0] and [593] L74-4-->L74-4: Formula: (and (= v_thread2Thread1of1ForFork3_~i~1_31 (+ v_thread2Thread1of1ForFork3_~i~1_32 1)) (let ((.cse1 (select (select |v_#memory_int_177| v_~A~0.base_88) (+ v_~A~0.offset_88 (* v_thread2Thread1of1ForFork3_~i~1_32 4))))) (let ((.cse0 (< .cse1 v_~max~0_69))) (or (and .cse0 (= v_~max~0_69 v_~max~0_68) (= |v_thread2_#t~mem9_36| |v_thread2Thread1of1ForFork3_#t~mem9_22|)) (and (not .cse0) (= .cse1 |v_thread2_#t~mem9_36|) (= |v_thread2_#t~mem9_36| v_~max~0_68))))) (< v_thread2Thread1of1ForFork3_~i~1_32 v_~N~0_55)) InVars {~A~0.base=v_~A~0.base_88, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_32, ~A~0.offset=v_~A~0.offset_88, thread2Thread1of1ForFork3_#t~mem9=|v_thread2Thread1of1ForFork3_#t~mem9_22|, #memory_int=|v_#memory_int_177|, ~max~0=v_~max~0_69, ~N~0=v_~N~0_55} OutVars{~A~0.base=v_~A~0.base_88, thread2Thread1of1ForFork3_#t~ite10=|v_thread2Thread1of1ForFork3_#t~ite10_13|, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_31, ~A~0.offset=v_~A~0.offset_88, thread2Thread1of1ForFork3_#t~post7=|v_thread2Thread1of1ForFork3_#t~post7_19|, thread2Thread1of1ForFork3_#t~mem8=|v_thread2Thread1of1ForFork3_#t~mem8_13|, #memory_int=|v_#memory_int_177|, ~max~0=v_~max~0_68, ~N~0=v_~N~0_55} AuxVars[|v_thread2_#t~mem9_36|] AssignedVars[thread2Thread1of1ForFork3_#t~ite10, thread2Thread1of1ForFork3_~i~1, thread2Thread1of1ForFork3_#t~post7, thread2Thread1of1ForFork3_#t~mem9, thread2Thread1of1ForFork3_#t~mem8, ~max~0] [2022-12-13 10:46:01,148 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [583] L50-->L56-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_31 0) (= v_~b1~0_26 1)) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, ~b1~0=v_~b1~0_26} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, ~b1~0] and [532] L84-4-->L84-4: Formula: (let ((.cse0 (select |v_#memory_int_126| v_~A~0.base_66)) (.cse1 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_34| 4) v_~A~0.offset_66))) (let ((.cse2 (select .cse0 .cse1))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_#memory_int_125| (store |v_#memory_int_126| v_~A~0.base_66 (store .cse0 .cse1 (+ .cse2 (- 1))))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| (ite (< 0 (+ .cse2 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_33| (+ |v_thread3Thread1of1ForFork0_~i~2#1_34| 1)) (< |v_thread3Thread1of1ForFork0_~i~2#1_34| v_~N~0_29) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|)))) InVars {~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_34|} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_17|, ~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, #memory_int=|v_#memory_int_125|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_19|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_33|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_17|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-13 10:46:04,349 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [632] $Ultimate##0-->L84-4: Formula: (let ((.cse1 (select |v_#memory_int_258| v_~A~0.base_127)) (.cse2 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_41| 4) v_~A~0.offset_127 (- 4)))) (let ((.cse0 (select .cse1 .cse2))) (and (< |v_thread3Thread1of1ForFork0_~i~2#1_41| (+ 1 v_~N~0_99)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|) (= (store |v_#memory_int_258| v_~A~0.base_127 (store .cse1 .cse2 (+ (- 1) .cse0))) |v_#memory_int_257|) (= |v_thread3Thread1of1ForFork0_~i~2#1_41| 1)))) InVars {~A~0.base=v_~A~0.base_127, ~A~0.offset=v_~A~0.offset_127, #memory_int=|v_#memory_int_258|, ~N~0=v_~N~0_99} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_19|, ~A~0.base=v_~A~0.base_127, ~A~0.offset=v_~A~0.offset_127, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|, #memory_int=|v_#memory_int_257|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_23|, ~N~0=v_~N~0_99, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_41|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_19|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_19|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-13 10:46:04,401 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [620] L56-4-->L56-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_35 (+ v_thread1Thread1of1ForFork1_~i~0_36 1)) (< v_thread1Thread1of1ForFork1_~i~0_36 v_~N~0_77) (let ((.cse1 (select (select |v_#memory_int_213| v_~A~0.base_104) (+ v_~A~0.offset_104 (* v_thread1Thread1of1ForFork1_~i~0_36 4))))) (let ((.cse0 (< v_~min~0_74 .cse1))) (or (and (= v_~min~0_74 v_~min~0_73) .cse0 (= |v_thread1_#t~mem4_34| |v_thread1Thread1of1ForFork1_#t~mem4_22|)) (and (not .cse0) (= v_~min~0_73 |v_thread1_#t~mem4_34|) (= .cse1 |v_thread1_#t~mem4_34|)))))) InVars {~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_22|, ~min~0=v_~min~0_74, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_36, ~N~0=v_~N~0_77} OutVars{~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_13|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_17|, ~min~0=v_~min~0_73, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, ~N~0=v_~N~0_77, thread1Thread1of1ForFork1_#t~ite5=|v_thread1Thread1of1ForFork1_#t~ite5_13|} AuxVars[|v_thread1_#t~mem4_34|] AssignedVars[thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~post2, ~min~0, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#t~ite5] [2022-12-13 10:46:04,529 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [532] L84-4-->L84-4: Formula: (let ((.cse0 (select |v_#memory_int_126| v_~A~0.base_66)) (.cse1 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_34| 4) v_~A~0.offset_66))) (let ((.cse2 (select .cse0 .cse1))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_#memory_int_125| (store |v_#memory_int_126| v_~A~0.base_66 (store .cse0 .cse1 (+ .cse2 (- 1))))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| (ite (< 0 (+ .cse2 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_33| (+ |v_thread3Thread1of1ForFork0_~i~2#1_34| 1)) (< |v_thread3Thread1of1ForFork0_~i~2#1_34| v_~N~0_29) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|)))) InVars {~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_34|} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_17|, ~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, #memory_int=|v_#memory_int_125|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_19|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_33|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_17|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-13 10:46:04,603 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [583] L50-->L56-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_31 0) (= v_~b1~0_26 1)) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, ~b1~0=v_~b1~0_26} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, ~b1~0] and [532] L84-4-->L84-4: Formula: (let ((.cse0 (select |v_#memory_int_126| v_~A~0.base_66)) (.cse1 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_34| 4) v_~A~0.offset_66))) (let ((.cse2 (select .cse0 .cse1))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_#memory_int_125| (store |v_#memory_int_126| v_~A~0.base_66 (store .cse0 .cse1 (+ .cse2 (- 1))))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| (ite (< 0 (+ .cse2 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_33| (+ |v_thread3Thread1of1ForFork0_~i~2#1_34| 1)) (< |v_thread3Thread1of1ForFork0_~i~2#1_34| v_~N~0_29) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|)))) InVars {~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_34|} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_17|, ~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, #memory_int=|v_#memory_int_125|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_19|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_33|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_17|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-13 10:46:04,649 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [583] L50-->L56-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_31 0) (= v_~b1~0_26 1)) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, ~b1~0=v_~b1~0_26} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, ~b1~0] and [632] $Ultimate##0-->L84-4: Formula: (let ((.cse1 (select |v_#memory_int_258| v_~A~0.base_127)) (.cse2 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_41| 4) v_~A~0.offset_127 (- 4)))) (let ((.cse0 (select .cse1 .cse2))) (and (< |v_thread3Thread1of1ForFork0_~i~2#1_41| (+ 1 v_~N~0_99)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|) (= (store |v_#memory_int_258| v_~A~0.base_127 (store .cse1 .cse2 (+ (- 1) .cse0))) |v_#memory_int_257|) (= |v_thread3Thread1of1ForFork0_~i~2#1_41| 1)))) InVars {~A~0.base=v_~A~0.base_127, ~A~0.offset=v_~A~0.offset_127, #memory_int=|v_#memory_int_258|, ~N~0=v_~N~0_99} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_19|, ~A~0.base=v_~A~0.base_127, ~A~0.offset=v_~A~0.offset_127, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|, #memory_int=|v_#memory_int_257|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_23|, ~N~0=v_~N~0_99, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_41|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_19|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_19|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-13 10:46:04,753 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [583] L50-->L56-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_31 0) (= v_~b1~0_26 1)) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, ~b1~0=v_~b1~0_26} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, ~b1~0] and [593] L74-4-->L74-4: Formula: (and (= v_thread2Thread1of1ForFork3_~i~1_31 (+ v_thread2Thread1of1ForFork3_~i~1_32 1)) (let ((.cse1 (select (select |v_#memory_int_177| v_~A~0.base_88) (+ v_~A~0.offset_88 (* v_thread2Thread1of1ForFork3_~i~1_32 4))))) (let ((.cse0 (< .cse1 v_~max~0_69))) (or (and .cse0 (= v_~max~0_69 v_~max~0_68) (= |v_thread2_#t~mem9_36| |v_thread2Thread1of1ForFork3_#t~mem9_22|)) (and (not .cse0) (= .cse1 |v_thread2_#t~mem9_36|) (= |v_thread2_#t~mem9_36| v_~max~0_68))))) (< v_thread2Thread1of1ForFork3_~i~1_32 v_~N~0_55)) InVars {~A~0.base=v_~A~0.base_88, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_32, ~A~0.offset=v_~A~0.offset_88, thread2Thread1of1ForFork3_#t~mem9=|v_thread2Thread1of1ForFork3_#t~mem9_22|, #memory_int=|v_#memory_int_177|, ~max~0=v_~max~0_69, ~N~0=v_~N~0_55} OutVars{~A~0.base=v_~A~0.base_88, thread2Thread1of1ForFork3_#t~ite10=|v_thread2Thread1of1ForFork3_#t~ite10_13|, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_31, ~A~0.offset=v_~A~0.offset_88, thread2Thread1of1ForFork3_#t~post7=|v_thread2Thread1of1ForFork3_#t~post7_19|, thread2Thread1of1ForFork3_#t~mem8=|v_thread2Thread1of1ForFork3_#t~mem8_13|, #memory_int=|v_#memory_int_177|, ~max~0=v_~max~0_68, ~N~0=v_~N~0_55} AuxVars[|v_thread2_#t~mem9_36|] AssignedVars[thread2Thread1of1ForFork3_#t~ite10, thread2Thread1of1ForFork3_~i~1, thread2Thread1of1ForFork3_#t~post7, thread2Thread1of1ForFork3_#t~mem9, thread2Thread1of1ForFork3_#t~mem8, ~max~0] [2022-12-13 10:46:04,834 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [620] L56-4-->L56-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_35 (+ v_thread1Thread1of1ForFork1_~i~0_36 1)) (< v_thread1Thread1of1ForFork1_~i~0_36 v_~N~0_77) (let ((.cse1 (select (select |v_#memory_int_213| v_~A~0.base_104) (+ v_~A~0.offset_104 (* v_thread1Thread1of1ForFork1_~i~0_36 4))))) (let ((.cse0 (< v_~min~0_74 .cse1))) (or (and (= v_~min~0_74 v_~min~0_73) .cse0 (= |v_thread1_#t~mem4_34| |v_thread1Thread1of1ForFork1_#t~mem4_22|)) (and (not .cse0) (= v_~min~0_73 |v_thread1_#t~mem4_34|) (= .cse1 |v_thread1_#t~mem4_34|)))))) InVars {~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_22|, ~min~0=v_~min~0_74, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_36, ~N~0=v_~N~0_77} OutVars{~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_13|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_17|, ~min~0=v_~min~0_73, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, ~N~0=v_~N~0_77, thread1Thread1of1ForFork1_#t~ite5=|v_thread1Thread1of1ForFork1_#t~ite5_13|} AuxVars[|v_thread1_#t~mem4_34|] AssignedVars[thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~post2, ~min~0, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#t~ite5] [2022-12-13 10:46:04,917 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] L50-->L84-4: Formula: (let ((.cse1 (select |v_#memory_int_478| v_~A~0.base_242)) (.cse2 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_151| 4) v_~A~0.offset_242 (- 4)))) (let ((.cse0 (select .cse1 .cse2))) (and (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_76| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (< |v_thread3Thread1of1ForFork0_~i~2#1_151| (+ v_~N~0_211 1)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_76| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_76|) (= v_thread1Thread1of1ForFork1_~i~0_134 0) (= v_~b1~0_119 1) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_76| 0)) (= (store |v_#memory_int_478| v_~A~0.base_242 (store .cse1 .cse2 (+ (- 1) .cse0))) |v_#memory_int_477|) (= |v_thread3Thread1of1ForFork0_~i~2#1_151| 1)))) InVars {~A~0.base=v_~A~0.base_242, ~A~0.offset=v_~A~0.offset_242, #memory_int=|v_#memory_int_478|, ~N~0=v_~N~0_211} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_76|, ~A~0.base=v_~A~0.base_242, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_76|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_76|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_134, ~N~0=v_~N~0_211, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_151|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_76|, ~A~0.offset=v_~A~0.offset_242, #memory_int=|v_#memory_int_477|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_80|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_76|, ~b1~0=v_~b1~0_119} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, ~b1~0, thread3Thread1of1ForFork0_#t~mem13#1] and [593] L74-4-->L74-4: Formula: (and (= v_thread2Thread1of1ForFork3_~i~1_31 (+ v_thread2Thread1of1ForFork3_~i~1_32 1)) (let ((.cse1 (select (select |v_#memory_int_177| v_~A~0.base_88) (+ v_~A~0.offset_88 (* v_thread2Thread1of1ForFork3_~i~1_32 4))))) (let ((.cse0 (< .cse1 v_~max~0_69))) (or (and .cse0 (= v_~max~0_69 v_~max~0_68) (= |v_thread2_#t~mem9_36| |v_thread2Thread1of1ForFork3_#t~mem9_22|)) (and (not .cse0) (= .cse1 |v_thread2_#t~mem9_36|) (= |v_thread2_#t~mem9_36| v_~max~0_68))))) (< v_thread2Thread1of1ForFork3_~i~1_32 v_~N~0_55)) InVars {~A~0.base=v_~A~0.base_88, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_32, ~A~0.offset=v_~A~0.offset_88, thread2Thread1of1ForFork3_#t~mem9=|v_thread2Thread1of1ForFork3_#t~mem9_22|, #memory_int=|v_#memory_int_177|, ~max~0=v_~max~0_69, ~N~0=v_~N~0_55} OutVars{~A~0.base=v_~A~0.base_88, thread2Thread1of1ForFork3_#t~ite10=|v_thread2Thread1of1ForFork3_#t~ite10_13|, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_31, ~A~0.offset=v_~A~0.offset_88, thread2Thread1of1ForFork3_#t~post7=|v_thread2Thread1of1ForFork3_#t~post7_19|, thread2Thread1of1ForFork3_#t~mem8=|v_thread2Thread1of1ForFork3_#t~mem8_13|, #memory_int=|v_#memory_int_177|, ~max~0=v_~max~0_68, ~N~0=v_~N~0_55} AuxVars[|v_thread2_#t~mem9_36|] AssignedVars[thread2Thread1of1ForFork3_#t~ite10, thread2Thread1of1ForFork3_~i~1, thread2Thread1of1ForFork3_#t~post7, thread2Thread1of1ForFork3_#t~mem9, thread2Thread1of1ForFork3_#t~mem8, ~max~0] [2022-12-13 10:46:05,037 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] L50-->L84-4: Formula: (let ((.cse1 (select |v_#memory_int_478| v_~A~0.base_242)) (.cse2 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_151| 4) v_~A~0.offset_242 (- 4)))) (let ((.cse0 (select .cse1 .cse2))) (and (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_76| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (< |v_thread3Thread1of1ForFork0_~i~2#1_151| (+ v_~N~0_211 1)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_76| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_76|) (= v_thread1Thread1of1ForFork1_~i~0_134 0) (= v_~b1~0_119 1) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_76| 0)) (= (store |v_#memory_int_478| v_~A~0.base_242 (store .cse1 .cse2 (+ (- 1) .cse0))) |v_#memory_int_477|) (= |v_thread3Thread1of1ForFork0_~i~2#1_151| 1)))) InVars {~A~0.base=v_~A~0.base_242, ~A~0.offset=v_~A~0.offset_242, #memory_int=|v_#memory_int_478|, ~N~0=v_~N~0_211} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_76|, ~A~0.base=v_~A~0.base_242, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_76|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_76|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_134, ~N~0=v_~N~0_211, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_151|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_76|, ~A~0.offset=v_~A~0.offset_242, #memory_int=|v_#memory_int_477|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_80|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_76|, ~b1~0=v_~b1~0_119} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, ~b1~0, thread3Thread1of1ForFork0_#t~mem13#1] and [620] L56-4-->L56-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_35 (+ v_thread1Thread1of1ForFork1_~i~0_36 1)) (< v_thread1Thread1of1ForFork1_~i~0_36 v_~N~0_77) (let ((.cse1 (select (select |v_#memory_int_213| v_~A~0.base_104) (+ v_~A~0.offset_104 (* v_thread1Thread1of1ForFork1_~i~0_36 4))))) (let ((.cse0 (< v_~min~0_74 .cse1))) (or (and (= v_~min~0_74 v_~min~0_73) .cse0 (= |v_thread1_#t~mem4_34| |v_thread1Thread1of1ForFork1_#t~mem4_22|)) (and (not .cse0) (= v_~min~0_73 |v_thread1_#t~mem4_34|) (= .cse1 |v_thread1_#t~mem4_34|)))))) InVars {~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_22|, ~min~0=v_~min~0_74, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_36, ~N~0=v_~N~0_77} OutVars{~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_13|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_17|, ~min~0=v_~min~0_73, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, ~N~0=v_~N~0_77, thread1Thread1of1ForFork1_#t~ite5=|v_thread1Thread1of1ForFork1_#t~ite5_13|} AuxVars[|v_thread1_#t~mem4_34|] AssignedVars[thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~post2, ~min~0, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#t~ite5] [2022-12-13 10:46:05,224 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [632] $Ultimate##0-->L84-4: Formula: (let ((.cse1 (select |v_#memory_int_258| v_~A~0.base_127)) (.cse2 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_41| 4) v_~A~0.offset_127 (- 4)))) (let ((.cse0 (select .cse1 .cse2))) (and (< |v_thread3Thread1of1ForFork0_~i~2#1_41| (+ 1 v_~N~0_99)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|) (= (store |v_#memory_int_258| v_~A~0.base_127 (store .cse1 .cse2 (+ (- 1) .cse0))) |v_#memory_int_257|) (= |v_thread3Thread1of1ForFork0_~i~2#1_41| 1)))) InVars {~A~0.base=v_~A~0.base_127, ~A~0.offset=v_~A~0.offset_127, #memory_int=|v_#memory_int_258|, ~N~0=v_~N~0_99} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_19|, ~A~0.base=v_~A~0.base_127, ~A~0.offset=v_~A~0.offset_127, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|, #memory_int=|v_#memory_int_257|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_23|, ~N~0=v_~N~0_99, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_41|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_19|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_19|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] and [593] L74-4-->L74-4: Formula: (and (= v_thread2Thread1of1ForFork3_~i~1_31 (+ v_thread2Thread1of1ForFork3_~i~1_32 1)) (let ((.cse1 (select (select |v_#memory_int_177| v_~A~0.base_88) (+ v_~A~0.offset_88 (* v_thread2Thread1of1ForFork3_~i~1_32 4))))) (let ((.cse0 (< .cse1 v_~max~0_69))) (or (and .cse0 (= v_~max~0_69 v_~max~0_68) (= |v_thread2_#t~mem9_36| |v_thread2Thread1of1ForFork3_#t~mem9_22|)) (and (not .cse0) (= .cse1 |v_thread2_#t~mem9_36|) (= |v_thread2_#t~mem9_36| v_~max~0_68))))) (< v_thread2Thread1of1ForFork3_~i~1_32 v_~N~0_55)) InVars {~A~0.base=v_~A~0.base_88, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_32, ~A~0.offset=v_~A~0.offset_88, thread2Thread1of1ForFork3_#t~mem9=|v_thread2Thread1of1ForFork3_#t~mem9_22|, #memory_int=|v_#memory_int_177|, ~max~0=v_~max~0_69, ~N~0=v_~N~0_55} OutVars{~A~0.base=v_~A~0.base_88, thread2Thread1of1ForFork3_#t~ite10=|v_thread2Thread1of1ForFork3_#t~ite10_13|, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_31, ~A~0.offset=v_~A~0.offset_88, thread2Thread1of1ForFork3_#t~post7=|v_thread2Thread1of1ForFork3_#t~post7_19|, thread2Thread1of1ForFork3_#t~mem8=|v_thread2Thread1of1ForFork3_#t~mem8_13|, #memory_int=|v_#memory_int_177|, ~max~0=v_~max~0_68, ~N~0=v_~N~0_55} AuxVars[|v_thread2_#t~mem9_36|] AssignedVars[thread2Thread1of1ForFork3_#t~ite10, thread2Thread1of1ForFork3_~i~1, thread2Thread1of1ForFork3_#t~post7, thread2Thread1of1ForFork3_#t~mem9, thread2Thread1of1ForFork3_#t~mem8, ~max~0] [2022-12-13 10:46:05,346 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [532] L84-4-->L84-4: Formula: (let ((.cse0 (select |v_#memory_int_126| v_~A~0.base_66)) (.cse1 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_34| 4) v_~A~0.offset_66))) (let ((.cse2 (select .cse0 .cse1))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_#memory_int_125| (store |v_#memory_int_126| v_~A~0.base_66 (store .cse0 .cse1 (+ .cse2 (- 1))))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| (ite (< 0 (+ .cse2 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_33| (+ |v_thread3Thread1of1ForFork0_~i~2#1_34| 1)) (< |v_thread3Thread1of1ForFork0_~i~2#1_34| v_~N~0_29) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|)))) InVars {~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_34|} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_17|, ~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, #memory_int=|v_#memory_int_125|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_19|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_33|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_17|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] and [593] L74-4-->L74-4: Formula: (and (= v_thread2Thread1of1ForFork3_~i~1_31 (+ v_thread2Thread1of1ForFork3_~i~1_32 1)) (let ((.cse1 (select (select |v_#memory_int_177| v_~A~0.base_88) (+ v_~A~0.offset_88 (* v_thread2Thread1of1ForFork3_~i~1_32 4))))) (let ((.cse0 (< .cse1 v_~max~0_69))) (or (and .cse0 (= v_~max~0_69 v_~max~0_68) (= |v_thread2_#t~mem9_36| |v_thread2Thread1of1ForFork3_#t~mem9_22|)) (and (not .cse0) (= .cse1 |v_thread2_#t~mem9_36|) (= |v_thread2_#t~mem9_36| v_~max~0_68))))) (< v_thread2Thread1of1ForFork3_~i~1_32 v_~N~0_55)) InVars {~A~0.base=v_~A~0.base_88, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_32, ~A~0.offset=v_~A~0.offset_88, thread2Thread1of1ForFork3_#t~mem9=|v_thread2Thread1of1ForFork3_#t~mem9_22|, #memory_int=|v_#memory_int_177|, ~max~0=v_~max~0_69, ~N~0=v_~N~0_55} OutVars{~A~0.base=v_~A~0.base_88, thread2Thread1of1ForFork3_#t~ite10=|v_thread2Thread1of1ForFork3_#t~ite10_13|, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_31, ~A~0.offset=v_~A~0.offset_88, thread2Thread1of1ForFork3_#t~post7=|v_thread2Thread1of1ForFork3_#t~post7_19|, thread2Thread1of1ForFork3_#t~mem8=|v_thread2Thread1of1ForFork3_#t~mem8_13|, #memory_int=|v_#memory_int_177|, ~max~0=v_~max~0_68, ~N~0=v_~N~0_55} AuxVars[|v_thread2_#t~mem9_36|] AssignedVars[thread2Thread1of1ForFork3_#t~ite10, thread2Thread1of1ForFork3_~i~1, thread2Thread1of1ForFork3_#t~post7, thread2Thread1of1ForFork3_#t~mem9, thread2Thread1of1ForFork3_#t~mem8, ~max~0] [2022-12-13 10:46:05,530 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [645] L68-->L84-4: Formula: (let ((.cse1 (select |v_#memory_int_462| v_~A~0.base_232)) (.cse2 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_141| 4) v_~A~0.offset_232 (- 4)))) (let ((.cse0 (select .cse1 .cse2))) (and (= v_~b2~0_115 1) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (< |v_thread3Thread1of1ForFork0_~i~2#1_141| (+ v_~N~0_201 1)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_70| 0)) (= (store |v_#memory_int_462| v_~A~0.base_232 (store .cse1 .cse2 (+ (- 1) .cse0))) |v_#memory_int_461|) (= v_thread2Thread1of1ForFork3_~i~1_134 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_70|) (= |v_thread3Thread1of1ForFork0_~i~2#1_141| 1)))) InVars {~A~0.base=v_~A~0.base_232, ~A~0.offset=v_~A~0.offset_232, #memory_int=|v_#memory_int_462|, ~N~0=v_~N~0_201} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_70|, ~A~0.base=v_~A~0.base_232, ~b2~0=v_~b2~0_115, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_70|, ~N~0=v_~N~0_201, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_141|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_70|, ~A~0.offset=v_~A~0.offset_232, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_134, #memory_int=|v_#memory_int_461|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_74|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_70|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, ~b2~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_~i~1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] and [620] L56-4-->L56-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_35 (+ v_thread1Thread1of1ForFork1_~i~0_36 1)) (< v_thread1Thread1of1ForFork1_~i~0_36 v_~N~0_77) (let ((.cse1 (select (select |v_#memory_int_213| v_~A~0.base_104) (+ v_~A~0.offset_104 (* v_thread1Thread1of1ForFork1_~i~0_36 4))))) (let ((.cse0 (< v_~min~0_74 .cse1))) (or (and (= v_~min~0_74 v_~min~0_73) .cse0 (= |v_thread1_#t~mem4_34| |v_thread1Thread1of1ForFork1_#t~mem4_22|)) (and (not .cse0) (= v_~min~0_73 |v_thread1_#t~mem4_34|) (= .cse1 |v_thread1_#t~mem4_34|)))))) InVars {~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_22|, ~min~0=v_~min~0_74, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_36, ~N~0=v_~N~0_77} OutVars{~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_13|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_17|, ~min~0=v_~min~0_73, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, ~N~0=v_~N~0_77, thread1Thread1of1ForFork1_#t~ite5=|v_thread1Thread1of1ForFork1_#t~ite5_13|} AuxVars[|v_thread1_#t~mem4_34|] AssignedVars[thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~post2, ~min~0, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#t~ite5] [2022-12-13 10:46:05,651 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [645] L68-->L84-4: Formula: (let ((.cse1 (select |v_#memory_int_462| v_~A~0.base_232)) (.cse2 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_141| 4) v_~A~0.offset_232 (- 4)))) (let ((.cse0 (select .cse1 .cse2))) (and (= v_~b2~0_115 1) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (< |v_thread3Thread1of1ForFork0_~i~2#1_141| (+ v_~N~0_201 1)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_70| 0)) (= (store |v_#memory_int_462| v_~A~0.base_232 (store .cse1 .cse2 (+ (- 1) .cse0))) |v_#memory_int_461|) (= v_thread2Thread1of1ForFork3_~i~1_134 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_70|) (= |v_thread3Thread1of1ForFork0_~i~2#1_141| 1)))) InVars {~A~0.base=v_~A~0.base_232, ~A~0.offset=v_~A~0.offset_232, #memory_int=|v_#memory_int_462|, ~N~0=v_~N~0_201} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_70|, ~A~0.base=v_~A~0.base_232, ~b2~0=v_~b2~0_115, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_70|, ~N~0=v_~N~0_201, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_141|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_70|, ~A~0.offset=v_~A~0.offset_232, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_134, #memory_int=|v_#memory_int_461|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_74|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_70|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, ~b2~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_~i~1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] and [593] L74-4-->L74-4: Formula: (and (= v_thread2Thread1of1ForFork3_~i~1_31 (+ v_thread2Thread1of1ForFork3_~i~1_32 1)) (let ((.cse1 (select (select |v_#memory_int_177| v_~A~0.base_88) (+ v_~A~0.offset_88 (* v_thread2Thread1of1ForFork3_~i~1_32 4))))) (let ((.cse0 (< .cse1 v_~max~0_69))) (or (and .cse0 (= v_~max~0_69 v_~max~0_68) (= |v_thread2_#t~mem9_36| |v_thread2Thread1of1ForFork3_#t~mem9_22|)) (and (not .cse0) (= .cse1 |v_thread2_#t~mem9_36|) (= |v_thread2_#t~mem9_36| v_~max~0_68))))) (< v_thread2Thread1of1ForFork3_~i~1_32 v_~N~0_55)) InVars {~A~0.base=v_~A~0.base_88, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_32, ~A~0.offset=v_~A~0.offset_88, thread2Thread1of1ForFork3_#t~mem9=|v_thread2Thread1of1ForFork3_#t~mem9_22|, #memory_int=|v_#memory_int_177|, ~max~0=v_~max~0_69, ~N~0=v_~N~0_55} OutVars{~A~0.base=v_~A~0.base_88, thread2Thread1of1ForFork3_#t~ite10=|v_thread2Thread1of1ForFork3_#t~ite10_13|, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_31, ~A~0.offset=v_~A~0.offset_88, thread2Thread1of1ForFork3_#t~post7=|v_thread2Thread1of1ForFork3_#t~post7_19|, thread2Thread1of1ForFork3_#t~mem8=|v_thread2Thread1of1ForFork3_#t~mem8_13|, #memory_int=|v_#memory_int_177|, ~max~0=v_~max~0_68, ~N~0=v_~N~0_55} AuxVars[|v_thread2_#t~mem9_36|] AssignedVars[thread2Thread1of1ForFork3_#t~ite10, thread2Thread1of1ForFork3_~i~1, thread2Thread1of1ForFork3_#t~post7, thread2Thread1of1ForFork3_#t~mem9, thread2Thread1of1ForFork3_#t~mem8, ~max~0] [2022-12-13 10:46:05,768 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [645] L68-->L84-4: Formula: (let ((.cse1 (select |v_#memory_int_462| v_~A~0.base_232)) (.cse2 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_141| 4) v_~A~0.offset_232 (- 4)))) (let ((.cse0 (select .cse1 .cse2))) (and (= v_~b2~0_115 1) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (< |v_thread3Thread1of1ForFork0_~i~2#1_141| (+ v_~N~0_201 1)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_70| 0)) (= (store |v_#memory_int_462| v_~A~0.base_232 (store .cse1 .cse2 (+ (- 1) .cse0))) |v_#memory_int_461|) (= v_thread2Thread1of1ForFork3_~i~1_134 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_70|) (= |v_thread3Thread1of1ForFork0_~i~2#1_141| 1)))) InVars {~A~0.base=v_~A~0.base_232, ~A~0.offset=v_~A~0.offset_232, #memory_int=|v_#memory_int_462|, ~N~0=v_~N~0_201} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_70|, ~A~0.base=v_~A~0.base_232, ~b2~0=v_~b2~0_115, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_70|, ~N~0=v_~N~0_201, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_141|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_70|, ~A~0.offset=v_~A~0.offset_232, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_134, #memory_int=|v_#memory_int_461|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_74|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_70|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, ~b2~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_~i~1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] and [638] L56-4-->L56-4: Formula: (let ((.cse2 (select |v_#memory_int_437| v_~A~0.base_216)) (.cse3 (* v_thread1Thread1of1ForFork1_~i~0_112 4))) (and (< (+ v_thread1Thread1of1ForFork1_~i~0_112 1) v_~N~0_187) (let ((.cse1 (select .cse2 (+ .cse3 v_~A~0.offset_216 4)))) (let ((.cse0 (< v_~min~0_188 .cse1))) (or (and (not .cse0) (= |v_thread1_#t~mem4_63| v_~min~0_187) (= |v_thread1_#t~mem4_63| .cse1)) (and (= |v_thread1_#t~mem4_63| |v_thread1Thread1of1ForFork1_#t~mem4_68|) .cse0 (= v_~min~0_188 v_~min~0_187))))) (let ((.cse5 (select .cse2 (+ .cse3 v_~A~0.offset_216)))) (let ((.cse4 (< v_~min~0_189 .cse5))) (or (and (= |v_thread1_#t~mem4_64| |v_thread1Thread1of1ForFork1_#t~mem4_69|) .cse4 (= v_~min~0_189 v_~min~0_188)) (and (= |v_thread1_#t~mem4_64| v_~min~0_188) (= |v_thread1_#t~mem4_64| .cse5) (not .cse4))))) (= (+ 2 v_thread1Thread1of1ForFork1_~i~0_112) v_thread1Thread1of1ForFork1_~i~0_110))) InVars {~A~0.base=v_~A~0.base_216, ~A~0.offset=v_~A~0.offset_216, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_69|, ~min~0=v_~min~0_189, #memory_int=|v_#memory_int_437|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_112, ~N~0=v_~N~0_187} OutVars{~A~0.base=v_~A~0.base_216, ~A~0.offset=v_~A~0.offset_216, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_37|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_41|, ~min~0=v_~min~0_187, #memory_int=|v_#memory_int_437|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_110, ~N~0=v_~N~0_187, thread1Thread1of1ForFork1_#t~ite5=|v_thread1Thread1of1ForFork1_#t~ite5_37|} AuxVars[|v_thread1Thread1of1ForFork1_#t~mem4_68|, |v_thread1_#t~mem4_63|, v_~min~0_188, |v_thread1_#t~mem4_64|] AssignedVars[thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~post2, ~min~0, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#t~ite5] [2022-12-13 10:46:05,920 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [645] L68-->L84-4: Formula: (let ((.cse1 (select |v_#memory_int_462| v_~A~0.base_232)) (.cse2 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_141| 4) v_~A~0.offset_232 (- 4)))) (let ((.cse0 (select .cse1 .cse2))) (and (= v_~b2~0_115 1) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (< |v_thread3Thread1of1ForFork0_~i~2#1_141| (+ v_~N~0_201 1)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_70| 0)) (= (store |v_#memory_int_462| v_~A~0.base_232 (store .cse1 .cse2 (+ (- 1) .cse0))) |v_#memory_int_461|) (= v_thread2Thread1of1ForFork3_~i~1_134 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_70|) (= |v_thread3Thread1of1ForFork0_~i~2#1_141| 1)))) InVars {~A~0.base=v_~A~0.base_232, ~A~0.offset=v_~A~0.offset_232, #memory_int=|v_#memory_int_462|, ~N~0=v_~N~0_201} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_70|, ~A~0.base=v_~A~0.base_232, ~b2~0=v_~b2~0_115, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_70|, ~N~0=v_~N~0_201, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_141|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_70|, ~A~0.offset=v_~A~0.offset_232, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_134, #memory_int=|v_#memory_int_461|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_74|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_70|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, ~b2~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_~i~1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] and [639] L56-4-->L74-4: Formula: (let ((.cse2 (select |v_#memory_int_439| v_~A~0.base_218))) (and (= (+ v_thread1Thread1of1ForFork1_~i~0_117 1) v_thread1Thread1of1ForFork1_~i~0_116) (let ((.cse1 (select .cse2 (+ v_~A~0.offset_218 (* v_thread2Thread1of1ForFork3_~i~1_127 4))))) (let ((.cse0 (< .cse1 v_~max~0_196))) (or (and (= v_~max~0_195 v_~max~0_196) .cse0 (= |v_thread2_#t~mem9_64| |v_thread2Thread1of1ForFork3_#t~mem9_72|)) (and (= v_~max~0_195 |v_thread2_#t~mem9_64|) (= .cse1 |v_thread2_#t~mem9_64|) (not .cse0))))) (< v_thread1Thread1of1ForFork1_~i~0_117 v_~N~0_189) (< v_thread2Thread1of1ForFork3_~i~1_127 v_~N~0_189) (= v_thread2Thread1of1ForFork3_~i~1_126 (+ v_thread2Thread1of1ForFork3_~i~1_127 1)) (let ((.cse4 (select .cse2 (+ (* v_thread1Thread1of1ForFork1_~i~0_117 4) v_~A~0.offset_218)))) (let ((.cse3 (< v_~min~0_194 .cse4))) (or (and .cse3 (= |v_thread1_#t~mem4_67| |v_thread1Thread1of1ForFork1_#t~mem4_74|) (= v_~min~0_194 v_~min~0_193)) (and (= .cse4 |v_thread1_#t~mem4_67|) (not .cse3) (= |v_thread1_#t~mem4_67| v_~min~0_193))))))) InVars {~A~0.base=v_~A~0.base_218, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_127, ~A~0.offset=v_~A~0.offset_218, thread2Thread1of1ForFork3_#t~mem9=|v_thread2Thread1of1ForFork3_#t~mem9_72|, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_74|, ~min~0=v_~min~0_194, #memory_int=|v_#memory_int_439|, ~max~0=v_~max~0_196, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_117, ~N~0=v_~N~0_189} OutVars{~A~0.base=v_~A~0.base_218, thread2Thread1of1ForFork3_#t~ite10=|v_thread2Thread1of1ForFork3_#t~ite10_39|, ~max~0=v_~max~0_195, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_116, ~N~0=v_~N~0_189, thread1Thread1of1ForFork1_#t~ite5=|v_thread1Thread1of1ForFork1_#t~ite5_41|, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_126, ~A~0.offset=v_~A~0.offset_218, thread2Thread1of1ForFork3_#t~post7=|v_thread2Thread1of1ForFork3_#t~post7_47|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_41|, thread2Thread1of1ForFork3_#t~mem8=|v_thread2Thread1of1ForFork3_#t~mem8_39|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_45|, ~min~0=v_~min~0_193, #memory_int=|v_#memory_int_439|} AuxVars[|v_thread2_#t~mem9_64|, |v_thread1_#t~mem4_67|] AssignedVars[thread2Thread1of1ForFork3_#t~ite10, thread2Thread1of1ForFork3_~i~1, thread2Thread1of1ForFork3_#t~post7, thread2Thread1of1ForFork3_#t~mem9, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~mem4, thread2Thread1of1ForFork3_#t~mem8, thread1Thread1of1ForFork1_#t~post2, ~min~0, ~max~0, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#t~ite5] [2022-12-13 10:46:06,259 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [532] L84-4-->L84-4: Formula: (let ((.cse0 (select |v_#memory_int_126| v_~A~0.base_66)) (.cse1 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_34| 4) v_~A~0.offset_66))) (let ((.cse2 (select .cse0 .cse1))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_#memory_int_125| (store |v_#memory_int_126| v_~A~0.base_66 (store .cse0 .cse1 (+ .cse2 (- 1))))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| (ite (< 0 (+ .cse2 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_33| (+ |v_thread3Thread1of1ForFork0_~i~2#1_34| 1)) (< |v_thread3Thread1of1ForFork0_~i~2#1_34| v_~N~0_29) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|)))) InVars {~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_34|} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_17|, ~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, #memory_int=|v_#memory_int_125|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_19|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_33|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_17|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-13 10:46:06,302 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [583] L50-->L56-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_31 0) (= v_~b1~0_26 1)) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, ~b1~0=v_~b1~0_26} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, ~b1~0] [2022-12-13 10:46:06,317 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [649] L50-->L84-4: Formula: (let ((.cse0 (select |v_#memory_int_474| v_~A~0.base_240)) (.cse1 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_148| 4) v_~A~0.offset_240))) (let ((.cse2 (select .cse0 .cse1))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_74| 0)) (= |v_#memory_int_473| (store |v_#memory_int_474| v_~A~0.base_240 (store .cse0 .cse1 (+ (- 1) .cse2)))) (< |v_thread3Thread1of1ForFork0_~i~2#1_148| v_~N~0_209) (= v_thread1Thread1of1ForFork1_~i~0_132 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_74|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74| (ite (< 0 (+ .cse2 2147483648)) 1 0)) (= v_~b1~0_117 1) (= (+ |v_thread3Thread1of1ForFork0_~i~2#1_148| 1) |v_thread3Thread1of1ForFork0_~i~2#1_147|)))) InVars {~A~0.base=v_~A~0.base_240, ~A~0.offset=v_~A~0.offset_240, #memory_int=|v_#memory_int_474|, ~N~0=v_~N~0_209, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_148|} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_74|, ~A~0.base=v_~A~0.base_240, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_74|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_132, ~N~0=v_~N~0_209, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_147|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_74|, ~A~0.offset=v_~A~0.offset_240, #memory_int=|v_#memory_int_473|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_78|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_74|, ~b1~0=v_~b1~0_117} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, ~b1~0, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-13 10:46:06,370 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [650] L50-->L84-4: Formula: (let ((.cse1 (select |v_#memory_int_478| v_~A~0.base_242)) (.cse2 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_151| 4) v_~A~0.offset_242 (- 4)))) (let ((.cse0 (select .cse1 .cse2))) (and (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_76| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (< |v_thread3Thread1of1ForFork0_~i~2#1_151| (+ v_~N~0_211 1)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_76| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_76|) (= v_thread1Thread1of1ForFork1_~i~0_134 0) (= v_~b1~0_119 1) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_76| 0)) (= (store |v_#memory_int_478| v_~A~0.base_242 (store .cse1 .cse2 (+ (- 1) .cse0))) |v_#memory_int_477|) (= |v_thread3Thread1of1ForFork0_~i~2#1_151| 1)))) InVars {~A~0.base=v_~A~0.base_242, ~A~0.offset=v_~A~0.offset_242, #memory_int=|v_#memory_int_478|, ~N~0=v_~N~0_211} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_76|, ~A~0.base=v_~A~0.base_242, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_76|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_76|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_134, ~N~0=v_~N~0_211, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_151|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_76|, ~A~0.offset=v_~A~0.offset_242, #memory_int=|v_#memory_int_477|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_80|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_76|, ~b1~0=v_~b1~0_119} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, ~b1~0, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-13 10:46:06,422 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [651] L50-->L56-4: Formula: (and (= v_~b1~0_121 1) (< v_thread1Thread1of1ForFork1_~i~0_136 (+ v_~N~0_213 1)) (let ((.cse1 (select (select |v_#memory_int_481| v_~A~0.base_244) (+ v_~A~0.offset_244 (* v_thread1Thread1of1ForFork1_~i~0_136 4) (- 4))))) (let ((.cse0 (< v_~min~0_210 .cse1))) (or (and (= |v_thread1_#t~mem4_76| |v_thread1Thread1of1ForFork1_#t~mem4_86|) (= v_~min~0_210 v_~min~0_209) .cse0) (and (not .cse0) (= .cse1 |v_thread1_#t~mem4_76|) (= |v_thread1_#t~mem4_76| v_~min~0_209))))) (= v_thread1Thread1of1ForFork1_~i~0_136 1)) InVars {~A~0.base=v_~A~0.base_244, ~A~0.offset=v_~A~0.offset_244, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_86|, ~min~0=v_~min~0_210, #memory_int=|v_#memory_int_481|, ~N~0=v_~N~0_213} OutVars{~A~0.base=v_~A~0.base_244, ~A~0.offset=v_~A~0.offset_244, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_47|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_51|, ~min~0=v_~min~0_209, #memory_int=|v_#memory_int_481|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_136, ~N~0=v_~N~0_213, ~b1~0=v_~b1~0_121, thread1Thread1of1ForFork1_#t~ite5=|v_thread1Thread1of1ForFork1_#t~ite5_47|} AuxVars[|v_thread1_#t~mem4_76|] AssignedVars[thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~post2, ~min~0, thread1Thread1of1ForFork1_~i~0, ~b1~0, thread1Thread1of1ForFork1_#t~ite5] [2022-12-13 10:46:06,488 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [652] L50-->L74-4: Formula: (and (= v_~b1~0_123 1) (= v_thread1Thread1of1ForFork1_~i~0_140 0) (let ((.cse0 (select (select |v_#memory_int_483| v_~A~0.base_246) (+ v_~A~0.offset_246 (* v_thread2Thread1of1ForFork3_~i~1_145 4))))) (let ((.cse1 (< .cse0 v_~max~0_212))) (or (and (= v_~max~0_211 |v_thread2_#t~mem9_73|) (= .cse0 |v_thread2_#t~mem9_73|) (not .cse1)) (and .cse1 (= v_~max~0_212 v_~max~0_211) (= |v_thread2_#t~mem9_73| |v_thread2Thread1of1ForFork3_#t~mem9_84|))))) (= v_thread2Thread1of1ForFork3_~i~1_144 (+ v_thread2Thread1of1ForFork3_~i~1_145 1)) (< v_thread2Thread1of1ForFork3_~i~1_145 v_~N~0_215)) InVars {~A~0.base=v_~A~0.base_246, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_145, ~A~0.offset=v_~A~0.offset_246, thread2Thread1of1ForFork3_#t~mem9=|v_thread2Thread1of1ForFork3_#t~mem9_84|, #memory_int=|v_#memory_int_483|, ~max~0=v_~max~0_212, ~N~0=v_~N~0_215} OutVars{~A~0.base=v_~A~0.base_246, thread2Thread1of1ForFork3_#t~ite10=|v_thread2Thread1of1ForFork3_#t~ite10_45|, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_144, ~A~0.offset=v_~A~0.offset_246, thread2Thread1of1ForFork3_#t~post7=|v_thread2Thread1of1ForFork3_#t~post7_53|, thread2Thread1of1ForFork3_#t~mem8=|v_thread2Thread1of1ForFork3_#t~mem8_45|, #memory_int=|v_#memory_int_483|, ~max~0=v_~max~0_211, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_140, ~N~0=v_~N~0_215, ~b1~0=v_~b1~0_123} AuxVars[|v_thread2_#t~mem9_73|] AssignedVars[thread2Thread1of1ForFork3_#t~ite10, thread2Thread1of1ForFork3_~i~1, thread2Thread1of1ForFork3_#t~post7, thread2Thread1of1ForFork3_#t~mem9, thread2Thread1of1ForFork3_#t~mem8, ~max~0, thread1Thread1of1ForFork1_~i~0, ~b1~0] [2022-12-13 10:46:06,558 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [632] $Ultimate##0-->L84-4: Formula: (let ((.cse1 (select |v_#memory_int_258| v_~A~0.base_127)) (.cse2 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_41| 4) v_~A~0.offset_127 (- 4)))) (let ((.cse0 (select .cse1 .cse2))) (and (< |v_thread3Thread1of1ForFork0_~i~2#1_41| (+ 1 v_~N~0_99)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|) (= (store |v_#memory_int_258| v_~A~0.base_127 (store .cse1 .cse2 (+ (- 1) .cse0))) |v_#memory_int_257|) (= |v_thread3Thread1of1ForFork0_~i~2#1_41| 1)))) InVars {~A~0.base=v_~A~0.base_127, ~A~0.offset=v_~A~0.offset_127, #memory_int=|v_#memory_int_258|, ~N~0=v_~N~0_99} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_19|, ~A~0.base=v_~A~0.base_127, ~A~0.offset=v_~A~0.offset_127, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|, #memory_int=|v_#memory_int_257|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_23|, ~N~0=v_~N~0_99, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_41|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_19|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_19|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-13 10:46:06,600 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [654] L50-->L74-4: Formula: (let ((.cse0 (select |v_#memory_int_554| v_~A~0.base_288)) (.cse1 (+ v_~A~0.offset_288 (- 4) (* |v_thread3Thread1of1ForFork0_~i~2#1_177| 4)))) (let ((.cse2 (select .cse0 .cse1))) (and (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|) (< |v_thread3Thread1of1ForFork0_~i~2#1_177| (+ v_~N~0_251 1)) (= (+ v_thread2Thread1of1ForFork3_~i~1_177 1) v_thread2Thread1of1ForFork3_~i~1_176) (= (store |v_#memory_int_554| v_~A~0.base_288 (store .cse0 .cse1 (+ (- 1) .cse2))) |v_#memory_int_553|) (= v_~b1~0_151 1) (= v_thread1Thread1of1ForFork1_~i~0_188 0) (< v_thread2Thread1of1ForFork3_~i~1_177 v_~N~0_251) (= |v_thread3Thread1of1ForFork0_~i~2#1_177| 1) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90| (ite (< 0 (+ .cse2 2147483648)) 1 0)) (let ((.cse4 (select (select |v_#memory_int_553| v_~A~0.base_288) (+ v_~A~0.offset_288 (* v_thread2Thread1of1ForFork3_~i~1_177 4))))) (let ((.cse3 (< .cse4 v_~max~0_244))) (or (and .cse3 (= v_~max~0_244 v_~max~0_243) (= |v_thread2_#t~mem9_78| |v_thread2Thread1of1ForFork3_#t~mem9_94|)) (and (not .cse3) (= v_~max~0_243 |v_thread2_#t~mem9_78|) (= .cse4 |v_thread2_#t~mem9_78|))))) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0))))) InVars {~A~0.base=v_~A~0.base_288, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_177, ~A~0.offset=v_~A~0.offset_288, thread2Thread1of1ForFork3_#t~mem9=|v_thread2Thread1of1ForFork3_#t~mem9_94|, #memory_int=|v_#memory_int_554|, ~max~0=v_~max~0_244, ~N~0=v_~N~0_251} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_90|, ~A~0.base=v_~A~0.base_288, thread2Thread1of1ForFork3_#t~ite10=|v_thread2Thread1of1ForFork3_#t~ite10_50|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, ~max~0=v_~max~0_243, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_188, ~N~0=v_~N~0_251, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_177|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_90|, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_176, ~A~0.offset=v_~A~0.offset_288, thread2Thread1of1ForFork3_#t~post7=|v_thread2Thread1of1ForFork3_#t~post7_58|, thread2Thread1of1ForFork3_#t~mem8=|v_thread2Thread1of1ForFork3_#t~mem8_50|, #memory_int=|v_#memory_int_553|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_94|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_90|, ~b1~0=v_~b1~0_151} AuxVars[|v_thread2_#t~mem9_78|] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread2Thread1of1ForFork3_#t~ite10, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~max~0, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem13#1, thread2Thread1of1ForFork3_~i~1, thread2Thread1of1ForFork3_#t~post7, thread2Thread1of1ForFork3_#t~mem9, thread2Thread1of1ForFork3_#t~mem8, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_#t~mem12#1, ~b1~0] [2022-12-13 10:46:06,771 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [655] L50-->L56-4: Formula: (let ((.cse0 (select |v_#memory_int_558| v_~A~0.base_290)) (.cse1 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_179| 4) v_~A~0.offset_290 (- 4)))) (let ((.cse2 (select .cse0 .cse1))) (and (= (store |v_#memory_int_558| v_~A~0.base_290 (store .cse0 .cse1 (+ (- 1) .cse2))) |v_#memory_int_557|) (= v_thread1Thread1of1ForFork1_~i~0_190 1) (= v_~b1~0_153 1) (= |v_thread3Thread1of1ForFork0_~i~2#1_179| 1) (< |v_thread3Thread1of1ForFork0_~i~2#1_179| (+ v_~N~0_253 1)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_92|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92| (ite (< 0 (+ 2147483648 .cse2)) 1 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_92| 0)) (let ((.cse4 (select (select |v_#memory_int_557| v_~A~0.base_290) v_~A~0.offset_290))) (let ((.cse3 (< v_~min~0_260 .cse4))) (or (and (= v_~min~0_259 v_~min~0_260) (= |v_thread1Thread1of1ForFork1_#t~mem4_118| |v_thread1_#t~mem4_92|) .cse3) (and (= |v_thread1_#t~mem4_92| v_~min~0_259) (= .cse4 |v_thread1_#t~mem4_92|) (not .cse3)))))))) InVars {~A~0.base=v_~A~0.base_290, ~A~0.offset=v_~A~0.offset_290, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_118|, ~min~0=v_~min~0_260, #memory_int=|v_#memory_int_558|, ~N~0=v_~N~0_253} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_92|, ~A~0.base=v_~A~0.base_290, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_92|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_190, ~N~0=v_~N~0_253, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_179|, thread1Thread1of1ForFork1_#t~ite5=|v_thread1Thread1of1ForFork1_#t~ite5_63|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_92|, ~A~0.offset=v_~A~0.offset_290, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_63|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_67|, ~min~0=v_~min~0_259, #memory_int=|v_#memory_int_557|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_96|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_92|, ~b1~0=v_~b1~0_153} AuxVars[|v_thread1_#t~mem4_92|] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_~i~2#1, thread1Thread1of1ForFork1_#t~ite5, thread3Thread1of1ForFork0_#t~mem13#1, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~post2, ~min~0, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_#t~mem12#1, ~b1~0] [2022-12-13 10:46:06,892 INFO L241 LiptonReduction]: Total number of compositions: 13 [2022-12-13 10:46:06,893 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7000 [2022-12-13 10:46:06,893 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 341 transitions, 2293 flow [2022-12-13 10:46:06,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.175) internal successors, (87), 40 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:46:06,893 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:46:06,893 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:46:06,900 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-13 10:46:07,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:46:07,094 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:46:07,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:46:07,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1047609148, now seen corresponding path program 1 times [2022-12-13 10:46:07,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:46:07,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823130624] [2022-12-13 10:46:07,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:46:07,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:46:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:46:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 10:46:07,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:46:07,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823130624] [2022-12-13 10:46:07,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823130624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:46:07,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:46:07,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:46:07,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073418883] [2022-12-13 10:46:07,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:46:07,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:46:07,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:46:07,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:46:07,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:46:07,345 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-13 10:46:07,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 341 transitions, 2293 flow. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:46:07,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:46:07,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-13 10:46:07,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:46:11,713 INFO L130 PetriNetUnfolder]: 20312/28764 cut-off events. [2022-12-13 10:46:11,713 INFO L131 PetriNetUnfolder]: For 1898573/1898573 co-relation queries the response was YES. [2022-12-13 10:46:11,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139022 conditions, 28764 events. 20312/28764 cut-off events. For 1898573/1898573 co-relation queries the response was YES. Maximal size of possible extension queue 1072. Compared 170900 event pairs, 5573 based on Foata normal form. 30/26856 useless extension candidates. Maximal degree in co-relation 138900. Up to 19800 conditions per place. [2022-12-13 10:46:11,944 INFO L137 encePairwiseOnDemand]: 44/59 looper letters, 317 selfloop transitions, 12 changer transitions 413/742 dead transitions. [2022-12-13 10:46:11,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 742 transitions, 6309 flow [2022-12-13 10:46:11,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:46:11,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:46:11,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-12-13 10:46:11,946 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43728813559322033 [2022-12-13 10:46:11,946 INFO L175 Difference]: Start difference. First operand has 228 places, 341 transitions, 2293 flow. Second operand 5 states and 129 transitions. [2022-12-13 10:46:11,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 742 transitions, 6309 flow [2022-12-13 10:46:14,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 742 transitions, 5937 flow, removed 136 selfloop flow, removed 34 redundant places. [2022-12-13 10:46:14,610 INFO L231 Difference]: Finished difference. Result has 200 places, 298 transitions, 1796 flow [2022-12-13 10:46:14,610 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2072, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1796, PETRI_PLACES=200, PETRI_TRANSITIONS=298} [2022-12-13 10:46:14,611 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 160 predicate places. [2022-12-13 10:46:14,611 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:46:14,611 INFO L89 Accepts]: Start accepts. Operand has 200 places, 298 transitions, 1796 flow [2022-12-13 10:46:14,613 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:46:14,613 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:46:14,613 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 298 transitions, 1796 flow [2022-12-13 10:46:14,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 298 transitions, 1796 flow [2022-12-13 10:46:14,749 INFO L130 PetriNetUnfolder]: 526/1390 cut-off events. [2022-12-13 10:46:14,749 INFO L131 PetriNetUnfolder]: For 29885/30029 co-relation queries the response was YES. [2022-12-13 10:46:14,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3945 conditions, 1390 events. 526/1390 cut-off events. For 29885/30029 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10210 event pairs, 0 based on Foata normal form. 0/1311 useless extension candidates. Maximal degree in co-relation 3810. Up to 300 conditions per place. [2022-12-13 10:46:14,769 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 298 transitions, 1796 flow [2022-12-13 10:46:14,769 INFO L226 LiptonReduction]: Number of co-enabled transitions 3668 [2022-12-13 10:46:14,795 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [632] $Ultimate##0-->L84-4: Formula: (let ((.cse1 (select |v_#memory_int_258| v_~A~0.base_127)) (.cse2 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_41| 4) v_~A~0.offset_127 (- 4)))) (let ((.cse0 (select .cse1 .cse2))) (and (< |v_thread3Thread1of1ForFork0_~i~2#1_41| (+ 1 v_~N~0_99)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|) (= (store |v_#memory_int_258| v_~A~0.base_127 (store .cse1 .cse2 (+ (- 1) .cse0))) |v_#memory_int_257|) (= |v_thread3Thread1of1ForFork0_~i~2#1_41| 1)))) InVars {~A~0.base=v_~A~0.base_127, ~A~0.offset=v_~A~0.offset_127, #memory_int=|v_#memory_int_258|, ~N~0=v_~N~0_99} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_19|, ~A~0.base=v_~A~0.base_127, ~A~0.offset=v_~A~0.offset_127, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|, #memory_int=|v_#memory_int_257|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_23|, ~N~0=v_~N~0_99, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_41|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_19|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_19|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-13 10:46:14,841 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [583] L50-->L56-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_31 0) (= v_~b1~0_26 1)) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, ~b1~0=v_~b1~0_26} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, ~b1~0] [2022-12-13 10:46:14,921 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [532] L84-4-->L84-4: Formula: (let ((.cse0 (select |v_#memory_int_126| v_~A~0.base_66)) (.cse1 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_34| 4) v_~A~0.offset_66))) (let ((.cse2 (select .cse0 .cse1))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_#memory_int_125| (store |v_#memory_int_126| v_~A~0.base_66 (store .cse0 .cse1 (+ .cse2 (- 1))))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| (ite (< 0 (+ .cse2 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_33| (+ |v_thread3Thread1of1ForFork0_~i~2#1_34| 1)) (< |v_thread3Thread1of1ForFork0_~i~2#1_34| v_~N~0_29) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|)))) InVars {~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_34|} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_17|, ~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, #memory_int=|v_#memory_int_125|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_19|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_33|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_17|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-13 10:46:14,988 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [620] L56-4-->L56-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_35 (+ v_thread1Thread1of1ForFork1_~i~0_36 1)) (< v_thread1Thread1of1ForFork1_~i~0_36 v_~N~0_77) (let ((.cse1 (select (select |v_#memory_int_213| v_~A~0.base_104) (+ v_~A~0.offset_104 (* v_thread1Thread1of1ForFork1_~i~0_36 4))))) (let ((.cse0 (< v_~min~0_74 .cse1))) (or (and (= v_~min~0_74 v_~min~0_73) .cse0 (= |v_thread1_#t~mem4_34| |v_thread1Thread1of1ForFork1_#t~mem4_22|)) (and (not .cse0) (= v_~min~0_73 |v_thread1_#t~mem4_34|) (= .cse1 |v_thread1_#t~mem4_34|)))))) InVars {~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_22|, ~min~0=v_~min~0_74, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_36, ~N~0=v_~N~0_77} OutVars{~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_13|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_17|, ~min~0=v_~min~0_73, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, ~N~0=v_~N~0_77, thread1Thread1of1ForFork1_#t~ite5=|v_thread1Thread1of1ForFork1_#t~ite5_13|} AuxVars[|v_thread1_#t~mem4_34|] AssignedVars[thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~post2, ~min~0, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#t~ite5] [2022-12-13 10:46:15,127 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [532] L84-4-->L84-4: Formula: (let ((.cse0 (select |v_#memory_int_126| v_~A~0.base_66)) (.cse1 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_34| 4) v_~A~0.offset_66))) (let ((.cse2 (select .cse0 .cse1))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_#memory_int_125| (store |v_#memory_int_126| v_~A~0.base_66 (store .cse0 .cse1 (+ .cse2 (- 1))))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| (ite (< 0 (+ .cse2 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_33| (+ |v_thread3Thread1of1ForFork0_~i~2#1_34| 1)) (< |v_thread3Thread1of1ForFork0_~i~2#1_34| v_~N~0_29) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|)))) InVars {~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_34|} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_17|, ~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, #memory_int=|v_#memory_int_125|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_19|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_33|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_17|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-13 10:46:15,906 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] $Ultimate##0-->L68: Formula: (= (select (select |v_#memory_int_55| v_~A~0.base_32) v_~A~0.offset_32) v_~max~0_16) InVars {#memory_int=|v_#memory_int_55|, ~A~0.base=v_~A~0.base_32, ~A~0.offset=v_~A~0.offset_32} OutVars{#memory_int=|v_#memory_int_55|, thread2Thread1of1ForFork3_#t~mem6=|v_thread2Thread1of1ForFork3_#t~mem6_1|, ~A~0.base=v_~A~0.base_32, ~max~0=v_~max~0_16, ~A~0.offset=v_~A~0.offset_32} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~mem6, ~max~0] and [632] $Ultimate##0-->L84-4: Formula: (let ((.cse1 (select |v_#memory_int_258| v_~A~0.base_127)) (.cse2 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_41| 4) v_~A~0.offset_127 (- 4)))) (let ((.cse0 (select .cse1 .cse2))) (and (< |v_thread3Thread1of1ForFork0_~i~2#1_41| (+ 1 v_~N~0_99)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|) (= (store |v_#memory_int_258| v_~A~0.base_127 (store .cse1 .cse2 (+ (- 1) .cse0))) |v_#memory_int_257|) (= |v_thread3Thread1of1ForFork0_~i~2#1_41| 1)))) InVars {~A~0.base=v_~A~0.base_127, ~A~0.offset=v_~A~0.offset_127, #memory_int=|v_#memory_int_258|, ~N~0=v_~N~0_99} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_19|, ~A~0.base=v_~A~0.base_127, ~A~0.offset=v_~A~0.offset_127, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|, #memory_int=|v_#memory_int_257|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_23|, ~N~0=v_~N~0_99, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_41|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_19|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_19|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-13 10:46:15,949 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] $Ultimate##0-->L68: Formula: (= (select (select |v_#memory_int_55| v_~A~0.base_32) v_~A~0.offset_32) v_~max~0_16) InVars {#memory_int=|v_#memory_int_55|, ~A~0.base=v_~A~0.base_32, ~A~0.offset=v_~A~0.offset_32} OutVars{#memory_int=|v_#memory_int_55|, thread2Thread1of1ForFork3_#t~mem6=|v_thread2Thread1of1ForFork3_#t~mem6_1|, ~A~0.base=v_~A~0.base_32, ~max~0=v_~max~0_16, ~A~0.offset=v_~A~0.offset_32} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~mem6, ~max~0] and [532] L84-4-->L84-4: Formula: (let ((.cse0 (select |v_#memory_int_126| v_~A~0.base_66)) (.cse1 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_34| 4) v_~A~0.offset_66))) (let ((.cse2 (select .cse0 .cse1))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_#memory_int_125| (store |v_#memory_int_126| v_~A~0.base_66 (store .cse0 .cse1 (+ .cse2 (- 1))))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| (ite (< 0 (+ .cse2 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_33| (+ |v_thread3Thread1of1ForFork0_~i~2#1_34| 1)) (< |v_thread3Thread1of1ForFork0_~i~2#1_34| v_~N~0_29) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|)))) InVars {~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_34|} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_17|, ~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, #memory_int=|v_#memory_int_125|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_19|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_33|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_17|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-13 10:46:16,045 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] $Ultimate##0-->L68: Formula: (= (select (select |v_#memory_int_55| v_~A~0.base_32) v_~A~0.offset_32) v_~max~0_16) InVars {#memory_int=|v_#memory_int_55|, ~A~0.base=v_~A~0.base_32, ~A~0.offset=v_~A~0.offset_32} OutVars{#memory_int=|v_#memory_int_55|, thread2Thread1of1ForFork3_#t~mem6=|v_thread2Thread1of1ForFork3_#t~mem6_1|, ~A~0.base=v_~A~0.base_32, ~max~0=v_~max~0_16, ~A~0.offset=v_~A~0.offset_32} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~mem6, ~max~0] and [620] L56-4-->L56-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_35 (+ v_thread1Thread1of1ForFork1_~i~0_36 1)) (< v_thread1Thread1of1ForFork1_~i~0_36 v_~N~0_77) (let ((.cse1 (select (select |v_#memory_int_213| v_~A~0.base_104) (+ v_~A~0.offset_104 (* v_thread1Thread1of1ForFork1_~i~0_36 4))))) (let ((.cse0 (< v_~min~0_74 .cse1))) (or (and (= v_~min~0_74 v_~min~0_73) .cse0 (= |v_thread1_#t~mem4_34| |v_thread1Thread1of1ForFork1_#t~mem4_22|)) (and (not .cse0) (= v_~min~0_73 |v_thread1_#t~mem4_34|) (= .cse1 |v_thread1_#t~mem4_34|)))))) InVars {~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_22|, ~min~0=v_~min~0_74, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_36, ~N~0=v_~N~0_77} OutVars{~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_13|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_17|, ~min~0=v_~min~0_73, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, ~N~0=v_~N~0_77, thread1Thread1of1ForFork1_#t~ite5=|v_thread1Thread1of1ForFork1_#t~ite5_13|} AuxVars[|v_thread1_#t~mem4_34|] AssignedVars[thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~post2, ~min~0, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#t~ite5] [2022-12-13 10:46:16,400 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:46:16,401 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1790 [2022-12-13 10:46:16,402 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 297 transitions, 1835 flow [2022-12-13 10:46:16,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:46:16,402 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:46:16,402 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:46:16,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 10:46:16,402 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:46:16,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:46:16,402 INFO L85 PathProgramCache]: Analyzing trace with hash -115019056, now seen corresponding path program 1 times [2022-12-13 10:46:16,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:46:16,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805534138] [2022-12-13 10:46:16,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:46:16,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:46:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:46:16,646 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-13 10:46:16,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:46:16,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805534138] [2022-12-13 10:46:16,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805534138] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:46:16,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:46:16,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 10:46:16,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548768187] [2022-12-13 10:46:16,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:46:16,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:46:16,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:46:16,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:46:16,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:46:16,647 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-13 10:46:16,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 297 transitions, 1835 flow. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:46:16,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:46:16,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-13 10:46:16,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:46:19,154 INFO L130 PetriNetUnfolder]: 15236/21495 cut-off events. [2022-12-13 10:46:19,154 INFO L131 PetriNetUnfolder]: For 1590107/1590107 co-relation queries the response was YES. [2022-12-13 10:46:19,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107608 conditions, 21495 events. 15236/21495 cut-off events. For 1590107/1590107 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 121424 event pairs, 3616 based on Foata normal form. 29/19978 useless extension candidates. Maximal degree in co-relation 107494. Up to 13025 conditions per place. [2022-12-13 10:46:19,291 INFO L137 encePairwiseOnDemand]: 35/56 looper letters, 163 selfloop transitions, 18 changer transitions 490/671 dead transitions. [2022-12-13 10:46:19,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 671 transitions, 5387 flow [2022-12-13 10:46:19,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:46:19,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:46:19,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2022-12-13 10:46:19,293 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41785714285714287 [2022-12-13 10:46:19,293 INFO L175 Difference]: Start difference. First operand has 186 places, 297 transitions, 1835 flow. Second operand 5 states and 117 transitions. [2022-12-13 10:46:19,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 671 transitions, 5387 flow [2022-12-13 10:46:21,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 671 transitions, 5273 flow, removed 36 selfloop flow, removed 16 redundant places. [2022-12-13 10:46:21,430 INFO L231 Difference]: Finished difference. Result has 176 places, 140 transitions, 831 flow [2022-12-13 10:46:21,431 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1765, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=831, PETRI_PLACES=176, PETRI_TRANSITIONS=140} [2022-12-13 10:46:21,431 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 136 predicate places. [2022-12-13 10:46:21,431 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:46:21,431 INFO L89 Accepts]: Start accepts. Operand has 176 places, 140 transitions, 831 flow [2022-12-13 10:46:21,432 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:46:21,432 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:46:21,432 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 140 transitions, 831 flow [2022-12-13 10:46:21,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 140 transitions, 831 flow [2022-12-13 10:46:21,474 INFO L130 PetriNetUnfolder]: 214/587 cut-off events. [2022-12-13 10:46:21,474 INFO L131 PetriNetUnfolder]: For 15879/15922 co-relation queries the response was YES. [2022-12-13 10:46:21,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1749 conditions, 587 events. 214/587 cut-off events. For 15879/15922 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3499 event pairs, 0 based on Foata normal form. 0/547 useless extension candidates. Maximal degree in co-relation 1660. Up to 124 conditions per place. [2022-12-13 10:46:21,481 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 140 transitions, 831 flow [2022-12-13 10:46:21,481 INFO L226 LiptonReduction]: Number of co-enabled transitions 1726 [2022-12-13 10:46:21,482 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:46:21,483 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-13 10:46:21,483 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 140 transitions, 831 flow [2022-12-13 10:46:21,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:46:21,483 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:46:21,483 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:46:21,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 10:46:21,484 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:46:21,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:46:21,484 INFO L85 PathProgramCache]: Analyzing trace with hash 649474866, now seen corresponding path program 1 times [2022-12-13 10:46:21,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:46:21,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565985470] [2022-12-13 10:46:21,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:46:21,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:46:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:46:21,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:46:21,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:46:21,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565985470] [2022-12-13 10:46:21,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565985470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:46:21,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:46:21,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:46:21,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259166872] [2022-12-13 10:46:21,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:46:21,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:46:21,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:46:21,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:46:21,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:46:21,710 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 10:46:21,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 140 transitions, 831 flow. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:46:21,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:46:21,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 10:46:21,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:46:24,091 INFO L130 PetriNetUnfolder]: 15186/21090 cut-off events. [2022-12-13 10:46:24,091 INFO L131 PetriNetUnfolder]: For 2007016/2007016 co-relation queries the response was YES. [2022-12-13 10:46:24,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127777 conditions, 21090 events. 15186/21090 cut-off events. For 2007016/2007016 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 115341 event pairs, 2976 based on Foata normal form. 14/19570 useless extension candidates. Maximal degree in co-relation 127675. Up to 9532 conditions per place. [2022-12-13 10:46:24,201 INFO L137 encePairwiseOnDemand]: 21/37 looper letters, 163 selfloop transitions, 27 changer transitions 340/530 dead transitions. [2022-12-13 10:46:24,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 530 transitions, 4294 flow [2022-12-13 10:46:24,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:46:24,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:46:24,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 183 transitions. [2022-12-13 10:46:24,203 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44963144963144963 [2022-12-13 10:46:24,203 INFO L175 Difference]: Start difference. First operand has 127 places, 140 transitions, 831 flow. Second operand 11 states and 183 transitions. [2022-12-13 10:46:24,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 530 transitions, 4294 flow [2022-12-13 10:46:32,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 530 transitions, 3632 flow, removed 283 selfloop flow, removed 50 redundant places. [2022-12-13 10:46:32,740 INFO L231 Difference]: Finished difference. Result has 96 places, 159 transitions, 1069 flow [2022-12-13 10:46:32,740 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1069, PETRI_PLACES=96, PETRI_TRANSITIONS=159} [2022-12-13 10:46:32,741 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 56 predicate places. [2022-12-13 10:46:32,741 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:46:32,741 INFO L89 Accepts]: Start accepts. Operand has 96 places, 159 transitions, 1069 flow [2022-12-13 10:46:32,742 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:46:32,742 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:46:32,742 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 159 transitions, 1069 flow [2022-12-13 10:46:32,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 159 transitions, 1069 flow [2022-12-13 10:46:32,817 INFO L130 PetriNetUnfolder]: 624/1299 cut-off events. [2022-12-13 10:46:32,818 INFO L131 PetriNetUnfolder]: For 7129/7229 co-relation queries the response was YES. [2022-12-13 10:46:32,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4681 conditions, 1299 events. 624/1299 cut-off events. For 7129/7229 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 7904 event pairs, 67 based on Foata normal form. 6/1284 useless extension candidates. Maximal degree in co-relation 4619. Up to 306 conditions per place. [2022-12-13 10:46:32,869 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 159 transitions, 1069 flow [2022-12-13 10:46:32,869 INFO L226 LiptonReduction]: Number of co-enabled transitions 1744 [2022-12-13 10:46:32,869 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:46:32,871 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 10:46:32,871 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 159 transitions, 1069 flow [2022-12-13 10:46:32,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:46:32,872 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:46:32,872 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:46:32,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 10:46:32,872 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:46:32,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:46:32,872 INFO L85 PathProgramCache]: Analyzing trace with hash 364494908, now seen corresponding path program 2 times [2022-12-13 10:46:32,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:46:32,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300266754] [2022-12-13 10:46:32,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:46:32,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:46:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:46:33,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:46:33,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:46:33,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300266754] [2022-12-13 10:46:33,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300266754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:46:33,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:46:33,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:46:33,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696300163] [2022-12-13 10:46:33,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:46:33,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:46:33,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:46:33,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:46:33,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:46:33,140 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 10:46:33,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 159 transitions, 1069 flow. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:46:33,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:46:33,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 10:46:33,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:46:35,600 INFO L130 PetriNetUnfolder]: 21582/30092 cut-off events. [2022-12-13 10:46:35,601 INFO L131 PetriNetUnfolder]: For 321250/321250 co-relation queries the response was YES. [2022-12-13 10:46:35,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141603 conditions, 30092 events. 21582/30092 cut-off events. For 321250/321250 co-relation queries the response was YES. Maximal size of possible extension queue 1088. Compared 174523 event pairs, 6106 based on Foata normal form. 14/30104 useless extension candidates. Maximal degree in co-relation 141480. Up to 9700 conditions per place. [2022-12-13 10:46:35,802 INFO L137 encePairwiseOnDemand]: 21/37 looper letters, 322 selfloop transitions, 69 changer transitions 300/691 dead transitions. [2022-12-13 10:46:35,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 691 transitions, 6086 flow [2022-12-13 10:46:35,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 10:46:35,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 10:46:35,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 229 transitions. [2022-12-13 10:46:35,805 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4420849420849421 [2022-12-13 10:46:35,805 INFO L175 Difference]: Start difference. First operand has 89 places, 159 transitions, 1069 flow. Second operand 14 states and 229 transitions. [2022-12-13 10:46:35,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 691 transitions, 6086 flow [2022-12-13 10:46:36,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 691 transitions, 5786 flow, removed 147 selfloop flow, removed 5 redundant places. [2022-12-13 10:46:36,791 INFO L231 Difference]: Finished difference. Result has 107 places, 201 transitions, 1711 flow [2022-12-13 10:46:36,791 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1011, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1711, PETRI_PLACES=107, PETRI_TRANSITIONS=201} [2022-12-13 10:46:36,791 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 67 predicate places. [2022-12-13 10:46:36,791 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:46:36,792 INFO L89 Accepts]: Start accepts. Operand has 107 places, 201 transitions, 1711 flow [2022-12-13 10:46:36,792 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:46:36,792 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:46:36,793 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 201 transitions, 1711 flow [2022-12-13 10:46:36,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 201 transitions, 1711 flow [2022-12-13 10:46:37,067 INFO L130 PetriNetUnfolder]: 1280/2673 cut-off events. [2022-12-13 10:46:37,067 INFO L131 PetriNetUnfolder]: For 23176/23375 co-relation queries the response was YES. [2022-12-13 10:46:37,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11660 conditions, 2673 events. 1280/2673 cut-off events. For 23176/23375 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 19190 event pairs, 115 based on Foata normal form. 14/2648 useless extension candidates. Maximal degree in co-relation 11555. Up to 623 conditions per place. [2022-12-13 10:46:37,095 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 201 transitions, 1711 flow [2022-12-13 10:46:37,095 INFO L226 LiptonReduction]: Number of co-enabled transitions 2216 [2022-12-13 10:46:37,096 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:46:37,097 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 306 [2022-12-13 10:46:37,097 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 201 transitions, 1711 flow [2022-12-13 10:46:37,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:46:37,097 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:46:37,097 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:46:37,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 10:46:37,098 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:46:37,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:46:37,098 INFO L85 PathProgramCache]: Analyzing trace with hash -898019978, now seen corresponding path program 3 times [2022-12-13 10:46:37,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:46:37,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810555108] [2022-12-13 10:46:37,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:46:37,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:46:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:46:37,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:46:37,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:46:37,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810555108] [2022-12-13 10:46:37,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810555108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:46:37,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:46:37,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:46:37,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956506172] [2022-12-13 10:46:37,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:46:37,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:46:37,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:46:37,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:46:37,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:46:37,340 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 10:46:37,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 201 transitions, 1711 flow. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:46:37,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:46:37,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 10:46:37,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:46:41,571 INFO L130 PetriNetUnfolder]: 30119/41962 cut-off events. [2022-12-13 10:46:41,571 INFO L131 PetriNetUnfolder]: For 688712/688712 co-relation queries the response was YES. [2022-12-13 10:46:41,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228219 conditions, 41962 events. 30119/41962 cut-off events. For 688712/688712 co-relation queries the response was YES. Maximal size of possible extension queue 1442. Compared 253906 event pairs, 6891 based on Foata normal form. 40/42001 useless extension candidates. Maximal degree in co-relation 228089. Up to 20121 conditions per place. [2022-12-13 10:46:41,822 INFO L137 encePairwiseOnDemand]: 25/37 looper letters, 187 selfloop transitions, 54 changer transitions 317/558 dead transitions. [2022-12-13 10:46:41,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 558 transitions, 5677 flow [2022-12-13 10:46:41,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:46:41,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:46:41,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 180 transitions. [2022-12-13 10:46:41,824 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44226044226044225 [2022-12-13 10:46:41,824 INFO L175 Difference]: Start difference. First operand has 100 places, 201 transitions, 1711 flow. Second operand 11 states and 180 transitions. [2022-12-13 10:46:41,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 558 transitions, 5677 flow [2022-12-13 10:46:46,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 558 transitions, 4996 flow, removed 313 selfloop flow, removed 9 redundant places. [2022-12-13 10:46:46,246 INFO L231 Difference]: Finished difference. Result has 108 places, 203 transitions, 1734 flow [2022-12-13 10:46:46,246 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1502, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1734, PETRI_PLACES=108, PETRI_TRANSITIONS=203} [2022-12-13 10:46:46,250 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 68 predicate places. [2022-12-13 10:46:46,250 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:46:46,250 INFO L89 Accepts]: Start accepts. Operand has 108 places, 203 transitions, 1734 flow [2022-12-13 10:46:46,253 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:46:46,255 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:46:46,256 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 203 transitions, 1734 flow [2022-12-13 10:46:46,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 203 transitions, 1734 flow [2022-12-13 10:46:46,472 INFO L130 PetriNetUnfolder]: 1309/2712 cut-off events. [2022-12-13 10:46:46,472 INFO L131 PetriNetUnfolder]: For 19916/20135 co-relation queries the response was YES. [2022-12-13 10:46:46,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10949 conditions, 2712 events. 1309/2712 cut-off events. For 19916/20135 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 19405 event pairs, 106 based on Foata normal form. 13/2677 useless extension candidates. Maximal degree in co-relation 10821. Up to 634 conditions per place. [2022-12-13 10:46:46,494 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 203 transitions, 1734 flow [2022-12-13 10:46:46,494 INFO L226 LiptonReduction]: Number of co-enabled transitions 2224 [2022-12-13 10:46:46,495 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:46:46,496 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 246 [2022-12-13 10:46:46,496 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 203 transitions, 1734 flow [2022-12-13 10:46:46,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:46:46,496 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:46:46,496 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:46:46,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 10:46:46,496 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:46:46,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:46:46,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1317522346, now seen corresponding path program 4 times [2022-12-13 10:46:46,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:46:46,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820540311] [2022-12-13 10:46:46,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:46:46,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:46:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:46:46,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:46:46,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:46:46,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820540311] [2022-12-13 10:46:46,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820540311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:46:46,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:46:46,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:46:46,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706984023] [2022-12-13 10:46:46,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:46:46,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:46:46,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:46:46,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:46:46,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:46:46,862 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 10:46:46,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 203 transitions, 1734 flow. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:46:46,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:46:46,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 10:46:46,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:46:49,617 INFO L130 PetriNetUnfolder]: 20872/29181 cut-off events. [2022-12-13 10:46:49,618 INFO L131 PetriNetUnfolder]: For 376303/376303 co-relation queries the response was YES. [2022-12-13 10:46:49,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144534 conditions, 29181 events. 20872/29181 cut-off events. For 376303/376303 co-relation queries the response was YES. Maximal size of possible extension queue 1003. Compared 168408 event pairs, 7473 based on Foata normal form. 16/29196 useless extension candidates. Maximal degree in co-relation 144381. Up to 9743 conditions per place. [2022-12-13 10:46:49,781 INFO L137 encePairwiseOnDemand]: 24/37 looper letters, 322 selfloop transitions, 71 changer transitions 233/626 dead transitions. [2022-12-13 10:46:49,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 626 transitions, 6158 flow [2022-12-13 10:46:49,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:46:49,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:46:49,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 187 transitions. [2022-12-13 10:46:49,783 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2022-12-13 10:46:49,783 INFO L175 Difference]: Start difference. First operand has 102 places, 203 transitions, 1734 flow. Second operand 11 states and 187 transitions. [2022-12-13 10:46:49,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 626 transitions, 6158 flow [2022-12-13 10:46:51,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 626 transitions, 5690 flow, removed 207 selfloop flow, removed 8 redundant places. [2022-12-13 10:46:51,368 INFO L231 Difference]: Finished difference. Result has 110 places, 206 transitions, 1833 flow [2022-12-13 10:46:51,368 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1596, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1833, PETRI_PLACES=110, PETRI_TRANSITIONS=206} [2022-12-13 10:46:51,368 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 70 predicate places. [2022-12-13 10:46:51,368 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:46:51,368 INFO L89 Accepts]: Start accepts. Operand has 110 places, 206 transitions, 1833 flow [2022-12-13 10:46:51,369 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:46:51,369 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:46:51,369 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 206 transitions, 1833 flow [2022-12-13 10:46:51,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 206 transitions, 1833 flow [2022-12-13 10:46:51,543 INFO L130 PetriNetUnfolder]: 1316/2725 cut-off events. [2022-12-13 10:46:51,543 INFO L131 PetriNetUnfolder]: For 18839/19064 co-relation queries the response was YES. [2022-12-13 10:46:51,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10891 conditions, 2725 events. 1316/2725 cut-off events. For 18839/19064 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 19474 event pairs, 120 based on Foata normal form. 13/2690 useless extension candidates. Maximal degree in co-relation 10786. Up to 638 conditions per place. [2022-12-13 10:46:51,567 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 206 transitions, 1833 flow [2022-12-13 10:46:51,567 INFO L226 LiptonReduction]: Number of co-enabled transitions 2246 [2022-12-13 10:46:51,568 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:46:51,569 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 201 [2022-12-13 10:46:51,569 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 206 transitions, 1833 flow [2022-12-13 10:46:51,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:46:51,569 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:46:51,569 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:46:51,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 10:46:51,569 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:46:51,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:46:51,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1572085880, now seen corresponding path program 5 times [2022-12-13 10:46:51,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:46:51,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432189530] [2022-12-13 10:46:51,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:46:51,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:46:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:46:51,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:46:51,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:46:51,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432189530] [2022-12-13 10:46:51,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432189530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:46:51,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:46:51,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:46:51,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770520276] [2022-12-13 10:46:51,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:46:51,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:46:51,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:46:51,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:46:51,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:46:51,972 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 10:46:51,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 206 transitions, 1833 flow. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:46:51,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:46:51,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 10:46:51,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:46:56,966 INFO L130 PetriNetUnfolder]: 34623/48238 cut-off events. [2022-12-13 10:46:56,967 INFO L131 PetriNetUnfolder]: For 650925/650925 co-relation queries the response was YES. [2022-12-13 10:46:57,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238374 conditions, 48238 events. 34623/48238 cut-off events. For 650925/650925 co-relation queries the response was YES. Maximal size of possible extension queue 1575. Compared 294678 event pairs, 8397 based on Foata normal form. 32/48269 useless extension candidates. Maximal degree in co-relation 238148. Up to 11249 conditions per place. [2022-12-13 10:46:57,445 INFO L137 encePairwiseOnDemand]: 23/37 looper letters, 522 selfloop transitions, 70 changer transitions 433/1025 dead transitions. [2022-12-13 10:46:57,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 1025 transitions, 9668 flow [2022-12-13 10:46:57,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 10:46:57,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 10:46:57,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 350 transitions. [2022-12-13 10:46:57,450 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49786628733997157 [2022-12-13 10:46:57,451 INFO L175 Difference]: Start difference. First operand has 106 places, 206 transitions, 1833 flow. Second operand 19 states and 350 transitions. [2022-12-13 10:46:57,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 1025 transitions, 9668 flow [2022-12-13 10:46:59,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 1025 transitions, 9158 flow, removed 223 selfloop flow, removed 6 redundant places. [2022-12-13 10:46:59,647 INFO L231 Difference]: Finished difference. Result has 135 places, 254 transitions, 2537 flow [2022-12-13 10:46:59,647 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1719, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2537, PETRI_PLACES=135, PETRI_TRANSITIONS=254} [2022-12-13 10:46:59,648 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 95 predicate places. [2022-12-13 10:46:59,648 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:46:59,649 INFO L89 Accepts]: Start accepts. Operand has 135 places, 254 transitions, 2537 flow [2022-12-13 10:46:59,654 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:46:59,654 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:46:59,654 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 254 transitions, 2537 flow [2022-12-13 10:46:59,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 254 transitions, 2537 flow [2022-12-13 10:46:59,979 INFO L130 PetriNetUnfolder]: 1900/4063 cut-off events. [2022-12-13 10:46:59,979 INFO L131 PetriNetUnfolder]: For 46470/46858 co-relation queries the response was YES. [2022-12-13 10:46:59,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18566 conditions, 4063 events. 1900/4063 cut-off events. For 46470/46858 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 31816 event pairs, 166 based on Foata normal form. 26/4022 useless extension candidates. Maximal degree in co-relation 18339. Up to 903 conditions per place. [2022-12-13 10:47:00,068 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 254 transitions, 2537 flow [2022-12-13 10:47:00,068 INFO L226 LiptonReduction]: Number of co-enabled transitions 2958 [2022-12-13 10:47:00,072 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:47:00,074 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 426 [2022-12-13 10:47:00,074 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 254 transitions, 2537 flow [2022-12-13 10:47:00,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:47:00,074 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:47:00,074 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:47:00,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 10:47:00,074 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:47:00,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:47:00,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1812514457, now seen corresponding path program 1 times [2022-12-13 10:47:00,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:47:00,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94177510] [2022-12-13 10:47:00,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:47:00,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:47:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:47:00,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:47:00,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:47:00,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94177510] [2022-12-13 10:47:00,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94177510] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:47:00,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885375675] [2022-12-13 10:47:00,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:47:00,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:47:00,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:47:00,497 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-13 10:47:00,499 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-13 10:47:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:47:00,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 10:47:00,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:47:00,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:47:00,654 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 14 treesize of output 16 [2022-12-13 10:47:00,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:47:00,695 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 21 treesize of output 21 [2022-12-13 10:47:00,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 15 treesize of output 7 [2022-12-13 10:47:00,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:47:00,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:47:00,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:47:00,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885375675] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 10:47:00,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 10:47:01,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 9] total 21 [2022-12-13 10:47:01,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582035638] [2022-12-13 10:47:01,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:47:01,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:47:01,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:47:01,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:47:01,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2022-12-13 10:47:01,002 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 10:47:01,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 254 transitions, 2537 flow. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:47:01,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:47:01,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 10:47:01,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:47:06,844 INFO L130 PetriNetUnfolder]: 37567/52494 cut-off events. [2022-12-13 10:47:06,845 INFO L131 PetriNetUnfolder]: For 1168202/1168202 co-relation queries the response was YES. [2022-12-13 10:47:07,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298133 conditions, 52494 events. 37567/52494 cut-off events. For 1168202/1168202 co-relation queries the response was YES. Maximal size of possible extension queue 1741. Compared 326669 event pairs, 13077 based on Foata normal form. 22/52515 useless extension candidates. Maximal degree in co-relation 297454. Up to 35635 conditions per place. [2022-12-13 10:47:07,360 INFO L137 encePairwiseOnDemand]: 25/37 looper letters, 331 selfloop transitions, 32 changer transitions 34/397 dead transitions. [2022-12-13 10:47:07,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 397 transitions, 4673 flow [2022-12-13 10:47:07,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:47:07,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:47:07,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2022-12-13 10:47:07,362 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 10:47:07,362 INFO L175 Difference]: Start difference. First operand has 123 places, 254 transitions, 2537 flow. Second operand 6 states and 111 transitions. [2022-12-13 10:47:07,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 397 transitions, 4673 flow [2022-12-13 10:47:11,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 397 transitions, 4310 flow, removed 146 selfloop flow, removed 14 redundant places. [2022-12-13 10:47:11,284 INFO L231 Difference]: Finished difference. Result has 118 places, 279 transitions, 2771 flow [2022-12-13 10:47:11,285 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2366, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2771, PETRI_PLACES=118, PETRI_TRANSITIONS=279} [2022-12-13 10:47:11,285 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 78 predicate places. [2022-12-13 10:47:11,285 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:47:11,285 INFO L89 Accepts]: Start accepts. Operand has 118 places, 279 transitions, 2771 flow [2022-12-13 10:47:11,286 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:47:11,286 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:47:11,287 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 279 transitions, 2771 flow [2022-12-13 10:47:11,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 279 transitions, 2771 flow [2022-12-13 10:47:11,770 INFO L130 PetriNetUnfolder]: 2436/5380 cut-off events. [2022-12-13 10:47:11,770 INFO L131 PetriNetUnfolder]: For 44147/44789 co-relation queries the response was YES. [2022-12-13 10:47:11,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23220 conditions, 5380 events. 2436/5380 cut-off events. For 44147/44789 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 45383 event pairs, 206 based on Foata normal form. 30/5295 useless extension candidates. Maximal degree in co-relation 23002. Up to 1201 conditions per place. [2022-12-13 10:47:11,873 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 279 transitions, 2771 flow [2022-12-13 10:47:11,873 INFO L226 LiptonReduction]: Number of co-enabled transitions 3176 [2022-12-13 10:47:11,875 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:47:11,877 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 592 [2022-12-13 10:47:11,877 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 279 transitions, 2771 flow [2022-12-13 10:47:11,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:47:11,877 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:47:11,877 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:47:11,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 10:47:12,082 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,SelfDestructingSolverStorable12 [2022-12-13 10:47:12,082 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:47:12,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:47:12,082 INFO L85 PathProgramCache]: Analyzing trace with hash 882745736, now seen corresponding path program 6 times [2022-12-13 10:47:12,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:47:12,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135112535] [2022-12-13 10:47:12,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:47:12,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:47:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:47:12,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:47:12,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:47:12,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135112535] [2022-12-13 10:47:12,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135112535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:47:12,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:47:12,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:47:12,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019248501] [2022-12-13 10:47:12,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:47:12,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:47:12,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:47:12,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:47:12,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:47:12,518 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 10:47:12,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 279 transitions, 2771 flow. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:47:12,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:47:12,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 10:47:12,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:47:21,358 INFO L130 PetriNetUnfolder]: 58468/81951 cut-off events. [2022-12-13 10:47:21,358 INFO L131 PetriNetUnfolder]: For 1141220/1141220 co-relation queries the response was YES. [2022-12-13 10:47:21,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422314 conditions, 81951 events. 58468/81951 cut-off events. For 1141220/1141220 co-relation queries the response was YES. Maximal size of possible extension queue 2932. Compared 549220 event pairs, 21955 based on Foata normal form. 66/82016 useless extension candidates. Maximal degree in co-relation 421957. Up to 27534 conditions per place. [2022-12-13 10:47:22,105 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 505 selfloop transitions, 13 changer transitions 506/1024 dead transitions. [2022-12-13 10:47:22,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 1024 transitions, 11322 flow [2022-12-13 10:47:22,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:47:22,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:47:22,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2022-12-13 10:47:22,107 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6148648648648649 [2022-12-13 10:47:22,107 INFO L175 Difference]: Start difference. First operand has 117 places, 279 transitions, 2771 flow. Second operand 8 states and 182 transitions. [2022-12-13 10:47:22,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 1024 transitions, 11322 flow [2022-12-13 10:47:26,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 1024 transitions, 11076 flow, removed 93 selfloop flow, removed 2 redundant places. [2022-12-13 10:47:26,052 INFO L231 Difference]: Finished difference. Result has 128 places, 281 transitions, 2816 flow [2022-12-13 10:47:26,053 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2716, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2816, PETRI_PLACES=128, PETRI_TRANSITIONS=281} [2022-12-13 10:47:26,053 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 88 predicate places. [2022-12-13 10:47:26,053 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:47:26,053 INFO L89 Accepts]: Start accepts. Operand has 128 places, 281 transitions, 2816 flow [2022-12-13 10:47:26,054 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:47:26,054 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:47:26,054 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 281 transitions, 2816 flow [2022-12-13 10:47:26,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 281 transitions, 2816 flow [2022-12-13 10:47:26,479 INFO L130 PetriNetUnfolder]: 2297/5461 cut-off events. [2022-12-13 10:47:26,479 INFO L131 PetriNetUnfolder]: For 52083/52729 co-relation queries the response was YES. [2022-12-13 10:47:26,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23048 conditions, 5461 events. 2297/5461 cut-off events. For 52083/52729 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 48733 event pairs, 155 based on Foata normal form. 51/5391 useless extension candidates. Maximal degree in co-relation 22804. Up to 1133 conditions per place. [2022-12-13 10:47:26,550 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 281 transitions, 2816 flow [2022-12-13 10:47:26,550 INFO L226 LiptonReduction]: Number of co-enabled transitions 3206 [2022-12-13 10:47:26,553 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:47:26,553 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 500 [2022-12-13 10:47:26,553 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 281 transitions, 2816 flow [2022-12-13 10:47:26,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:47:26,553 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:47:26,553 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:47:26,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 10:47:26,554 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:47:26,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:47:26,554 INFO L85 PathProgramCache]: Analyzing trace with hash -2054018526, now seen corresponding path program 7 times [2022-12-13 10:47:26,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:47:26,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589513244] [2022-12-13 10:47:26,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:47:26,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:47:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:47:26,912 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-13 10:47:26,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:47:26,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589513244] [2022-12-13 10:47:26,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589513244] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:47:26,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261149077] [2022-12-13 10:47:26,913 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 10:47:26,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:47:26,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:47:26,929 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-13 10:47:26,930 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-13 10:47:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:47:27,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 10:47:27,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:47:27,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:47:27,085 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 14 treesize of output 16 [2022-12-13 10:47:27,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:47:27,107 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 14 treesize of output 16 [2022-12-13 10:47:27,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 15 treesize of output 7 [2022-12-13 10:47:27,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:47:27,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:47:27,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261149077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:47:27,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:47:27,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 15 [2022-12-13 10:47:27,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955936774] [2022-12-13 10:47:27,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:47:27,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:47:27,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:47:27,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:47:27,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-12-13 10:47:27,190 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 10:47:27,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 281 transitions, 2816 flow. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:47:27,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:47:27,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 10:47:27,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:47:33,743 INFO L130 PetriNetUnfolder]: 42807/60076 cut-off events. [2022-12-13 10:47:33,744 INFO L131 PetriNetUnfolder]: For 986026/986026 co-relation queries the response was YES. [2022-12-13 10:47:34,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316046 conditions, 60076 events. 42807/60076 cut-off events. For 986026/986026 co-relation queries the response was YES. Maximal size of possible extension queue 2163. Compared 384472 event pairs, 13606 based on Foata normal form. 48/60123 useless extension candidates. Maximal degree in co-relation 315697. Up to 27507 conditions per place. [2022-12-13 10:47:34,201 INFO L137 encePairwiseOnDemand]: 26/37 looper letters, 360 selfloop transitions, 10 changer transitions 309/679 dead transitions. [2022-12-13 10:47:34,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 679 transitions, 7315 flow [2022-12-13 10:47:34,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 10:47:34,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 10:47:34,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 191 transitions. [2022-12-13 10:47:34,202 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43018018018018017 [2022-12-13 10:47:34,202 INFO L175 Difference]: Start difference. First operand has 125 places, 281 transitions, 2816 flow. Second operand 12 states and 191 transitions. [2022-12-13 10:47:34,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 679 transitions, 7315 flow [2022-12-13 10:47:36,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 679 transitions, 7227 flow, removed 24 selfloop flow, removed 8 redundant places. [2022-12-13 10:47:36,459 INFO L231 Difference]: Finished difference. Result has 135 places, 240 transitions, 2399 flow [2022-12-13 10:47:36,459 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2754, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2399, PETRI_PLACES=135, PETRI_TRANSITIONS=240} [2022-12-13 10:47:36,459 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 95 predicate places. [2022-12-13 10:47:36,459 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:47:36,459 INFO L89 Accepts]: Start accepts. Operand has 135 places, 240 transitions, 2399 flow [2022-12-13 10:47:36,460 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:47:36,461 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:47:36,461 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 240 transitions, 2399 flow [2022-12-13 10:47:36,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 240 transitions, 2399 flow [2022-12-13 10:47:36,874 INFO L130 PetriNetUnfolder]: 1893/4225 cut-off events. [2022-12-13 10:47:36,874 INFO L131 PetriNetUnfolder]: For 49414/49976 co-relation queries the response was YES. [2022-12-13 10:47:36,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19530 conditions, 4225 events. 1893/4225 cut-off events. For 49414/49976 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 34138 event pairs, 126 based on Foata normal form. 37/4171 useless extension candidates. Maximal degree in co-relation 19258. Up to 890 conditions per place. [2022-12-13 10:47:36,920 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 240 transitions, 2399 flow [2022-12-13 10:47:36,921 INFO L226 LiptonReduction]: Number of co-enabled transitions 2762 [2022-12-13 10:47:36,922 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:47:36,923 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 464 [2022-12-13 10:47:36,923 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 240 transitions, 2399 flow [2022-12-13 10:47:36,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:47:36,923 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:47:36,923 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:47:36,928 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-13 10:47:37,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:47:37,128 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:47:37,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:47:37,128 INFO L85 PathProgramCache]: Analyzing trace with hash 596308841, now seen corresponding path program 1 times [2022-12-13 10:47:37,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:47:37,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89055524] [2022-12-13 10:47:37,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:47:37,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:47:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:47:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:47:37,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:47:37,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89055524] [2022-12-13 10:47:37,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89055524] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:47:37,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:47:37,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:47:37,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519205609] [2022-12-13 10:47:37,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:47:37,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:47:37,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:47:37,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:47:37,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:47:37,185 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 10:47:37,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 240 transitions, 2399 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:47:37,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:47:37,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 10:47:37,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:47:42,094 INFO L130 PetriNetUnfolder]: 32576/45619 cut-off events. [2022-12-13 10:47:42,094 INFO L131 PetriNetUnfolder]: For 780326/780326 co-relation queries the response was YES. [2022-12-13 10:47:42,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250344 conditions, 45619 events. 32576/45619 cut-off events. For 780326/780326 co-relation queries the response was YES. Maximal size of possible extension queue 1600. Compared 279886 event pairs, 15178 based on Foata normal form. 1644/47262 useless extension candidates. Maximal degree in co-relation 250011. Up to 26983 conditions per place. [2022-12-13 10:47:42,374 INFO L137 encePairwiseOnDemand]: 31/37 looper letters, 388 selfloop transitions, 69 changer transitions 0/457 dead transitions. [2022-12-13 10:47:42,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 457 transitions, 5300 flow [2022-12-13 10:47:42,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:47:42,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:47:42,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-13 10:47:42,375 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5878378378378378 [2022-12-13 10:47:42,375 INFO L175 Difference]: Start difference. First operand has 126 places, 240 transitions, 2399 flow. Second operand 4 states and 87 transitions. [2022-12-13 10:47:42,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 457 transitions, 5300 flow [2022-12-13 10:47:44,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 457 transitions, 4895 flow, removed 166 selfloop flow, removed 13 redundant places. [2022-12-13 10:47:44,230 INFO L231 Difference]: Finished difference. Result has 118 places, 280 transitions, 2879 flow [2022-12-13 10:47:44,231 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2168, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2879, PETRI_PLACES=118, PETRI_TRANSITIONS=280} [2022-12-13 10:47:44,231 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 78 predicate places. [2022-12-13 10:47:44,231 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:47:44,231 INFO L89 Accepts]: Start accepts. Operand has 118 places, 280 transitions, 2879 flow [2022-12-13 10:47:44,232 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:47:44,232 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:47:44,232 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 280 transitions, 2879 flow [2022-12-13 10:47:44,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 280 transitions, 2879 flow [2022-12-13 10:47:44,657 INFO L130 PetriNetUnfolder]: 2419/5250 cut-off events. [2022-12-13 10:47:44,657 INFO L131 PetriNetUnfolder]: For 59738/60792 co-relation queries the response was YES. [2022-12-13 10:47:44,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24486 conditions, 5250 events. 2419/5250 cut-off events. For 59738/60792 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 43488 event pairs, 165 based on Foata normal form. 44/5193 useless extension candidates. Maximal degree in co-relation 19696. Up to 1151 conditions per place. [2022-12-13 10:47:44,727 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 280 transitions, 2879 flow [2022-12-13 10:47:44,727 INFO L226 LiptonReduction]: Number of co-enabled transitions 3182 [2022-12-13 10:47:44,729 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:47:44,731 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 500 [2022-12-13 10:47:44,731 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 280 transitions, 2879 flow [2022-12-13 10:47:44,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:47:44,731 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:47:44,731 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:47:44,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 10:47:44,731 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 10:47:44,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:47:44,731 INFO L85 PathProgramCache]: Analyzing trace with hash -2073087382, now seen corresponding path program 2 times [2022-12-13 10:47:44,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:47:44,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631869341] [2022-12-13 10:47:44,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:47:44,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:47:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:47:45,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 10:47:45,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:47:45,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631869341] [2022-12-13 10:47:45,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631869341] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:47:45,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:47:45,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:47:45,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710141382] [2022-12-13 10:47:45,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:47:45,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:47:45,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:47:45,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:47:45,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:47:45,116 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 10:47:45,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 280 transitions, 2879 flow. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:47:45,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:47:45,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 10:47:45,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand