/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 12:58:25,970 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:58:25,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:58:25,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:58:25,999 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:58:26,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:58:26,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:58:26,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:58:26,007 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:58:26,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:58:26,011 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:58:26,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:58:26,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:58:26,016 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:58:26,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:58:26,018 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:58:26,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:58:26,020 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:58:26,023 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:58:26,027 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:58:26,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:58:26,029 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:58:26,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:58:26,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:58:26,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:58:26,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:58:26,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:58:26,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:58:26,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:58:26,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:58:26,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:58:26,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:58:26,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:58:26,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:58:26,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:58:26,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:58:26,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:58:26,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:58:26,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:58:26,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:58:26,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:58:26,043 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 12:58:26,068 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:58:26,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:58:26,069 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:58:26,069 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:58:26,069 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:58:26,070 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:58:26,070 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:58:26,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:58:26,070 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:58:26,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:58:26,071 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:58:26,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:58:26,071 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:58:26,071 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:58:26,071 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:58:26,072 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:58:26,072 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:58:26,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:58:26,072 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:58:26,072 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 12:58:26,072 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:58:26,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:58:26,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:58:26,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:58:26,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:58:26,073 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:58:26,073 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:58:26,073 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 12:58:26,073 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 12:58:26,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:58:26,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:58:26,394 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:58:26,395 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:58:26,395 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:58:26,396 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2022-12-13 12:58:27,542 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:58:27,723 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:58:27,724 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2022-12-13 12:58:27,741 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e2e0693f/27709fe6549b4a4d919a9ef5ba5c39ae/FLAG20550e901 [2022-12-13 12:58:27,750 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e2e0693f/27709fe6549b4a4d919a9ef5ba5c39ae [2022-12-13 12:58:27,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:58:27,753 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 12:58:27,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:58:27,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:58:27,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:58:27,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:58:27" (1/1) ... [2022-12-13 12:58:27,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e1b5a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:58:27, skipping insertion in model container [2022-12-13 12:58:27,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:58:27" (1/1) ... [2022-12-13 12:58:27,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:58:27,777 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:58:27,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,910 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2022-12-13 12:58:27,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:58:27,936 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:58:27,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:58:27,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:58:27,958 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2022-12-13 12:58:27,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:58:27,971 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:58:27,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:58:27 WrapperNode [2022-12-13 12:58:27,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:58:27,972 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:58:27,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:58:27,972 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:58:27,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:58:27" (1/1) ... [2022-12-13 12:58:27,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:58:27" (1/1) ... [2022-12-13 12:58:28,018 INFO L138 Inliner]: procedures = 29, calls = 95, calls flagged for inlining = 21, calls inlined = 27, statements flattened = 289 [2022-12-13 12:58:28,019 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:58:28,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:58:28,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:58:28,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:58:28,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:58:27" (1/1) ... [2022-12-13 12:58:28,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:58:27" (1/1) ... [2022-12-13 12:58:28,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:58:27" (1/1) ... [2022-12-13 12:58:28,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:58:27" (1/1) ... [2022-12-13 12:58:28,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:58:27" (1/1) ... [2022-12-13 12:58:28,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:58:27" (1/1) ... [2022-12-13 12:58:28,051 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:58:27" (1/1) ... [2022-12-13 12:58:28,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:58:27" (1/1) ... [2022-12-13 12:58:28,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:58:28,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:58:28,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:58:28,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:58:28,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:58:27" (1/1) ... [2022-12-13 12:58:28,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:58:28,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:58:28,104 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 12:58:28,110 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 12:58:28,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:58:28,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:58:28,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:58:28,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 12:58:28,153 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 12:58:28,153 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 12:58:28,153 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 12:58:28,154 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 12:58:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 12:58:28,154 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 12:58:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-13 12:58:28,154 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-13 12:58:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:58:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-12-13 12:58:28,154 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-12-13 12:58:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-12-13 12:58:28,154 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-12-13 12:58:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:58:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:58:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 12:58:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:58:28,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:58:28,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:58:28,157 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 12:58:28,302 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 12:58:28,303 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:58:28,645 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 12:58:28,824 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:58:28,824 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-13 12:58:28,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:58:28 BoogieIcfgContainer [2022-12-13 12:58:28,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:58:28,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:58:28,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:58:28,831 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:58:28,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:58:27" (1/3) ... [2022-12-13 12:58:28,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf2bec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:58:28, skipping insertion in model container [2022-12-13 12:58:28,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:58:27" (2/3) ... [2022-12-13 12:58:28,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf2bec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:58:28, skipping insertion in model container [2022-12-13 12:58:28,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:58:28" (3/3) ... [2022-12-13 12:58:28,833 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1-dsl.wvr.c [2022-12-13 12:58:28,845 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:58:28,845 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 12:58:28,846 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:58:28,928 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2022-12-13 12:58:28,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 249 places, 248 transitions, 568 flow [2022-12-13 12:58:29,056 INFO L130 PetriNetUnfolder]: 18/220 cut-off events. [2022-12-13 12:58:29,056 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 12:58:29,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 220 events. 18/220 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 281 event pairs, 0 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 190. Up to 3 conditions per place. [2022-12-13 12:58:29,062 INFO L82 GeneralOperation]: Start removeDead. Operand has 249 places, 248 transitions, 568 flow [2022-12-13 12:58:29,068 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 213 places, 212 transitions, 472 flow [2022-12-13 12:58:29,069 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:58:29,082 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 212 transitions, 472 flow [2022-12-13 12:58:29,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 212 transitions, 472 flow [2022-12-13 12:58:29,123 INFO L130 PetriNetUnfolder]: 18/212 cut-off events. [2022-12-13 12:58:29,123 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 12:58:29,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 212 events. 18/212 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 280 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 190. Up to 3 conditions per place. [2022-12-13 12:58:29,131 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 212 transitions, 472 flow [2022-12-13 12:58:29,131 INFO L226 LiptonReduction]: Number of co-enabled transitions 7312 [2022-12-13 12:58:35,202 INFO L241 LiptonReduction]: Total number of compositions: 151 [2022-12-13 12:58:35,234 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:58:35,239 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;@255ef86c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 12:58:35,240 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-12-13 12:58:35,248 INFO L130 PetriNetUnfolder]: 9/60 cut-off events. [2022-12-13 12:58:35,248 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 12:58:35,249 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:58:35,249 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:58:35,250 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-13 12:58:35,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:58:35,253 INFO L85 PathProgramCache]: Analyzing trace with hash -482795550, now seen corresponding path program 1 times [2022-12-13 12:58:35,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:58:35,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632023235] [2022-12-13 12:58:35,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:58:35,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:58:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:58:35,671 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 12:58:35,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:58:35,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632023235] [2022-12-13 12:58:35,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632023235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:58:35,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:58:35,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:58:35,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816715083] [2022-12-13 12:58:35,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:58:35,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:58:35,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:58:35,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:58:35,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:58:35,694 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 61 [2022-12-13 12:58:35,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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 12:58:35,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:58:35,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 61 [2022-12-13 12:58:35,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:58:38,576 INFO L130 PetriNetUnfolder]: 28944/36855 cut-off events. [2022-12-13 12:58:38,576 INFO L131 PetriNetUnfolder]: For 4966/4966 co-relation queries the response was YES. [2022-12-13 12:58:38,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79913 conditions, 36855 events. 28944/36855 cut-off events. For 4966/4966 co-relation queries the response was YES. Maximal size of possible extension queue 900. Compared 169829 event pairs, 12531 based on Foata normal form. 1/28136 useless extension candidates. Maximal degree in co-relation 78348. Up to 14539 conditions per place. [2022-12-13 12:58:38,739 INFO L137 encePairwiseOnDemand]: 54/61 looper letters, 115 selfloop transitions, 8 changer transitions 1/138 dead transitions. [2022-12-13 12:58:38,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 138 transitions, 653 flow [2022-12-13 12:58:38,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:58:38,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:58:38,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-12-13 12:58:38,748 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7418032786885246 [2022-12-13 12:58:38,749 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 170 flow. Second operand 4 states and 181 transitions. [2022-12-13 12:58:38,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 138 transitions, 653 flow [2022-12-13 12:58:38,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 138 transitions, 567 flow, removed 0 selfloop flow, removed 12 redundant places. [2022-12-13 12:58:38,834 INFO L231 Difference]: Finished difference. Result has 64 places, 68 transitions, 191 flow [2022-12-13 12:58:38,835 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=64, PETRI_TRANSITIONS=68} [2022-12-13 12:58:38,837 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, -7 predicate places. [2022-12-13 12:58:38,838 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:58:38,838 INFO L89 Accepts]: Start accepts. Operand has 64 places, 68 transitions, 191 flow [2022-12-13 12:58:38,842 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:58:38,842 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:58:38,842 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 68 transitions, 191 flow [2022-12-13 12:58:38,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 68 transitions, 191 flow [2022-12-13 12:58:38,861 INFO L130 PetriNetUnfolder]: 60/214 cut-off events. [2022-12-13 12:58:38,861 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 12:58:38,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 214 events. 60/214 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 821 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 254. Up to 25 conditions per place. [2022-12-13 12:58:38,865 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 68 transitions, 191 flow [2022-12-13 12:58:38,865 INFO L226 LiptonReduction]: Number of co-enabled transitions 2062 [2022-12-13 12:58:38,910 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:58:38,911 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-13 12:58:38,911 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 68 transitions, 191 flow [2022-12-13 12:58:38,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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 12:58:38,911 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:58:38,912 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:58:38,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:58:38,912 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-13 12:58:38,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:58:38,912 INFO L85 PathProgramCache]: Analyzing trace with hash -292667862, now seen corresponding path program 2 times [2022-12-13 12:58:38,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:58:38,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515933608] [2022-12-13 12:58:38,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:58:38,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:58:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:58:39,064 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 12:58:39,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:58:39,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515933608] [2022-12-13 12:58:39,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515933608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:58:39,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:58:39,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:58:39,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707768493] [2022-12-13 12:58:39,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:58:39,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:58:39,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:58:39,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:58:39,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:58:39,066 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 61 [2022-12-13 12:58:39,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 68 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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 12:58:39,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:58:39,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 61 [2022-12-13 12:58:39,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:58:43,053 INFO L130 PetriNetUnfolder]: 47660/61383 cut-off events. [2022-12-13 12:58:43,054 INFO L131 PetriNetUnfolder]: For 13454/13457 co-relation queries the response was YES. [2022-12-13 12:58:43,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139562 conditions, 61383 events. 47660/61383 cut-off events. For 13454/13457 co-relation queries the response was YES. Maximal size of possible extension queue 1470. Compared 310410 event pairs, 15231 based on Foata normal form. 1/47109 useless extension candidates. Maximal degree in co-relation 49947. Up to 27089 conditions per place. [2022-12-13 12:58:43,338 INFO L137 encePairwiseOnDemand]: 54/61 looper letters, 121 selfloop transitions, 11 changer transitions 1/147 dead transitions. [2022-12-13 12:58:43,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 147 transitions, 666 flow [2022-12-13 12:58:43,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:58:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:58:43,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-12-13 12:58:43,340 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.75 [2022-12-13 12:58:43,340 INFO L175 Difference]: Start difference. First operand has 64 places, 68 transitions, 191 flow. Second operand 4 states and 183 transitions. [2022-12-13 12:58:43,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 147 transitions, 666 flow [2022-12-13 12:58:43,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 147 transitions, 666 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:58:43,346 INFO L231 Difference]: Finished difference. Result has 69 places, 75 transitions, 270 flow [2022-12-13 12:58:43,347 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=270, PETRI_PLACES=69, PETRI_TRANSITIONS=75} [2022-12-13 12:58:43,347 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, -2 predicate places. [2022-12-13 12:58:43,347 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:58:43,347 INFO L89 Accepts]: Start accepts. Operand has 69 places, 75 transitions, 270 flow [2022-12-13 12:58:43,349 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:58:43,349 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:58:43,349 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 75 transitions, 270 flow [2022-12-13 12:58:43,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 75 transitions, 270 flow [2022-12-13 12:58:43,365 INFO L130 PetriNetUnfolder]: 68/238 cut-off events. [2022-12-13 12:58:43,365 INFO L131 PetriNetUnfolder]: For 65/72 co-relation queries the response was YES. [2022-12-13 12:58:43,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 238 events. 68/238 cut-off events. For 65/72 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1015 event pairs, 0 based on Foata normal form. 0/186 useless extension candidates. Maximal degree in co-relation 332. Up to 26 conditions per place. [2022-12-13 12:58:43,368 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 75 transitions, 270 flow [2022-12-13 12:58:43,368 INFO L226 LiptonReduction]: Number of co-enabled transitions 2434 [2022-12-13 12:58:43,378 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:58:43,379 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-13 12:58:43,379 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 75 transitions, 270 flow [2022-12-13 12:58:43,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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 12:58:43,380 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:58:43,380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:58:43,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:58:43,380 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-13 12:58:43,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:58:43,381 INFO L85 PathProgramCache]: Analyzing trace with hash 68474559, now seen corresponding path program 1 times [2022-12-13 12:58:43,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:58:43,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097650980] [2022-12-13 12:58:43,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:58:43,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:58:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:58:43,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:58:43,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:58:43,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097650980] [2022-12-13 12:58:43,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097650980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:58:43,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:58:43,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:58:43,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039709456] [2022-12-13 12:58:43,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:58:43,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:58:43,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:58:43,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:58:43,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:58:43,625 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 61 [2022-12-13 12:58:43,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 75 transitions, 270 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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 12:58:43,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:58:43,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 61 [2022-12-13 12:58:43,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:58:49,007 INFO L130 PetriNetUnfolder]: 62087/79682 cut-off events. [2022-12-13 12:58:49,007 INFO L131 PetriNetUnfolder]: For 40600/40600 co-relation queries the response was YES. [2022-12-13 12:58:49,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195694 conditions, 79682 events. 62087/79682 cut-off events. For 40600/40600 co-relation queries the response was YES. Maximal size of possible extension queue 1864. Compared 407301 event pairs, 43298 based on Foata normal form. 0/61999 useless extension candidates. Maximal degree in co-relation 81819. Up to 59707 conditions per place. [2022-12-13 12:58:49,379 INFO L137 encePairwiseOnDemand]: 55/61 looper letters, 126 selfloop transitions, 5 changer transitions 0/145 dead transitions. [2022-12-13 12:58:49,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 145 transitions, 761 flow [2022-12-13 12:58:49,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:58:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:58:49,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2022-12-13 12:58:49,381 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5967213114754099 [2022-12-13 12:58:49,381 INFO L175 Difference]: Start difference. First operand has 69 places, 75 transitions, 270 flow. Second operand 5 states and 182 transitions. [2022-12-13 12:58:49,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 145 transitions, 761 flow [2022-12-13 12:58:49,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 145 transitions, 757 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-13 12:58:49,416 INFO L231 Difference]: Finished difference. Result has 76 places, 79 transitions, 316 flow [2022-12-13 12:58:49,416 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=76, PETRI_TRANSITIONS=79} [2022-12-13 12:58:49,416 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 5 predicate places. [2022-12-13 12:58:49,417 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:58:49,417 INFO L89 Accepts]: Start accepts. Operand has 76 places, 79 transitions, 316 flow [2022-12-13 12:58:49,418 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:58:49,419 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:58:49,419 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 79 transitions, 316 flow [2022-12-13 12:58:49,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 79 transitions, 316 flow [2022-12-13 12:58:49,457 INFO L130 PetriNetUnfolder]: 107/504 cut-off events. [2022-12-13 12:58:49,457 INFO L131 PetriNetUnfolder]: For 147/153 co-relation queries the response was YES. [2022-12-13 12:58:49,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 504 events. 107/504 cut-off events. For 147/153 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3001 event pairs, 13 based on Foata normal form. 0/417 useless extension candidates. Maximal degree in co-relation 533. Up to 33 conditions per place. [2022-12-13 12:58:49,464 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 79 transitions, 316 flow [2022-12-13 12:58:49,464 INFO L226 LiptonReduction]: Number of co-enabled transitions 2522 [2022-12-13 12:58:51,786 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:58:51,788 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2371 [2022-12-13 12:58:51,788 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 78 transitions, 313 flow [2022-12-13 12:58:51,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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 12:58:51,789 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:58:51,789 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:58:51,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:58:51,789 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-13 12:58:51,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:58:51,790 INFO L85 PathProgramCache]: Analyzing trace with hash 534493868, now seen corresponding path program 1 times [2022-12-13 12:58:51,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:58:51,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145664714] [2022-12-13 12:58:51,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:58:51,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:58:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:58:52,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:58:52,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:58:52,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145664714] [2022-12-13 12:58:52,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145664714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:58:52,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:58:52,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:58:52,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434891437] [2022-12-13 12:58:52,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:58:52,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:58:52,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:58:52,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:58:52,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:58:52,024 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2022-12-13 12:58:52,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 78 transitions, 313 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 12:58:52,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:58:52,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2022-12-13 12:58:52,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:58:56,616 INFO L130 PetriNetUnfolder]: 52178/66777 cut-off events. [2022-12-13 12:58:56,616 INFO L131 PetriNetUnfolder]: For 38997/38997 co-relation queries the response was YES. [2022-12-13 12:58:56,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169239 conditions, 66777 events. 52178/66777 cut-off events. For 38997/38997 co-relation queries the response was YES. Maximal size of possible extension queue 1619. Compared 330888 event pairs, 36927 based on Foata normal form. 0/57201 useless extension candidates. Maximal degree in co-relation 155405. Up to 59707 conditions per place. [2022-12-13 12:58:56,893 INFO L137 encePairwiseOnDemand]: 58/62 looper letters, 61 selfloop transitions, 0 changer transitions 54/129 dead transitions. [2022-12-13 12:58:56,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 129 transitions, 680 flow [2022-12-13 12:58:56,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:58:56,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:58:56,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2022-12-13 12:58:56,895 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6370967741935484 [2022-12-13 12:58:56,895 INFO L175 Difference]: Start difference. First operand has 75 places, 78 transitions, 313 flow. Second operand 4 states and 158 transitions. [2022-12-13 12:58:56,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 129 transitions, 680 flow [2022-12-13 12:58:56,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 129 transitions, 669 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 12:58:56,916 INFO L231 Difference]: Finished difference. Result has 78 places, 75 transitions, 282 flow [2022-12-13 12:58:56,916 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=282, PETRI_PLACES=78, PETRI_TRANSITIONS=75} [2022-12-13 12:58:56,917 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 7 predicate places. [2022-12-13 12:58:56,917 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:58:56,917 INFO L89 Accepts]: Start accepts. Operand has 78 places, 75 transitions, 282 flow [2022-12-13 12:58:56,923 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:58:56,923 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:58:56,924 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 75 transitions, 282 flow [2022-12-13 12:58:56,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 75 transitions, 282 flow [2022-12-13 12:58:56,974 INFO L130 PetriNetUnfolder]: 112/419 cut-off events. [2022-12-13 12:58:56,974 INFO L131 PetriNetUnfolder]: For 122/124 co-relation queries the response was YES. [2022-12-13 12:58:56,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 419 events. 112/419 cut-off events. For 122/124 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2208 event pairs, 24 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 645. Up to 41 conditions per place. [2022-12-13 12:58:56,980 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 75 transitions, 282 flow [2022-12-13 12:58:56,980 INFO L226 LiptonReduction]: Number of co-enabled transitions 2430 [2022-12-13 12:58:56,981 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:58:56,982 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-13 12:58:56,982 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 282 flow [2022-12-13 12:58:56,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 12:58:56,983 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:58:56,983 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:58:56,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:58:56,983 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-13 12:58:56,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:58:56,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1422378351, now seen corresponding path program 1 times [2022-12-13 12:58:56,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:58:56,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228821640] [2022-12-13 12:58:56,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:58:56,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:58:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:58:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:58:57,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:58:57,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228821640] [2022-12-13 12:58:57,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228821640] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:58:57,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:58:57,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:58:57,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683136053] [2022-12-13 12:58:57,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:58:57,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:58:57,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:58:57,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:58:57,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:58:57,187 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 61 [2022-12-13 12:58:57,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 75 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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 12:58:57,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:58:57,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 61 [2022-12-13 12:58:57,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:59:02,622 INFO L130 PetriNetUnfolder]: 62087/79652 cut-off events. [2022-12-13 12:59:02,622 INFO L131 PetriNetUnfolder]: For 52525/52531 co-relation queries the response was YES. [2022-12-13 12:59:02,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208224 conditions, 79652 events. 62087/79652 cut-off events. For 52525/52531 co-relation queries the response was YES. Maximal size of possible extension queue 1866. Compared 406884 event pairs, 41920 based on Foata normal form. 2474/77649 useless extension candidates. Maximal degree in co-relation 96050. Up to 59707 conditions per place. [2022-12-13 12:59:02,993 INFO L137 encePairwiseOnDemand]: 55/61 looper letters, 126 selfloop transitions, 5 changer transitions 0/145 dead transitions. [2022-12-13 12:59:02,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 145 transitions, 789 flow [2022-12-13 12:59:02,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:59:02,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:59:02,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2022-12-13 12:59:02,994 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5967213114754099 [2022-12-13 12:59:02,994 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 282 flow. Second operand 5 states and 182 transitions. [2022-12-13 12:59:02,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 145 transitions, 789 flow [2022-12-13 12:59:03,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 145 transitions, 773 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-13 12:59:03,037 INFO L231 Difference]: Finished difference. Result has 78 places, 79 transitions, 324 flow [2022-12-13 12:59:03,038 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=78, PETRI_TRANSITIONS=79} [2022-12-13 12:59:03,038 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 7 predicate places. [2022-12-13 12:59:03,038 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:59:03,038 INFO L89 Accepts]: Start accepts. Operand has 78 places, 79 transitions, 324 flow [2022-12-13 12:59:03,039 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:59:03,039 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:59:03,039 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 79 transitions, 324 flow [2022-12-13 12:59:03,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 79 transitions, 324 flow [2022-12-13 12:59:03,069 INFO L130 PetriNetUnfolder]: 155/501 cut-off events. [2022-12-13 12:59:03,069 INFO L131 PetriNetUnfolder]: For 206/224 co-relation queries the response was YES. [2022-12-13 12:59:03,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 889 conditions, 501 events. 155/501 cut-off events. For 206/224 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2840 event pairs, 16 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 618. Up to 47 conditions per place. [2022-12-13 12:59:03,076 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 79 transitions, 324 flow [2022-12-13 12:59:03,077 INFO L226 LiptonReduction]: Number of co-enabled transitions 2520 [2022-12-13 12:59:05,791 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:59:05,794 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2756 [2022-12-13 12:59:05,794 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 78 transitions, 321 flow [2022-12-13 12:59:05,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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 12:59:05,794 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:59:05,794 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:59:05,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:59:05,795 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-13 12:59:05,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:59:05,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1445237168, now seen corresponding path program 1 times [2022-12-13 12:59:05,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:59:05,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751895440] [2022-12-13 12:59:05,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:59:05,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:59:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:59:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:59:06,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:59:06,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751895440] [2022-12-13 12:59:06,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751895440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:59:06,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:59:06,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:59:06,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587585481] [2022-12-13 12:59:06,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:59:06,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:59:06,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:59:06,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:59:06,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:59:06,048 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2022-12-13 12:59:06,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 78 transitions, 321 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 12:59:06,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:59:06,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2022-12-13 12:59:06,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:59:10,945 INFO L130 PetriNetUnfolder]: 52178/66813 cut-off events. [2022-12-13 12:59:10,946 INFO L131 PetriNetUnfolder]: For 54267/54267 co-relation queries the response was YES. [2022-12-13 12:59:11,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180381 conditions, 66813 events. 52178/66813 cut-off events. For 54267/54267 co-relation queries the response was YES. Maximal size of possible extension queue 1618. Compared 331504 event pairs, 36927 based on Foata normal form. 1032/63879 useless extension candidates. Maximal degree in co-relation 166545. Up to 59707 conditions per place. [2022-12-13 12:59:11,250 INFO L137 encePairwiseOnDemand]: 58/62 looper letters, 61 selfloop transitions, 0 changer transitions 54/129 dead transitions. [2022-12-13 12:59:11,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 129 transitions, 688 flow [2022-12-13 12:59:11,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:59:11,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:59:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2022-12-13 12:59:11,252 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6370967741935484 [2022-12-13 12:59:11,252 INFO L175 Difference]: Start difference. First operand has 77 places, 78 transitions, 321 flow. Second operand 4 states and 158 transitions. [2022-12-13 12:59:11,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 129 transitions, 688 flow [2022-12-13 12:59:11,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 129 transitions, 673 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-13 12:59:11,281 INFO L231 Difference]: Finished difference. Result has 79 places, 75 transitions, 286 flow [2022-12-13 12:59:11,281 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=286, PETRI_PLACES=79, PETRI_TRANSITIONS=75} [2022-12-13 12:59:11,281 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 8 predicate places. [2022-12-13 12:59:11,281 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:59:11,281 INFO L89 Accepts]: Start accepts. Operand has 79 places, 75 transitions, 286 flow [2022-12-13 12:59:11,282 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:59:11,283 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:59:11,283 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 75 transitions, 286 flow [2022-12-13 12:59:11,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 75 transitions, 286 flow [2022-12-13 12:59:11,307 INFO L130 PetriNetUnfolder]: 112/419 cut-off events. [2022-12-13 12:59:11,307 INFO L131 PetriNetUnfolder]: For 142/160 co-relation queries the response was YES. [2022-12-13 12:59:11,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 419 events. 112/419 cut-off events. For 142/160 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2223 event pairs, 24 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 670. Up to 41 conditions per place. [2022-12-13 12:59:11,311 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 75 transitions, 286 flow [2022-12-13 12:59:11,311 INFO L226 LiptonReduction]: Number of co-enabled transitions 2430 [2022-12-13 12:59:11,312 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:59:11,313 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-13 12:59:11,313 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 75 transitions, 286 flow [2022-12-13 12:59:11,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 12:59:11,313 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:59:11,313 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:59:11,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:59:11,313 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-13 12:59:11,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:59:11,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1794543537, now seen corresponding path program 1 times [2022-12-13 12:59:11,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:59:11,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152069089] [2022-12-13 12:59:11,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:59:11,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:59:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:59:11,425 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 12:59:11,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:59:11,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152069089] [2022-12-13 12:59:11,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152069089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:59:11,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:59:11,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:59:11,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866236338] [2022-12-13 12:59:11,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:59:11,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:59:11,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:59:11,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:59:11,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:59:11,427 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 61 [2022-12-13 12:59:11,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 75 transitions, 286 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states 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 12:59:11,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:59:11,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 61 [2022-12-13 12:59:11,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:59:14,438 INFO L130 PetriNetUnfolder]: 35330/44980 cut-off events. [2022-12-13 12:59:14,438 INFO L131 PetriNetUnfolder]: For 42108/42108 co-relation queries the response was YES. [2022-12-13 12:59:14,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127626 conditions, 44980 events. 35330/44980 cut-off events. For 42108/42108 co-relation queries the response was YES. Maximal size of possible extension queue 1088. Compared 208462 event pairs, 21149 based on Foata normal form. 1260/44224 useless extension candidates. Maximal degree in co-relation 74376. Up to 40392 conditions per place. [2022-12-13 12:59:14,636 INFO L137 encePairwiseOnDemand]: 55/61 looper letters, 86 selfloop transitions, 5 changer transitions 0/105 dead transitions. [2022-12-13 12:59:14,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 105 transitions, 585 flow [2022-12-13 12:59:14,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:59:14,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:59:14,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-12-13 12:59:14,637 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5368852459016393 [2022-12-13 12:59:14,637 INFO L175 Difference]: Start difference. First operand has 74 places, 75 transitions, 286 flow. Second operand 4 states and 131 transitions. [2022-12-13 12:59:14,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 105 transitions, 585 flow [2022-12-13 12:59:14,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 105 transitions, 563 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 12:59:14,678 INFO L231 Difference]: Finished difference. Result has 75 places, 77 transitions, 300 flow [2022-12-13 12:59:14,678 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=300, PETRI_PLACES=75, PETRI_TRANSITIONS=77} [2022-12-13 12:59:14,679 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 4 predicate places. [2022-12-13 12:59:14,679 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:59:14,679 INFO L89 Accepts]: Start accepts. Operand has 75 places, 77 transitions, 300 flow [2022-12-13 12:59:14,682 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:59:14,682 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:59:14,682 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 77 transitions, 300 flow [2022-12-13 12:59:14,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 77 transitions, 300 flow [2022-12-13 12:59:14,738 INFO L130 PetriNetUnfolder]: 117/410 cut-off events. [2022-12-13 12:59:14,740 INFO L131 PetriNetUnfolder]: For 148/167 co-relation queries the response was YES. [2022-12-13 12:59:14,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 410 events. 117/410 cut-off events. For 148/167 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2091 event pairs, 22 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 702. Up to 51 conditions per place. [2022-12-13 12:59:14,745 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 77 transitions, 300 flow [2022-12-13 12:59:14,745 INFO L226 LiptonReduction]: Number of co-enabled transitions 2520 [2022-12-13 12:59:14,746 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:59:14,759 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-13 12:59:14,759 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 77 transitions, 300 flow [2022-12-13 12:59:14,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states 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 12:59:14,759 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:59:14,759 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:59:14,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:59:14,760 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-13 12:59:14,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:59:14,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1040941797, now seen corresponding path program 1 times [2022-12-13 12:59:14,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:59:14,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566535908] [2022-12-13 12:59:14,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:59:14,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:59:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:59:14,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:59:14,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:59:14,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566535908] [2022-12-13 12:59:14,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566535908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:59:14,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:59:14,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:59:14,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502169221] [2022-12-13 12:59:14,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:59:14,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:59:14,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:59:14,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:59:14,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:59:14,887 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 61 [2022-12-13 12:59:14,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 77 transitions, 300 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states 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 12:59:14,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:59:14,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 61 [2022-12-13 12:59:14,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:59:17,098 INFO L130 PetriNetUnfolder]: 26312/33215 cut-off events. [2022-12-13 12:59:17,098 INFO L131 PetriNetUnfolder]: For 33558/33558 co-relation queries the response was YES. [2022-12-13 12:59:17,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100242 conditions, 33215 events. 26312/33215 cut-off events. For 33558/33558 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 144979 event pairs, 13540 based on Foata normal form. 876/32643 useless extension candidates. Maximal degree in co-relation 38648. Up to 30156 conditions per place. [2022-12-13 12:59:17,241 INFO L137 encePairwiseOnDemand]: 55/61 looper letters, 90 selfloop transitions, 5 changer transitions 0/109 dead transitions. [2022-12-13 12:59:17,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 109 transitions, 622 flow [2022-12-13 12:59:17,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:59:17,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:59:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-12-13 12:59:17,243 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5368852459016393 [2022-12-13 12:59:17,243 INFO L175 Difference]: Start difference. First operand has 75 places, 77 transitions, 300 flow. Second operand 4 states and 131 transitions. [2022-12-13 12:59:17,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 109 transitions, 622 flow [2022-12-13 12:59:17,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 109 transitions, 593 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-13 12:59:17,291 INFO L231 Difference]: Finished difference. Result has 76 places, 79 transitions, 312 flow [2022-12-13 12:59:17,291 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=312, PETRI_PLACES=76, PETRI_TRANSITIONS=79} [2022-12-13 12:59:17,293 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 5 predicate places. [2022-12-13 12:59:17,293 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:59:17,293 INFO L89 Accepts]: Start accepts. Operand has 76 places, 79 transitions, 312 flow [2022-12-13 12:59:17,296 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:59:17,298 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:59:17,299 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 79 transitions, 312 flow [2022-12-13 12:59:17,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 79 transitions, 312 flow [2022-12-13 12:59:17,325 INFO L130 PetriNetUnfolder]: 152/438 cut-off events. [2022-12-13 12:59:17,325 INFO L131 PetriNetUnfolder]: For 176/217 co-relation queries the response was YES. [2022-12-13 12:59:17,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 438 events. 152/438 cut-off events. For 176/217 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2089 event pairs, 29 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 839. Up to 111 conditions per place. [2022-12-13 12:59:17,353 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 79 transitions, 312 flow [2022-12-13 12:59:17,353 INFO L226 LiptonReduction]: Number of co-enabled transitions 2606 [2022-12-13 12:59:17,355 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:59:17,355 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-13 12:59:17,355 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 79 transitions, 312 flow [2022-12-13 12:59:17,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states 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 12:59:17,356 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:59:17,356 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, 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 12:59:17,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:59:17,356 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-13 12:59:17,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:59:17,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1508768819, now seen corresponding path program 1 times [2022-12-13 12:59:17,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:59:17,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537042880] [2022-12-13 12:59:17,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:59:17,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:59:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:59:18,283 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 12:59:18,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:59:18,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537042880] [2022-12-13 12:59:18,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537042880] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:59:18,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155394480] [2022-12-13 12:59:18,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:59:18,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:59:18,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:59:18,305 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 12:59:18,310 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 12:59:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:59:18,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 12:59:18,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:59:18,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:59:18,715 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 16 treesize of output 18 [2022-12-13 12:59:18,744 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 12:59:18,783 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 12:59:18,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:59:18,981 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:59:18,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 34 [2022-12-13 12:59:18,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2022-12-13 12:59:19,126 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 12:59:19,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155394480] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:59:19,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:59:19,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-12-13 12:59:19,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70812631] [2022-12-13 12:59:19,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:59:19,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 12:59:19,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:59:19,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 12:59:19,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=559, Unknown=14, NotChecked=0, Total=650 [2022-12-13 12:59:19,128 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 61 [2022-12-13 12:59:19,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 79 transitions, 312 flow. Second operand has 26 states, 26 states have (on average 9.384615384615385) internal successors, (244), 26 states have internal predecessors, (244), 0 states have call successors, (0), 0 states 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 12:59:19,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:59:19,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 61 [2022-12-13 12:59:19,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:59:28,243 INFO L130 PetriNetUnfolder]: 76509/96744 cut-off events. [2022-12-13 12:59:28,244 INFO L131 PetriNetUnfolder]: For 76791/76791 co-relation queries the response was YES. [2022-12-13 12:59:28,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284681 conditions, 96744 events. 76509/96744 cut-off events. For 76791/76791 co-relation queries the response was YES. Maximal size of possible extension queue 1822. Compared 476699 event pairs, 18630 based on Foata normal form. 1/86908 useless extension candidates. Maximal degree in co-relation 100767. Up to 45054 conditions per place. [2022-12-13 12:59:28,738 INFO L137 encePairwiseOnDemand]: 46/61 looper letters, 460 selfloop transitions, 95 changer transitions 1/562 dead transitions. [2022-12-13 12:59:28,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 562 transitions, 3057 flow [2022-12-13 12:59:28,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 12:59:28,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 12:59:28,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 641 transitions. [2022-12-13 12:59:28,740 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5003903200624512 [2022-12-13 12:59:28,740 INFO L175 Difference]: Start difference. First operand has 76 places, 79 transitions, 312 flow. Second operand 21 states and 641 transitions. [2022-12-13 12:59:28,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 562 transitions, 3057 flow [2022-12-13 12:59:28,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 562 transitions, 2981 flow, removed 32 selfloop flow, removed 3 redundant places. [2022-12-13 12:59:28,881 INFO L231 Difference]: Finished difference. Result has 106 places, 183 transitions, 1144 flow [2022-12-13 12:59:28,881 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1144, PETRI_PLACES=106, PETRI_TRANSITIONS=183} [2022-12-13 12:59:28,882 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 35 predicate places. [2022-12-13 12:59:28,882 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:59:28,882 INFO L89 Accepts]: Start accepts. Operand has 106 places, 183 transitions, 1144 flow [2022-12-13 12:59:28,883 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:59:28,884 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:59:28,884 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 183 transitions, 1144 flow [2022-12-13 12:59:28,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 183 transitions, 1144 flow [2022-12-13 12:59:29,174 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1131] L74-->L71: Formula: (and (= (ite (< v_~i_3~0_145 v_~n_1~0_149) 1 0) |v_thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_35|) (= |v_thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1_35| |v_thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_35|) (not (= |v_thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1_35| 0)) (= (select (select |v_#memory_int_143| v_~X_0~0.base_89) (+ (* v_~i_3~0_144 4) v_~X_0~0.offset_89)) v_~t_5~0_47) (= v_~i_3~0_144 (+ v_~i_3~0_145 1)) (not (= (mod |v_thread3Thread1of1ForFork4_#t~nondet5#1_30| 256) 0))) InVars {~i_3~0=v_~i_3~0_145, thread3Thread1of1ForFork4_#t~nondet5#1=|v_thread3Thread1of1ForFork4_#t~nondet5#1_30|, ~n_1~0=v_~n_1~0_149, #memory_int=|v_#memory_int_143|, ~X_0~0.offset=v_~X_0~0.offset_89, ~X_0~0.base=v_~X_0~0.base_89} OutVars{~i_3~0=v_~i_3~0_144, ~n_1~0=v_~n_1~0_149, #memory_int=|v_#memory_int_143|, thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1_35|, thread3Thread1of1ForFork4_#t~mem7#1=|v_thread3Thread1of1ForFork4_#t~mem7#1_17|, ~X_0~0.offset=v_~X_0~0.offset_89, ~t_5~0=v_~t_5~0_47, thread3Thread1of1ForFork4_#t~post6#1=|v_thread3Thread1of1ForFork4_#t~post6#1_17|, ~X_0~0.base=v_~X_0~0.base_89, thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_35|} AuxVars[] AssignedVars[~i_3~0, thread3Thread1of1ForFork4_#t~nondet5#1, thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork4_#t~mem7#1, ~t_5~0, thread3Thread1of1ForFork4_#t~post6#1, thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1][91], [113#thread2EXITtrue, Black: 257#(and (= ~s_6~0 ~s_2~0) (= ~s_6~0 0)), Black: 265#(and (= ~s_6~0 ~s_2~0) (= ~s_2~0 0)), Black: 262#(= ~s_2~0 0), 260#true, 647#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 128#L169-4true, 9#L92-4true, 191#L144-3true, 108#L71true, 254#(= ~s_6~0 0), Black: 649#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~i_3~0 0) (= ~s_2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 675#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~s_2~0 ~t_8~0) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 671#(and (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~t_4~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 661#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 10#L105true, Black: 683#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 679#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 657#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_2~0 0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 667#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~i_7~0 0) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 681#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~s_2~0 ~t_8~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 307#(and (= ~i_7~0 0) (<= 1 ~n_1~0)), Black: 677#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~s_2~0 ~t_8~0) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 659#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 669#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~i_7~0 0) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 663#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_2~0 0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 312#(and (= ~i_3~0 0) (<= 1 ~n_1~0))]) [2022-12-13 12:59:29,175 INFO L382 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 12:59:29,175 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 12:59:29,175 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 12:59:29,175 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 12:59:29,178 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1076] L56-->L53: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet1#1_24| 256) 0)) (= v_~t_4~0_29 (select (select |v_#memory_int_99| v_~X_0~0.base_63) (+ v_~X_0~0.offset_63 (* v_~i_3~0_110 4)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|) (= v_~i_3~0_110 (+ v_~i_3~0_111 1)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite (< v_~i_3~0_111 v_~n_1~0_105) 1 0))) InVars {~i_3~0=v_~i_3~0_111, thread2Thread1of1ForFork2_#t~nondet1#1=|v_thread2Thread1of1ForFork2_#t~nondet1#1_24|, ~n_1~0=v_~n_1~0_105, #memory_int=|v_#memory_int_99|, ~X_0~0.offset=v_~X_0~0.offset_63, ~X_0~0.base=v_~X_0~0.base_63} OutVars{~i_3~0=v_~i_3~0_110, ~t_4~0=v_~t_4~0_29, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, ~n_1~0=v_~n_1~0_105, thread2Thread1of1ForFork2_#t~mem3#1=|v_thread2Thread1of1ForFork2_#t~mem3#1_11|, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_11|, #memory_int=|v_#memory_int_99|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, ~X_0~0.offset=v_~X_0~0.offset_63, ~X_0~0.base=v_~X_0~0.base_63} AuxVars[] AssignedVars[~i_3~0, thread2Thread1of1ForFork2_#t~nondet1#1, ~t_4~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem3#1, thread2Thread1of1ForFork2_#t~post2#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][59], [Black: 257#(and (= ~s_6~0 ~s_2~0) (= ~s_6~0 0)), Black: 254#(= ~s_6~0 0), Black: 265#(and (= ~s_6~0 ~s_2~0) (= ~s_2~0 0)), 134#thread3EXITtrue, Black: 262#(= ~s_2~0 0), 260#true, 647#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 128#L169-4true, 222#L108true, 9#L92-4true, 122#L53true, 191#L144-3true, 252#true, Black: 649#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~i_3~0 0) (= ~s_2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 675#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~s_2~0 ~t_8~0) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 671#(and (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~t_4~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 661#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 683#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 679#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 657#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_2~0 0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 667#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~i_7~0 0) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 681#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~s_2~0 ~t_8~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 307#(and (= ~i_7~0 0) (<= 1 ~n_1~0)), Black: 677#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~s_2~0 ~t_8~0) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 659#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 669#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~i_7~0 0) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 663#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_2~0 0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 312#(and (= ~i_3~0 0) (<= 1 ~n_1~0))]) [2022-12-13 12:59:29,178 INFO L382 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-12-13 12:59:29,178 INFO L385 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 12:59:29,178 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 12:59:29,178 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 12:59:29,181 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1131] L74-->L71: Formula: (and (= (ite (< v_~i_3~0_145 v_~n_1~0_149) 1 0) |v_thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_35|) (= |v_thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1_35| |v_thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_35|) (not (= |v_thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1_35| 0)) (= (select (select |v_#memory_int_143| v_~X_0~0.base_89) (+ (* v_~i_3~0_144 4) v_~X_0~0.offset_89)) v_~t_5~0_47) (= v_~i_3~0_144 (+ v_~i_3~0_145 1)) (not (= (mod |v_thread3Thread1of1ForFork4_#t~nondet5#1_30| 256) 0))) InVars {~i_3~0=v_~i_3~0_145, thread3Thread1of1ForFork4_#t~nondet5#1=|v_thread3Thread1of1ForFork4_#t~nondet5#1_30|, ~n_1~0=v_~n_1~0_149, #memory_int=|v_#memory_int_143|, ~X_0~0.offset=v_~X_0~0.offset_89, ~X_0~0.base=v_~X_0~0.base_89} OutVars{~i_3~0=v_~i_3~0_144, ~n_1~0=v_~n_1~0_149, #memory_int=|v_#memory_int_143|, thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1_35|, thread3Thread1of1ForFork4_#t~mem7#1=|v_thread3Thread1of1ForFork4_#t~mem7#1_17|, ~X_0~0.offset=v_~X_0~0.offset_89, ~t_5~0=v_~t_5~0_47, thread3Thread1of1ForFork4_#t~post6#1=|v_thread3Thread1of1ForFork4_#t~post6#1_17|, ~X_0~0.base=v_~X_0~0.base_89, thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_35|} AuxVars[] AssignedVars[~i_3~0, thread3Thread1of1ForFork4_#t~nondet5#1, thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork4_#t~mem7#1, ~t_5~0, thread3Thread1of1ForFork4_#t~post6#1, thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1][91], [113#thread2EXITtrue, Black: 257#(and (= ~s_6~0 ~s_2~0) (= ~s_6~0 0)), Black: 254#(= ~s_6~0 0), Black: 265#(and (= ~s_6~0 ~s_2~0) (= ~s_2~0 0)), Black: 262#(= ~s_2~0 0), 260#true, 647#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 128#L169-4true, 222#L108true, 9#L92-4true, 191#L144-3true, 108#L71true, Black: 649#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~i_3~0 0) (= ~s_2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 252#true, Black: 675#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~s_2~0 ~t_8~0) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 671#(and (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~t_4~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 661#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 683#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 679#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 657#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_2~0 0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 667#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~i_7~0 0) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 307#(and (= ~i_7~0 0) (<= 1 ~n_1~0)), Black: 681#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~s_2~0 ~t_8~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 677#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~s_2~0 ~t_8~0) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 659#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 669#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~i_7~0 0) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 663#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_2~0 0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 312#(and (= ~i_3~0 0) (<= 1 ~n_1~0))]) [2022-12-13 12:59:29,181 INFO L382 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-12-13 12:59:29,181 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 12:59:29,181 INFO L385 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 12:59:29,181 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 12:59:29,191 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1169] L126-->thread6EXIT: Formula: (and (not (= 0 |v_thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1_Out_2|)) (= |v_thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_Out_2| |v_thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1_Out_2|) (= (mod |v_thread6Thread1of1ForFork3_#t~nondet19#1_In_1| 256) 0) (= 0 |v_thread6Thread1of1ForFork3_#res#1.base_Out_2|) (= |v_thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_Out_2| (ite (not (< v_~i_7~0_In_3 v_~n_1~0_In_5)) 1 0)) (= |v_thread6Thread1of1ForFork3_#res#1.offset_Out_2| 0)) InVars {~n_1~0=v_~n_1~0_In_5, thread6Thread1of1ForFork3_#t~nondet19#1=|v_thread6Thread1of1ForFork3_#t~nondet19#1_In_1|, ~i_7~0=v_~i_7~0_In_3} OutVars{thread6Thread1of1ForFork3_#res#1.base=|v_thread6Thread1of1ForFork3_#res#1.base_Out_2|, thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1_Out_2|, ~n_1~0=v_~n_1~0_In_5, thread6Thread1of1ForFork3_#res#1.offset=|v_thread6Thread1of1ForFork3_#res#1.offset_Out_2|, thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_Out_2|, ~i_7~0=v_~i_7~0_In_3} AuxVars[] AssignedVars[thread6Thread1of1ForFork3_#res#1.base, thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork3_#t~nondet19#1, thread6Thread1of1ForFork3_#res#1.offset, thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][144], [201#L92-3true, Black: 257#(and (= ~s_6~0 ~s_2~0) (= ~s_6~0 0)), Black: 254#(= ~s_6~0 0), 102#L144-4true, Black: 265#(and (= ~s_6~0 ~s_2~0) (= ~s_2~0 0)), Black: 262#(= ~s_2~0 0), 260#true, 647#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 128#L169-4true, 122#L53true, Black: 649#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~i_3~0 0) (= ~s_2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 252#true, Black: 675#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~s_2~0 ~t_8~0) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 671#(and (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~t_4~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 661#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 683#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 57#thread5EXITtrue, Black: 679#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 657#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_2~0 0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 667#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~i_7~0 0) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 307#(and (= ~i_7~0 0) (<= 1 ~n_1~0)), Black: 681#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~s_2~0 ~t_8~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 677#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~s_2~0 ~t_8~0) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 659#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 669#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~i_7~0 0) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 663#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_2~0 0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 312#(and (= ~i_3~0 0) (<= 1 ~n_1~0)), 11#thread6EXITtrue]) [2022-12-13 12:59:29,191 INFO L382 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-13 12:59:29,191 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 12:59:29,191 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 12:59:29,191 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 12:59:29,192 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1108] L126-->L123: Formula: (and (not (= |v_thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1_35| 0)) (not (= (mod |v_thread6Thread1of1ForFork3_#t~nondet19#1_34| 256) 0)) (= (ite (< v_~i_7~0_127 v_~n_1~0_125) 1 0) |v_thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_35|) (= (select (select |v_#memory_int_123| v_~X_0~0.base_73) (+ (* v_~i_7~0_126 4) v_~X_0~0.offset_73)) v_~t_9~0_37) (= |v_thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1_35| |v_thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_35|) (= v_~i_7~0_126 (+ v_~i_7~0_127 1))) InVars {~n_1~0=v_~n_1~0_125, thread6Thread1of1ForFork3_#t~nondet19#1=|v_thread6Thread1of1ForFork3_#t~nondet19#1_34|, #memory_int=|v_#memory_int_123|, ~X_0~0.offset=v_~X_0~0.offset_73, ~X_0~0.base=v_~X_0~0.base_73, ~i_7~0=v_~i_7~0_127} OutVars{thread6Thread1of1ForFork3_#t~mem21#1=|v_thread6Thread1of1ForFork3_#t~mem21#1_15|, thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1_35|, ~n_1~0=v_~n_1~0_125, ~t_9~0=v_~t_9~0_37, #memory_int=|v_#memory_int_123|, ~X_0~0.offset=v_~X_0~0.offset_73, ~X_0~0.base=v_~X_0~0.base_73, thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_35|, thread6Thread1of1ForFork3_#t~post20#1=|v_thread6Thread1of1ForFork3_#t~post20#1_15|, ~i_7~0=v_~i_7~0_126} AuxVars[] AssignedVars[thread6Thread1of1ForFork3_#t~mem21#1, thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~t_9~0, thread6Thread1of1ForFork3_#t~nondet19#1, thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread6Thread1of1ForFork3_#t~post20#1, ~i_7~0][145], [201#L92-3true, Black: 257#(and (= ~s_6~0 ~s_2~0) (= ~s_6~0 0)), Black: 254#(= ~s_6~0 0), 102#L144-4true, Black: 265#(and (= ~s_6~0 ~s_2~0) (= ~s_2~0 0)), Black: 262#(= ~s_2~0 0), 260#true, 647#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 128#L169-4true, 122#L53true, 80#L123true, Black: 649#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~i_3~0 0) (= ~s_2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 252#true, Black: 675#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~s_2~0 ~t_8~0) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 671#(and (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~t_4~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 661#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 683#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 57#thread5EXITtrue, Black: 679#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 657#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_2~0 0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 667#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~i_7~0 0) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 307#(and (= ~i_7~0 0) (<= 1 ~n_1~0)), Black: 681#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~s_2~0 ~t_8~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 677#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~s_2~0 ~t_8~0) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 659#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 669#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~i_7~0 0) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 663#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_2~0 0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 312#(and (= ~i_3~0 0) (<= 1 ~n_1~0))]) [2022-12-13 12:59:29,192 INFO L382 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-13 12:59:29,199 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 12:59:29,199 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 12:59:29,199 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 12:59:29,216 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([950] L105-->L108: Formula: (let ((.cse0 (+ |v_thread5Thread1of1ForFork1_plus_~a#1_1| |v_thread5Thread1of1ForFork1_plus_~b#1_1|))) (and (= |v_thread5Thread1of1ForFork1_plus_~a#1_1| |v_thread5Thread1of1ForFork1_plus_#in~a#1_1|) (<= |v_thread5Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= 0 (+ |v_thread5Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (= |v_thread5Thread1of1ForFork1_plus_#in~a#1_1| v_~s_6~0_42) (= |v_thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (or (<= |v_thread5Thread1of1ForFork1_plus_~b#1_1| 0) (<= .cse0 2147483647)) 1 0)) (= |v_thread5Thread1of1ForFork1_plus_#res#1_1| v_~s_6~0_41) (= |v_thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= |v_thread5Thread1of1ForFork1_plus_~b#1_1| |v_thread5Thread1of1ForFork1_plus_#in~b#1_1|) (= |v_thread5Thread1of1ForFork1_plus_#res#1_1| .cse0) (not (= (ite (or (<= 0 |v_thread5Thread1of1ForFork1_plus_~b#1_1|) (<= 0 (+ |v_thread5Thread1of1ForFork1_plus_~a#1_1| |v_thread5Thread1of1ForFork1_plus_~b#1_1| 2147483648))) 1 0) 0)) (not (= |v_thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread5Thread1of1ForFork1_plus_#in~b#1_1| v_~t_8~0_27))) InVars {~s_6~0=v_~s_6~0_42, ~t_8~0=v_~t_8~0_27} OutVars{~s_6~0=v_~s_6~0_41, thread5Thread1of1ForFork1_plus_#res#1=|v_thread5Thread1of1ForFork1_plus_#res#1_1|, thread5Thread1of1ForFork1_plus_~a#1=|v_thread5Thread1of1ForFork1_plus_~a#1_1|, thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread5Thread1of1ForFork1_plus_~b#1=|v_thread5Thread1of1ForFork1_plus_~b#1_1|, ~t_8~0=v_~t_8~0_27, thread5Thread1of1ForFork1_plus_#in~a#1=|v_thread5Thread1of1ForFork1_plus_#in~a#1_1|, thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread5Thread1of1ForFork1_#t~ret18#1=|v_thread5Thread1of1ForFork1_#t~ret18#1_1|, thread5Thread1of1ForFork1_plus_#in~b#1=|v_thread5Thread1of1ForFork1_plus_#in~b#1_1|} AuxVars[] AssignedVars[~s_6~0, thread5Thread1of1ForFork1_plus_#res#1, thread5Thread1of1ForFork1_plus_~a#1, thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork1_plus_~b#1, thread5Thread1of1ForFork1_plus_#in~a#1, thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread5Thread1of1ForFork1_#t~ret18#1, thread5Thread1of1ForFork1_plus_#in~b#1][126], [Black: 257#(and (= ~s_6~0 ~s_2~0) (= ~s_6~0 0)), Black: 254#(= ~s_6~0 0), 102#L144-4true, Black: 265#(and (= ~s_6~0 ~s_2~0) (= ~s_2~0 0)), Black: 262#(= ~s_2~0 0), 260#true, 647#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 128#L169-4true, 222#L108true, 9#L92-4true, 122#L53true, 108#L71true, Black: 649#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~i_3~0 0) (= ~s_2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 252#true, Black: 675#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~s_2~0 ~t_8~0) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 671#(and (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~t_4~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 661#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 683#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 679#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 657#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_2~0 0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 667#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~i_7~0 0) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 307#(and (= ~i_7~0 0) (<= 1 ~n_1~0)), Black: 681#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~s_2~0 ~t_8~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 677#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~s_2~0 ~t_8~0) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 659#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 669#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_6~0 0) (= ~i_7~0 0) (= (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset 4)) ~s_2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 663#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 4) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (= ~s_2~0 0) (not (<= (+ ~X_0~0.offset (* ~i_3~0 4)) 3)) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |#StackHeapBarrier|) (<= (+ 2 ~X_0~0.base) |thread4Thread1of1ForFork0_~#t5~0.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 312#(and (= ~i_3~0 0) (<= 1 ~n_1~0)), 123#L126true]) [2022-12-13 12:59:29,216 INFO L382 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 12:59:29,216 INFO L385 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 12:59:29,216 INFO L385 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 12:59:29,216 INFO L385 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 12:59:29,236 INFO L130 PetriNetUnfolder]: 1212/2574 cut-off events. [2022-12-13 12:59:29,236 INFO L131 PetriNetUnfolder]: For 5203/5448 co-relation queries the response was YES. [2022-12-13 12:59:29,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7097 conditions, 2574 events. 1212/2574 cut-off events. For 5203/5448 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 18000 event pairs, 177 based on Foata normal form. 24/1994 useless extension candidates. Maximal degree in co-relation 7017. Up to 590 conditions per place. [2022-12-13 12:59:29,268 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 183 transitions, 1144 flow [2022-12-13 12:59:29,268 INFO L226 LiptonReduction]: Number of co-enabled transitions 5530 [2022-12-13 12:59:29,553 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1113] L108-->L105: Formula: (and (not (= |v_thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1_33| 0)) (= (select (select |v_#memory_int_129| v_~X_0~0.base_77) (+ v_~X_0~0.offset_77 (* v_~i_7~0_134 4))) v_~t_8~0_51) (= |v_thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33| |v_thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1_33|) (not (= (mod |v_thread5Thread1of1ForFork1_#t~nondet15#1_32| 256) 0)) (= (ite (< v_~i_7~0_135 v_~n_1~0_131) 1 0) |v_thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33|) (= v_~i_7~0_134 (+ v_~i_7~0_135 1))) InVars {~n_1~0=v_~n_1~0_131, #memory_int=|v_#memory_int_129|, thread5Thread1of1ForFork1_#t~nondet15#1=|v_thread5Thread1of1ForFork1_#t~nondet15#1_32|, ~X_0~0.offset=v_~X_0~0.offset_77, ~X_0~0.base=v_~X_0~0.base_77, ~i_7~0=v_~i_7~0_135} OutVars{thread5Thread1of1ForFork1_#t~mem17#1=|v_thread5Thread1of1ForFork1_#t~mem17#1_13|, thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33|, ~n_1~0=v_~n_1~0_131, thread5Thread1of1ForFork1_#t~post16#1=|v_thread5Thread1of1ForFork1_#t~post16#1_13|, #memory_int=|v_#memory_int_129|, ~t_8~0=v_~t_8~0_51, ~X_0~0.offset=v_~X_0~0.offset_77, ~X_0~0.base=v_~X_0~0.base_77, thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1_33|, ~i_7~0=v_~i_7~0_134} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#t~mem17#1, thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork1_#t~post16#1, ~t_8~0, thread5Thread1of1ForFork1_#t~nondet15#1, thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~i_7~0] and [926] L144-2-->L144-3: Formula: (= |v_#memory_int_12| (store |v_#memory_int_13| |v_thread4Thread1of1ForFork0_~#t6~0.base_3| (store (select |v_#memory_int_13| |v_thread4Thread1of1ForFork0_~#t6~0.base_3|) |v_thread4Thread1of1ForFork0_~#t6~0.offset_3| |v_thread4Thread1of1ForFork0_#t~pre25_3|))) InVars {#memory_int=|v_#memory_int_13|, thread4Thread1of1ForFork0_~#t6~0.base=|v_thread4Thread1of1ForFork0_~#t6~0.base_3|, thread4Thread1of1ForFork0_#t~pre25=|v_thread4Thread1of1ForFork0_#t~pre25_3|, thread4Thread1of1ForFork0_~#t6~0.offset=|v_thread4Thread1of1ForFork0_~#t6~0.offset_3|} OutVars{#memory_int=|v_#memory_int_12|, thread4Thread1of1ForFork0_~#t6~0.base=|v_thread4Thread1of1ForFork0_~#t6~0.base_3|, thread4Thread1of1ForFork0_#t~pre25=|v_thread4Thread1of1ForFork0_#t~pre25_3|, thread4Thread1of1ForFork0_~#t6~0.offset=|v_thread4Thread1of1ForFork0_~#t6~0.offset_3|} AuxVars[] AssignedVars[#memory_int] [2022-12-13 12:59:29,592 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1113] L108-->L105: Formula: (and (not (= |v_thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1_33| 0)) (= (select (select |v_#memory_int_129| v_~X_0~0.base_77) (+ v_~X_0~0.offset_77 (* v_~i_7~0_134 4))) v_~t_8~0_51) (= |v_thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33| |v_thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1_33|) (not (= (mod |v_thread5Thread1of1ForFork1_#t~nondet15#1_32| 256) 0)) (= (ite (< v_~i_7~0_135 v_~n_1~0_131) 1 0) |v_thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33|) (= v_~i_7~0_134 (+ v_~i_7~0_135 1))) InVars {~n_1~0=v_~n_1~0_131, #memory_int=|v_#memory_int_129|, thread5Thread1of1ForFork1_#t~nondet15#1=|v_thread5Thread1of1ForFork1_#t~nondet15#1_32|, ~X_0~0.offset=v_~X_0~0.offset_77, ~X_0~0.base=v_~X_0~0.base_77, ~i_7~0=v_~i_7~0_135} OutVars{thread5Thread1of1ForFork1_#t~mem17#1=|v_thread5Thread1of1ForFork1_#t~mem17#1_13|, thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33|, ~n_1~0=v_~n_1~0_131, thread5Thread1of1ForFork1_#t~post16#1=|v_thread5Thread1of1ForFork1_#t~post16#1_13|, #memory_int=|v_#memory_int_129|, ~t_8~0=v_~t_8~0_51, ~X_0~0.offset=v_~X_0~0.offset_77, ~X_0~0.base=v_~X_0~0.base_77, thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1_33|, ~i_7~0=v_~i_7~0_134} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#t~mem17#1, thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork1_#t~post16#1, ~t_8~0, thread5Thread1of1ForFork1_#t~nondet15#1, thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~i_7~0] and [1131] L74-->L71: Formula: (and (= (ite (< v_~i_3~0_145 v_~n_1~0_149) 1 0) |v_thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_35|) (= |v_thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1_35| |v_thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_35|) (not (= |v_thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1_35| 0)) (= (select (select |v_#memory_int_143| v_~X_0~0.base_89) (+ (* v_~i_3~0_144 4) v_~X_0~0.offset_89)) v_~t_5~0_47) (= v_~i_3~0_144 (+ v_~i_3~0_145 1)) (not (= (mod |v_thread3Thread1of1ForFork4_#t~nondet5#1_30| 256) 0))) InVars {~i_3~0=v_~i_3~0_145, thread3Thread1of1ForFork4_#t~nondet5#1=|v_thread3Thread1of1ForFork4_#t~nondet5#1_30|, ~n_1~0=v_~n_1~0_149, #memory_int=|v_#memory_int_143|, ~X_0~0.offset=v_~X_0~0.offset_89, ~X_0~0.base=v_~X_0~0.base_89} OutVars{~i_3~0=v_~i_3~0_144, ~n_1~0=v_~n_1~0_149, #memory_int=|v_#memory_int_143|, thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1_35|, thread3Thread1of1ForFork4_#t~mem7#1=|v_thread3Thread1of1ForFork4_#t~mem7#1_17|, ~X_0~0.offset=v_~X_0~0.offset_89, ~t_5~0=v_~t_5~0_47, thread3Thread1of1ForFork4_#t~post6#1=|v_thread3Thread1of1ForFork4_#t~post6#1_17|, ~X_0~0.base=v_~X_0~0.base_89, thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_35|} AuxVars[] AssignedVars[~i_3~0, thread3Thread1of1ForFork4_#t~nondet5#1, thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork4_#t~mem7#1, ~t_5~0, thread3Thread1of1ForFork4_#t~post6#1, thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1] [2022-12-13 12:59:29,668 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1113] L108-->L105: Formula: (and (not (= |v_thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1_33| 0)) (= (select (select |v_#memory_int_129| v_~X_0~0.base_77) (+ v_~X_0~0.offset_77 (* v_~i_7~0_134 4))) v_~t_8~0_51) (= |v_thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33| |v_thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1_33|) (not (= (mod |v_thread5Thread1of1ForFork1_#t~nondet15#1_32| 256) 0)) (= (ite (< v_~i_7~0_135 v_~n_1~0_131) 1 0) |v_thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33|) (= v_~i_7~0_134 (+ v_~i_7~0_135 1))) InVars {~n_1~0=v_~n_1~0_131, #memory_int=|v_#memory_int_129|, thread5Thread1of1ForFork1_#t~nondet15#1=|v_thread5Thread1of1ForFork1_#t~nondet15#1_32|, ~X_0~0.offset=v_~X_0~0.offset_77, ~X_0~0.base=v_~X_0~0.base_77, ~i_7~0=v_~i_7~0_135} OutVars{thread5Thread1of1ForFork1_#t~mem17#1=|v_thread5Thread1of1ForFork1_#t~mem17#1_13|, thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33|, ~n_1~0=v_~n_1~0_131, thread5Thread1of1ForFork1_#t~post16#1=|v_thread5Thread1of1ForFork1_#t~post16#1_13|, #memory_int=|v_#memory_int_129|, ~t_8~0=v_~t_8~0_51, ~X_0~0.offset=v_~X_0~0.offset_77, ~X_0~0.base=v_~X_0~0.base_77, thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1_33|, ~i_7~0=v_~i_7~0_134} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#t~mem17#1, thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork1_#t~post16#1, ~t_8~0, thread5Thread1of1ForFork1_#t~nondet15#1, thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~i_7~0] and [1076] L56-->L53: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet1#1_24| 256) 0)) (= v_~t_4~0_29 (select (select |v_#memory_int_99| v_~X_0~0.base_63) (+ v_~X_0~0.offset_63 (* v_~i_3~0_110 4)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|) (= v_~i_3~0_110 (+ v_~i_3~0_111 1)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite (< v_~i_3~0_111 v_~n_1~0_105) 1 0))) InVars {~i_3~0=v_~i_3~0_111, thread2Thread1of1ForFork2_#t~nondet1#1=|v_thread2Thread1of1ForFork2_#t~nondet1#1_24|, ~n_1~0=v_~n_1~0_105, #memory_int=|v_#memory_int_99|, ~X_0~0.offset=v_~X_0~0.offset_63, ~X_0~0.base=v_~X_0~0.base_63} OutVars{~i_3~0=v_~i_3~0_110, ~t_4~0=v_~t_4~0_29, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, ~n_1~0=v_~n_1~0_105, thread2Thread1of1ForFork2_#t~mem3#1=|v_thread2Thread1of1ForFork2_#t~mem3#1_11|, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_11|, #memory_int=|v_#memory_int_99|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, ~X_0~0.offset=v_~X_0~0.offset_63, ~X_0~0.base=v_~X_0~0.base_63} AuxVars[] AssignedVars[~i_3~0, thread2Thread1of1ForFork2_#t~nondet1#1, ~t_4~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem3#1, thread2Thread1of1ForFork2_#t~post2#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1] [2022-12-13 12:59:29,744 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1113] L108-->L105: Formula: (and (not (= |v_thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1_33| 0)) (= (select (select |v_#memory_int_129| v_~X_0~0.base_77) (+ v_~X_0~0.offset_77 (* v_~i_7~0_134 4))) v_~t_8~0_51) (= |v_thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33| |v_thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1_33|) (not (= (mod |v_thread5Thread1of1ForFork1_#t~nondet15#1_32| 256) 0)) (= (ite (< v_~i_7~0_135 v_~n_1~0_131) 1 0) |v_thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33|) (= v_~i_7~0_134 (+ v_~i_7~0_135 1))) InVars {~n_1~0=v_~n_1~0_131, #memory_int=|v_#memory_int_129|, thread5Thread1of1ForFork1_#t~nondet15#1=|v_thread5Thread1of1ForFork1_#t~nondet15#1_32|, ~X_0~0.offset=v_~X_0~0.offset_77, ~X_0~0.base=v_~X_0~0.base_77, ~i_7~0=v_~i_7~0_135} OutVars{thread5Thread1of1ForFork1_#t~mem17#1=|v_thread5Thread1of1ForFork1_#t~mem17#1_13|, thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33|, ~n_1~0=v_~n_1~0_131, thread5Thread1of1ForFork1_#t~post16#1=|v_thread5Thread1of1ForFork1_#t~post16#1_13|, #memory_int=|v_#memory_int_129|, ~t_8~0=v_~t_8~0_51, ~X_0~0.offset=v_~X_0~0.offset_77, ~X_0~0.base=v_~X_0~0.base_77, thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1_33|, ~i_7~0=v_~i_7~0_134} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#t~mem17#1, thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork1_#t~post16#1, ~t_8~0, thread5Thread1of1ForFork1_#t~nondet15#1, thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~i_7~0] and [879] L92-2-->L92-3: Formula: (= (store |v_#memory_int_4| |v_thread1Thread1of1ForFork5_~#t3~0.base_3| (store (select |v_#memory_int_4| |v_thread1Thread1of1ForFork5_~#t3~0.base_3|) |v_thread1Thread1of1ForFork5_~#t3~0.offset_3| |v_thread1Thread1of1ForFork5_#t~pre11_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, thread1Thread1of1ForFork5_~#t3~0.offset=|v_thread1Thread1of1ForFork5_~#t3~0.offset_3|, thread1Thread1of1ForFork5_~#t3~0.base=|v_thread1Thread1of1ForFork5_~#t3~0.base_3|, thread1Thread1of1ForFork5_#t~pre11=|v_thread1Thread1of1ForFork5_#t~pre11_3|} OutVars{#memory_int=|v_#memory_int_3|, thread1Thread1of1ForFork5_~#t3~0.offset=|v_thread1Thread1of1ForFork5_~#t3~0.offset_3|, thread1Thread1of1ForFork5_~#t3~0.base=|v_thread1Thread1of1ForFork5_~#t3~0.base_3|, thread1Thread1of1ForFork5_#t~pre11=|v_thread1Thread1of1ForFork5_#t~pre11_3|} AuxVars[] AssignedVars[#memory_int] [2022-12-13 12:59:29,794 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:59:29,795 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 913 [2022-12-13 12:59:29,795 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 182 transitions, 1164 flow [2022-12-13 12:59:29,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.384615384615385) internal successors, (244), 26 states have internal predecessors, (244), 0 states have call successors, (0), 0 states 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 12:59:29,795 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:59:29,795 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, 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 12:59:29,815 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 12:59:30,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:59:30,001 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-13 12:59:30,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:59:30,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1145226971, now seen corresponding path program 2 times [2022-12-13 12:59:30,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:59:30,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675566943] [2022-12-13 12:59:30,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:59:30,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:59:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:59:30,944 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 12:59:30,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:59:30,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675566943] [2022-12-13 12:59:30,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675566943] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:59:30,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914303598] [2022-12-13 12:59:30,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 12:59:30,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:59:30,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:59:30,946 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 12:59:30,948 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 12:59:31,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 12:59:31,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:59:31,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-13 12:59:31,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:59:31,099 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-12-13 12:59:31,099 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 1 case distinctions, treesize of input 19 treesize of output 20 [2022-12-13 12:59:31,126 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 12:59:31,152 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 12:59:31,220 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 12:59:31,260 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 12:59:31,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:59:31,420 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 16 treesize of output 18 [2022-12-13 12:59:31,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:59:31,471 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 16 treesize of output 18 [2022-12-13 12:59:31,499 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 19 treesize of output 7 [2022-12-13 12:59:31,518 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 12:59:31,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:59:31,783 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_123| Int)) (or (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_430 (Array Int Int))) (= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_429) |v_thread4Thread1of1ForFork0_~#t6~0.base_123| v_ArrVal_430) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_123|)))) is different from false [2022-12-13 12:59:32,671 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_111| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_123| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_123|)) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_430 (Array Int Int))) (= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_111| v_ArrVal_429) |v_thread4Thread1of1ForFork0_~#t6~0.base_123| v_ArrVal_430) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_111|)))) is different from false [2022-12-13 12:59:35,772 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 12:59:35,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914303598] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:59:35,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:59:35,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 16] total 40 [2022-12-13 12:59:35,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567945143] [2022-12-13 12:59:35,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:59:35,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-13 12:59:35,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:59:35,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-13 12:59:35,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1303, Unknown=76, NotChecked=154, Total=1722 [2022-12-13 12:59:35,774 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 66 [2022-12-13 12:59:35,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 182 transitions, 1164 flow. Second operand has 42 states, 42 states have (on average 8.357142857142858) internal successors, (351), 42 states have internal predecessors, (351), 0 states have call successors, (0), 0 states 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 12:59:35,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:59:35,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 66 [2022-12-13 12:59:35,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:59:38,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:59:40,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:59:43,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:59:45,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:59:50,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:59:51,255 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_111| Int) (v_ArrVal_429 (Array Int Int)) (v_ArrVal_428 (Array Int Int)) (v_ArrVal_430 (Array Int Int)) (|v_thread4Thread1of1ForFork0_~#t6~0.base_123| Int)) (or (let ((.cse0 (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t3~0.base| v_ArrVal_428))) (= (+ (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (select (select (store (store .cse0 |v_thread4Thread1of1ForFork0_~#t5~0.base_111| v_ArrVal_429) |v_thread4Thread1of1ForFork0_~#t6~0.base_123| v_ArrVal_430) c_~X_0~0.base) .cse1))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_123|)) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_111|)))) (forall ((|v_thread1Thread1of1ForFork5_~#t3~0.base_117| Int) (v_ArrVal_427 (Array Int Int)) (|v_thread4Thread1of1ForFork0_~#t5~0.base_111| Int) (v_ArrVal_429 (Array Int Int)) (v_ArrVal_428 (Array Int Int)) (v_ArrVal_430 (Array Int Int)) (|v_thread4Thread1of1ForFork0_~#t6~0.base_123| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_123|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork5_~#t3~0.base_117|)) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_111|)) (let ((.cse2 (store (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_427) |v_thread1Thread1of1ForFork5_~#t3~0.base_117| v_ArrVal_428))) (= (select (select .cse2 c_~X_0~0.base) .cse1) (select (select (store (store .cse2 |v_thread4Thread1of1ForFork0_~#t5~0.base_111| v_ArrVal_429) |v_thread4Thread1of1ForFork0_~#t6~0.base_123| v_ArrVal_430) c_~X_0~0.base) .cse1))))))) is different from false [2022-12-13 12:59:54,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:59:57,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:59:59,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:00:00,752 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_111| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_123| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_123|)) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_430 (Array Int Int))) (= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_111| v_ArrVal_429) |v_thread4Thread1of1ForFork0_~#t6~0.base_123| v_ArrVal_430) c_~X_0~0.base) .cse0))))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_111|)))) (forall ((|v_thread1Thread1of1ForFork5_~#t3~0.base_117| Int) (v_ArrVal_427 (Array Int Int)) (|v_thread4Thread1of1ForFork0_~#t5~0.base_111| Int) (v_ArrVal_429 (Array Int Int)) (v_ArrVal_428 (Array Int Int)) (v_ArrVal_430 (Array Int Int)) (|v_thread4Thread1of1ForFork0_~#t6~0.base_123| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_123|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork5_~#t3~0.base_117|)) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_111|)) (let ((.cse1 (store (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_427) |v_thread1Thread1of1ForFork5_~#t3~0.base_117| v_ArrVal_428))) (= (select (select .cse1 c_~X_0~0.base) .cse0) (select (select (store (store .cse1 |v_thread4Thread1of1ForFork0_~#t5~0.base_111| v_ArrVal_429) |v_thread4Thread1of1ForFork0_~#t6~0.base_123| v_ArrVal_430) c_~X_0~0.base) .cse0))))))) is different from false [2022-12-13 13:00:03,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:00:07,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:00:12,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:00:14,511 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_430 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_429) |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_430) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) c_~s_2~0)) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_430 (Array Int Int))) (= (+ c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_429) |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_430) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) c_~s_2~0))) is different from false [2022-12-13 13:00:19,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:00:22,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:00:32,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:00:34,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:00:40,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]