/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:18:25,255 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:18:25,257 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:18:25,275 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:18:25,275 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:18:25,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:18:25,280 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:18:25,281 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:18:25,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:18:25,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:18:25,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:18:25,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:18:25,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:18:25,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:18:25,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:18:25,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:18:25,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:18:25,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:18:25,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:18:25,313 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:18:25,316 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:18:25,320 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:18:25,320 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:18:25,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:18:25,323 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:18:25,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:18:25,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:18:25,324 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:18:25,324 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:18:25,325 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:18:25,325 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:18:25,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:18:25,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:18:25,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:18:25,327 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:18:25,327 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:18:25,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:18:25,328 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:18:25,328 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:18:25,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:18:25,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:18:25,332 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:18:25,356 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:18:25,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:18:25,358 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:18:25,358 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:18:25,358 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:18:25,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:18:25,358 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:18:25,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:18:25,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:18:25,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:18:25,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:18:25,359 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:18:25,359 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:18:25,359 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:18:25,360 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:18:25,360 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:18:25,360 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:18:25,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:18:25,360 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:18:25,360 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:18:25,360 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:18:25,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:18:25,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:18:25,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:18:25,361 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:18:25,361 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:18:25,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:18:25,361 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:18:25,362 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:18:25,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:18:25,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:18:25,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:18:25,697 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:18:25,698 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:18:25,699 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-06 05:18:26,687 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:18:26,851 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:18:26,852 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2022-12-06 05:18:26,857 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33430aa19/3bc976b4b4394bdbba4e456fb8baf4b8/FLAG1f6bfadf7 [2022-12-06 05:18:26,868 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33430aa19/3bc976b4b4394bdbba4e456fb8baf4b8 [2022-12-06 05:18:26,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:18:26,871 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:18:26,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:18:26,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:18:26,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:18:26,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:18:26" (1/1) ... [2022-12-06 05:18:26,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64bfd6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:26, skipping insertion in model container [2022-12-06 05:18:26,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:18:26" (1/1) ... [2022-12-06 05:18:26,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:18:26,901 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:18:27,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,079 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-06 05:18:27,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:18:27,099 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:18:27,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:27,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:27,141 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-06 05:18:27,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:18:27,154 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:18:27,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:27 WrapperNode [2022-12-06 05:18:27,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:18:27,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:18:27,157 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:18:27,157 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:18:27,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:27" (1/1) ... [2022-12-06 05:18:27,184 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:27" (1/1) ... [2022-12-06 05:18:27,217 INFO L138 Inliner]: procedures = 29, calls = 95, calls flagged for inlining = 21, calls inlined = 27, statements flattened = 289 [2022-12-06 05:18:27,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:18:27,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:18:27,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:18:27,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:18:27,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:27" (1/1) ... [2022-12-06 05:18:27,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:27" (1/1) ... [2022-12-06 05:18:27,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:27" (1/1) ... [2022-12-06 05:18:27,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:27" (1/1) ... [2022-12-06 05:18:27,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:27" (1/1) ... [2022-12-06 05:18:27,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:27" (1/1) ... [2022-12-06 05:18:27,249 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:27" (1/1) ... [2022-12-06 05:18:27,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:27" (1/1) ... [2022-12-06 05:18:27,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:18:27,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:18:27,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:18:27,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:18:27,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:27" (1/1) ... [2022-12-06 05:18:27,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:18:27,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:18:27,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:18:27,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:18:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:18:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:18:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:18:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:18:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:18:27,310 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:18:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:18:27,310 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:18:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:18:27,310 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:18:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 05:18:27,311 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 05:18:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:18:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-12-06 05:18:27,311 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-12-06 05:18:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-12-06 05:18:27,311 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-12-06 05:18:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:18:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:18:27,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:18:27,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:18:27,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:18:27,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:18:27,313 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:18:27,420 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:18:27,422 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:18:27,848 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:18:27,986 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:18:27,987 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-06 05:18:27,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:18:27 BoogieIcfgContainer [2022-12-06 05:18:27,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:18:27,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:18:27,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:18:27,994 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:18:27,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:18:26" (1/3) ... [2022-12-06 05:18:27,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f271272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:18:27, skipping insertion in model container [2022-12-06 05:18:27,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:27" (2/3) ... [2022-12-06 05:18:27,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f271272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:18:27, skipping insertion in model container [2022-12-06 05:18:27,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:18:27" (3/3) ... [2022-12-06 05:18:27,997 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1-dsl.wvr.c [2022-12-06 05:18:28,009 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:18:28,009 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:18:28,009 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:18:28,102 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2022-12-06 05:18:28,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 249 places, 248 transitions, 568 flow [2022-12-06 05:18:28,212 INFO L130 PetriNetUnfolder]: 18/220 cut-off events. [2022-12-06 05:18:28,212 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:18:28,218 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-06 05:18:28,219 INFO L82 GeneralOperation]: Start removeDead. Operand has 249 places, 248 transitions, 568 flow [2022-12-06 05:18:28,227 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 213 places, 212 transitions, 472 flow [2022-12-06 05:18:28,228 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:28,241 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 212 transitions, 472 flow [2022-12-06 05:18:28,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 212 transitions, 472 flow [2022-12-06 05:18:28,304 INFO L130 PetriNetUnfolder]: 18/212 cut-off events. [2022-12-06 05:18:28,305 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:18:28,310 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-06 05:18:28,316 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 212 transitions, 472 flow [2022-12-06 05:18:28,317 INFO L188 LiptonReduction]: Number of co-enabled transitions 7312 [2022-12-06 05:18:35,008 INFO L203 LiptonReduction]: Total number of compositions: 151 [2022-12-06 05:18:35,019 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:18:35,023 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;@5225f61b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:18:35,024 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-12-06 05:18:35,031 INFO L130 PetriNetUnfolder]: 9/60 cut-off events. [2022-12-06 05:18:35,031 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:18:35,031 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:35,032 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:35,032 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-06 05:18:35,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:35,036 INFO L85 PathProgramCache]: Analyzing trace with hash -482795550, now seen corresponding path program 1 times [2022-12-06 05:18:35,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:35,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696700921] [2022-12-06 05:18:35,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:35,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:35,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:35,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696700921] [2022-12-06 05:18:35,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696700921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:35,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:35,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:18:35,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757779917] [2022-12-06 05:18:35,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:35,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:35,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:35,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:35,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:35,568 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 61 [2022-12-06 05:18:35,569 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-06 05:18:35,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:35,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 61 [2022-12-06 05:18:35,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:38,599 INFO L130 PetriNetUnfolder]: 28944/36855 cut-off events. [2022-12-06 05:18:38,600 INFO L131 PetriNetUnfolder]: For 4966/4966 co-relation queries the response was YES. [2022-12-06 05:18:38,678 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-06 05:18:38,815 INFO L137 encePairwiseOnDemand]: 54/61 looper letters, 115 selfloop transitions, 8 changer transitions 1/138 dead transitions. [2022-12-06 05:18:38,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 138 transitions, 653 flow [2022-12-06 05:18:38,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:38,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:38,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-12-06 05:18:38,823 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7418032786885246 [2022-12-06 05:18:38,825 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 170 flow. Second operand 4 states and 181 transitions. [2022-12-06 05:18:38,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 138 transitions, 653 flow [2022-12-06 05:18:38,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 138 transitions, 567 flow, removed 0 selfloop flow, removed 12 redundant places. [2022-12-06 05:18:38,901 INFO L231 Difference]: Finished difference. Result has 64 places, 68 transitions, 191 flow [2022-12-06 05:18:38,902 INFO L276 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-06 05:18:38,906 INFO L294 CegarLoopForPetriNet]: 71 programPoint places, -7 predicate places. [2022-12-06 05:18:38,906 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:38,907 INFO L89 Accepts]: Start accepts. Operand has 64 places, 68 transitions, 191 flow [2022-12-06 05:18:38,912 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:38,912 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:38,912 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 68 transitions, 191 flow [2022-12-06 05:18:38,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 68 transitions, 191 flow [2022-12-06 05:18:38,933 INFO L130 PetriNetUnfolder]: 60/214 cut-off events. [2022-12-06 05:18:38,933 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 05:18:38,934 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-06 05:18:38,937 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 68 transitions, 191 flow [2022-12-06 05:18:38,937 INFO L188 LiptonReduction]: Number of co-enabled transitions 2062 [2022-12-06 05:18:38,980 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:18:38,982 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 05:18:38,982 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 68 transitions, 191 flow [2022-12-06 05:18:38,982 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-06 05:18:38,982 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:38,982 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:38,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:18:38,983 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-06 05:18:38,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:38,983 INFO L85 PathProgramCache]: Analyzing trace with hash -292667862, now seen corresponding path program 2 times [2022-12-06 05:18:38,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:38,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393074356] [2022-12-06 05:18:38,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:38,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:39,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:39,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:39,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393074356] [2022-12-06 05:18:39,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393074356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:39,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:39,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:18:39,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858181768] [2022-12-06 05:18:39,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:39,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:39,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:39,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:39,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:39,208 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 61 [2022-12-06 05:18:39,208 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-06 05:18:39,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:39,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 61 [2022-12-06 05:18:39,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:43,258 INFO L130 PetriNetUnfolder]: 47660/61383 cut-off events. [2022-12-06 05:18:43,258 INFO L131 PetriNetUnfolder]: For 13454/13457 co-relation queries the response was YES. [2022-12-06 05:18:43,367 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-06 05:18:43,596 INFO L137 encePairwiseOnDemand]: 54/61 looper letters, 121 selfloop transitions, 11 changer transitions 1/147 dead transitions. [2022-12-06 05:18:43,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 147 transitions, 666 flow [2022-12-06 05:18:43,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:43,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:43,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-12-06 05:18:43,599 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.75 [2022-12-06 05:18:43,599 INFO L175 Difference]: Start difference. First operand has 64 places, 68 transitions, 191 flow. Second operand 4 states and 183 transitions. [2022-12-06 05:18:43,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 147 transitions, 666 flow [2022-12-06 05:18:43,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 147 transitions, 666 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 05:18:43,607 INFO L231 Difference]: Finished difference. Result has 69 places, 75 transitions, 270 flow [2022-12-06 05:18:43,607 INFO L276 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-06 05:18:43,608 INFO L294 CegarLoopForPetriNet]: 71 programPoint places, -2 predicate places. [2022-12-06 05:18:43,608 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:43,608 INFO L89 Accepts]: Start accepts. Operand has 69 places, 75 transitions, 270 flow [2022-12-06 05:18:43,611 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:43,611 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:43,611 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 75 transitions, 270 flow [2022-12-06 05:18:43,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 75 transitions, 270 flow [2022-12-06 05:18:43,640 INFO L130 PetriNetUnfolder]: 68/238 cut-off events. [2022-12-06 05:18:43,640 INFO L131 PetriNetUnfolder]: For 65/72 co-relation queries the response was YES. [2022-12-06 05:18:43,642 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-06 05:18:43,646 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 75 transitions, 270 flow [2022-12-06 05:18:43,647 INFO L188 LiptonReduction]: Number of co-enabled transitions 2434 [2022-12-06 05:18:43,661 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:18:43,662 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-06 05:18:43,662 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 75 transitions, 270 flow [2022-12-06 05:18:43,663 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-06 05:18:43,663 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:43,663 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:43,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:18:43,663 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-06 05:18:43,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:43,664 INFO L85 PathProgramCache]: Analyzing trace with hash 68474559, now seen corresponding path program 1 times [2022-12-06 05:18:43,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:43,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071306603] [2022-12-06 05:18:43,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:43,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:43,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:43,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:43,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071306603] [2022-12-06 05:18:43,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071306603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:43,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:43,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:43,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396925745] [2022-12-06 05:18:43,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:43,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:18:43,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:43,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:18:43,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:18:43,917 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 61 [2022-12-06 05:18:43,918 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-06 05:18:43,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:43,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 61 [2022-12-06 05:18:43,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:49,149 INFO L130 PetriNetUnfolder]: 62087/79682 cut-off events. [2022-12-06 05:18:49,149 INFO L131 PetriNetUnfolder]: For 40600/40600 co-relation queries the response was YES. [2022-12-06 05:18:49,288 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-06 05:18:49,511 INFO L137 encePairwiseOnDemand]: 55/61 looper letters, 126 selfloop transitions, 5 changer transitions 0/145 dead transitions. [2022-12-06 05:18:49,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 145 transitions, 761 flow [2022-12-06 05:18:49,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:18:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:18:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2022-12-06 05:18:49,513 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5967213114754099 [2022-12-06 05:18:49,513 INFO L175 Difference]: Start difference. First operand has 69 places, 75 transitions, 270 flow. Second operand 5 states and 182 transitions. [2022-12-06 05:18:49,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 145 transitions, 761 flow [2022-12-06 05:18:49,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 145 transitions, 757 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-06 05:18:49,546 INFO L231 Difference]: Finished difference. Result has 76 places, 79 transitions, 316 flow [2022-12-06 05:18:49,546 INFO L276 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-06 05:18:49,547 INFO L294 CegarLoopForPetriNet]: 71 programPoint places, 5 predicate places. [2022-12-06 05:18:49,547 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:49,547 INFO L89 Accepts]: Start accepts. Operand has 76 places, 79 transitions, 316 flow [2022-12-06 05:18:49,548 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:49,548 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:49,548 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 79 transitions, 316 flow [2022-12-06 05:18:49,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 79 transitions, 316 flow [2022-12-06 05:18:49,581 INFO L130 PetriNetUnfolder]: 107/504 cut-off events. [2022-12-06 05:18:49,581 INFO L131 PetriNetUnfolder]: For 147/153 co-relation queries the response was YES. [2022-12-06 05:18:49,583 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-06 05:18:49,589 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 79 transitions, 316 flow [2022-12-06 05:18:49,589 INFO L188 LiptonReduction]: Number of co-enabled transitions 2522 [2022-12-06 05:18:51,713 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:51,713 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2166 [2022-12-06 05:18:51,714 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 78 transitions, 313 flow [2022-12-06 05:18:51,714 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-06 05:18:51,714 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:51,714 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:51,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:18:51,714 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-06 05:18:51,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:51,715 INFO L85 PathProgramCache]: Analyzing trace with hash 534493868, now seen corresponding path program 1 times [2022-12-06 05:18:51,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:51,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239351833] [2022-12-06 05:18:51,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:51,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:51,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:51,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:51,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239351833] [2022-12-06 05:18:51,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239351833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:51,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:51,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:18:51,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741079473] [2022-12-06 05:18:51,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:51,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:51,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:51,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:51,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:51,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2022-12-06 05:18:51,892 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-06 05:18:51,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:51,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2022-12-06 05:18:51,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:56,353 INFO L130 PetriNetUnfolder]: 52178/66777 cut-off events. [2022-12-06 05:18:56,353 INFO L131 PetriNetUnfolder]: For 38997/38997 co-relation queries the response was YES. [2022-12-06 05:18:56,545 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-06 05:18:56,738 INFO L137 encePairwiseOnDemand]: 58/62 looper letters, 61 selfloop transitions, 0 changer transitions 54/129 dead transitions. [2022-12-06 05:18:56,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 129 transitions, 680 flow [2022-12-06 05:18:56,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:56,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:56,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2022-12-06 05:18:56,739 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6370967741935484 [2022-12-06 05:18:56,739 INFO L175 Difference]: Start difference. First operand has 75 places, 78 transitions, 313 flow. Second operand 4 states and 158 transitions. [2022-12-06 05:18:56,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 129 transitions, 680 flow [2022-12-06 05:18:56,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 129 transitions, 669 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 05:18:56,755 INFO L231 Difference]: Finished difference. Result has 78 places, 75 transitions, 282 flow [2022-12-06 05:18:56,755 INFO L276 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-06 05:18:56,756 INFO L294 CegarLoopForPetriNet]: 71 programPoint places, 7 predicate places. [2022-12-06 05:18:56,756 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:56,756 INFO L89 Accepts]: Start accepts. Operand has 78 places, 75 transitions, 282 flow [2022-12-06 05:18:56,757 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:56,757 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:56,757 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 75 transitions, 282 flow [2022-12-06 05:18:56,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 75 transitions, 282 flow [2022-12-06 05:18:56,783 INFO L130 PetriNetUnfolder]: 112/419 cut-off events. [2022-12-06 05:18:56,784 INFO L131 PetriNetUnfolder]: For 122/124 co-relation queries the response was YES. [2022-12-06 05:18:56,785 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-06 05:18:56,792 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 75 transitions, 282 flow [2022-12-06 05:18:56,792 INFO L188 LiptonReduction]: Number of co-enabled transitions 2430 [2022-12-06 05:18:56,794 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:18:56,800 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-06 05:18:56,800 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 282 flow [2022-12-06 05:18:56,800 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-06 05:18:56,800 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:56,800 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:56,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:18:56,800 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-06 05:18:56,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:56,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1422378351, now seen corresponding path program 1 times [2022-12-06 05:18:56,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:56,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222308407] [2022-12-06 05:18:56,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:56,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:56,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:56,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:56,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222308407] [2022-12-06 05:18:56,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222308407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:56,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:56,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:56,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856526778] [2022-12-06 05:18:56,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:56,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:18:56,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:56,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:18:56,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:18:56,994 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 61 [2022-12-06 05:18:56,994 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-06 05:18:56,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:56,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 61 [2022-12-06 05:18:56,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:02,441 INFO L130 PetriNetUnfolder]: 62087/79652 cut-off events. [2022-12-06 05:19:02,441 INFO L131 PetriNetUnfolder]: For 52525/52531 co-relation queries the response was YES. [2022-12-06 05:19:02,642 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-06 05:19:02,961 INFO L137 encePairwiseOnDemand]: 55/61 looper letters, 126 selfloop transitions, 5 changer transitions 0/145 dead transitions. [2022-12-06 05:19:02,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 145 transitions, 789 flow [2022-12-06 05:19:02,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:19:02,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:19:02,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2022-12-06 05:19:02,963 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5967213114754099 [2022-12-06 05:19:02,963 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 282 flow. Second operand 5 states and 182 transitions. [2022-12-06 05:19:02,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 145 transitions, 789 flow [2022-12-06 05:19:03,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 145 transitions, 773 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 05:19:03,002 INFO L231 Difference]: Finished difference. Result has 78 places, 79 transitions, 324 flow [2022-12-06 05:19:03,003 INFO L276 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-06 05:19:03,003 INFO L294 CegarLoopForPetriNet]: 71 programPoint places, 7 predicate places. [2022-12-06 05:19:03,003 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:03,003 INFO L89 Accepts]: Start accepts. Operand has 78 places, 79 transitions, 324 flow [2022-12-06 05:19:03,004 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:03,004 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:03,005 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 79 transitions, 324 flow [2022-12-06 05:19:03,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 79 transitions, 324 flow [2022-12-06 05:19:03,035 INFO L130 PetriNetUnfolder]: 155/501 cut-off events. [2022-12-06 05:19:03,035 INFO L131 PetriNetUnfolder]: For 206/224 co-relation queries the response was YES. [2022-12-06 05:19:03,037 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-06 05:19:03,043 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 79 transitions, 324 flow [2022-12-06 05:19:03,043 INFO L188 LiptonReduction]: Number of co-enabled transitions 2520 [2022-12-06 05:19:05,566 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:05,567 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2564 [2022-12-06 05:19:05,567 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 78 transitions, 321 flow [2022-12-06 05:19:05,567 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-06 05:19:05,567 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:05,567 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:05,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:19:05,567 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-06 05:19:05,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:05,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1445237168, now seen corresponding path program 1 times [2022-12-06 05:19:05,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:05,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765817532] [2022-12-06 05:19:05,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:05,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:05,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:05,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:05,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765817532] [2022-12-06 05:19:05,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765817532] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:05,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:05,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:19:05,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413793157] [2022-12-06 05:19:05,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:05,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:05,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:05,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:05,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:05,736 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2022-12-06 05:19:05,737 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-06 05:19:05,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:05,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2022-12-06 05:19:05,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:10,211 INFO L130 PetriNetUnfolder]: 52178/66813 cut-off events. [2022-12-06 05:19:10,212 INFO L131 PetriNetUnfolder]: For 54267/54267 co-relation queries the response was YES. [2022-12-06 05:19:10,423 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-06 05:19:10,740 INFO L137 encePairwiseOnDemand]: 58/62 looper letters, 61 selfloop transitions, 0 changer transitions 54/129 dead transitions. [2022-12-06 05:19:10,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 129 transitions, 688 flow [2022-12-06 05:19:10,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:10,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:10,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2022-12-06 05:19:10,741 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6370967741935484 [2022-12-06 05:19:10,741 INFO L175 Difference]: Start difference. First operand has 77 places, 78 transitions, 321 flow. Second operand 4 states and 158 transitions. [2022-12-06 05:19:10,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 129 transitions, 688 flow [2022-12-06 05:19:10,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 129 transitions, 673 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:10,767 INFO L231 Difference]: Finished difference. Result has 79 places, 75 transitions, 286 flow [2022-12-06 05:19:10,767 INFO L276 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-06 05:19:10,768 INFO L294 CegarLoopForPetriNet]: 71 programPoint places, 8 predicate places. [2022-12-06 05:19:10,768 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:10,768 INFO L89 Accepts]: Start accepts. Operand has 79 places, 75 transitions, 286 flow [2022-12-06 05:19:10,769 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:10,769 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:10,769 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 75 transitions, 286 flow [2022-12-06 05:19:10,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 75 transitions, 286 flow [2022-12-06 05:19:10,794 INFO L130 PetriNetUnfolder]: 112/419 cut-off events. [2022-12-06 05:19:10,794 INFO L131 PetriNetUnfolder]: For 142/160 co-relation queries the response was YES. [2022-12-06 05:19:10,796 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-06 05:19:10,800 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 75 transitions, 286 flow [2022-12-06 05:19:10,800 INFO L188 LiptonReduction]: Number of co-enabled transitions 2430 [2022-12-06 05:19:10,801 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:19:10,802 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 05:19:10,802 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 75 transitions, 286 flow [2022-12-06 05:19:10,802 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-06 05:19:10,802 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:10,802 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:10,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:19:10,803 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-06 05:19:10,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:10,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1794543537, now seen corresponding path program 1 times [2022-12-06 05:19:10,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:10,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869762835] [2022-12-06 05:19:10,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:10,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:10,950 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-06 05:19:10,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:10,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869762835] [2022-12-06 05:19:10,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869762835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:10,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:10,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:19:10,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315046154] [2022-12-06 05:19:10,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:10,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:10,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:10,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:10,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:10,951 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 61 [2022-12-06 05:19:10,952 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-06 05:19:10,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:10,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 61 [2022-12-06 05:19:10,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:14,021 INFO L130 PetriNetUnfolder]: 35330/44980 cut-off events. [2022-12-06 05:19:14,022 INFO L131 PetriNetUnfolder]: For 42108/42108 co-relation queries the response was YES. [2022-12-06 05:19:14,119 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-06 05:19:14,239 INFO L137 encePairwiseOnDemand]: 55/61 looper letters, 86 selfloop transitions, 5 changer transitions 0/105 dead transitions. [2022-12-06 05:19:14,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 105 transitions, 585 flow [2022-12-06 05:19:14,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:14,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:14,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-12-06 05:19:14,240 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5368852459016393 [2022-12-06 05:19:14,240 INFO L175 Difference]: Start difference. First operand has 74 places, 75 transitions, 286 flow. Second operand 4 states and 131 transitions. [2022-12-06 05:19:14,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 105 transitions, 585 flow [2022-12-06 05:19:14,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 105 transitions, 563 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:14,259 INFO L231 Difference]: Finished difference. Result has 75 places, 77 transitions, 300 flow [2022-12-06 05:19:14,260 INFO L276 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-06 05:19:14,260 INFO L294 CegarLoopForPetriNet]: 71 programPoint places, 4 predicate places. [2022-12-06 05:19:14,260 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:14,260 INFO L89 Accepts]: Start accepts. Operand has 75 places, 77 transitions, 300 flow [2022-12-06 05:19:14,261 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:14,261 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:14,261 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 77 transitions, 300 flow [2022-12-06 05:19:14,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 77 transitions, 300 flow [2022-12-06 05:19:14,286 INFO L130 PetriNetUnfolder]: 117/410 cut-off events. [2022-12-06 05:19:14,286 INFO L131 PetriNetUnfolder]: For 148/167 co-relation queries the response was YES. [2022-12-06 05:19:14,288 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-06 05:19:14,291 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 77 transitions, 300 flow [2022-12-06 05:19:14,291 INFO L188 LiptonReduction]: Number of co-enabled transitions 2520 [2022-12-06 05:19:14,292 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:19:14,293 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-06 05:19:14,293 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 77 transitions, 300 flow [2022-12-06 05:19:14,293 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-06 05:19:14,293 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:14,293 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:14,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:19:14,294 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-06 05:19:14,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:14,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1040941797, now seen corresponding path program 1 times [2022-12-06 05:19:14,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:14,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563874307] [2022-12-06 05:19:14,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:14,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:14,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:14,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:14,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563874307] [2022-12-06 05:19:14,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563874307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:14,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:14,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:19:14,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552078714] [2022-12-06 05:19:14,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:14,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:14,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:14,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:14,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:14,427 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 61 [2022-12-06 05:19:14,428 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-06 05:19:14,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:14,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 61 [2022-12-06 05:19:14,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:16,588 INFO L130 PetriNetUnfolder]: 26312/33215 cut-off events. [2022-12-06 05:19:16,589 INFO L131 PetriNetUnfolder]: For 33558/33558 co-relation queries the response was YES. [2022-12-06 05:19:16,665 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-06 05:19:16,772 INFO L137 encePairwiseOnDemand]: 55/61 looper letters, 90 selfloop transitions, 5 changer transitions 0/109 dead transitions. [2022-12-06 05:19:16,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 109 transitions, 622 flow [2022-12-06 05:19:16,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:16,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:16,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-12-06 05:19:16,774 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5368852459016393 [2022-12-06 05:19:16,774 INFO L175 Difference]: Start difference. First operand has 75 places, 77 transitions, 300 flow. Second operand 4 states and 131 transitions. [2022-12-06 05:19:16,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 109 transitions, 622 flow [2022-12-06 05:19:16,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 109 transitions, 593 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:16,801 INFO L231 Difference]: Finished difference. Result has 76 places, 79 transitions, 312 flow [2022-12-06 05:19:16,801 INFO L276 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-06 05:19:16,801 INFO L294 CegarLoopForPetriNet]: 71 programPoint places, 5 predicate places. [2022-12-06 05:19:16,801 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:16,802 INFO L89 Accepts]: Start accepts. Operand has 76 places, 79 transitions, 312 flow [2022-12-06 05:19:16,802 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:16,802 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:16,803 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 79 transitions, 312 flow [2022-12-06 05:19:16,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 79 transitions, 312 flow [2022-12-06 05:19:16,829 INFO L130 PetriNetUnfolder]: 152/438 cut-off events. [2022-12-06 05:19:16,829 INFO L131 PetriNetUnfolder]: For 176/217 co-relation queries the response was YES. [2022-12-06 05:19:16,831 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-06 05:19:16,834 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 79 transitions, 312 flow [2022-12-06 05:19:16,834 INFO L188 LiptonReduction]: Number of co-enabled transitions 2606 [2022-12-06 05:19:16,836 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:19:16,836 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 05:19:16,836 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 79 transitions, 312 flow [2022-12-06 05:19:16,836 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-06 05:19:16,836 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:16,837 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:16,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:19:16,837 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-06 05:19:16,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:16,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1508768819, now seen corresponding path program 1 times [2022-12-06 05:19:16,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:16,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966900616] [2022-12-06 05:19:16,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:16,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:17,681 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-06 05:19:17,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:17,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966900616] [2022-12-06 05:19:17,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966900616] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:19:17,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044754861] [2022-12-06 05:19:17,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:17,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:19:17,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:19:17,685 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:19:17,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:19:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:17,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-06 05:19:17,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:19:18,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:19:18,144 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-06 05:19:18,179 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-06 05:19:18,208 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-06 05:19:18,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:19:18,311 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_349) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) c_~s_2~0)) is different from false [2022-12-06 05:19:18,317 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_349 (Array Int Int))) (= (+ c_~t_4~0 c_~s_2~0) (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_349) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) is different from false [2022-12-06 05:19:18,329 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:19:18,329 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-06 05:19:18,334 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-06 05:19:18,456 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-06 05:19:18,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044754861] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:19:18,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:19:18,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-12-06 05:19:18,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839357756] [2022-12-06 05:19:18,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:19:18,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 05:19:18,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:18,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 05:19:18,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=484, Unknown=5, NotChecked=90, Total=650 [2022-12-06 05:19:18,457 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 61 [2022-12-06 05:19:18,458 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-06 05:19:18,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:18,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 61 [2022-12-06 05:19:18,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:28,042 INFO L130 PetriNetUnfolder]: 79023/99860 cut-off events. [2022-12-06 05:19:28,043 INFO L131 PetriNetUnfolder]: For 80227/80227 co-relation queries the response was YES. [2022-12-06 05:19:28,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294623 conditions, 99860 events. 79023/99860 cut-off events. For 80227/80227 co-relation queries the response was YES. Maximal size of possible extension queue 1882. Compared 491066 event pairs, 18918 based on Foata normal form. 1/89764 useless extension candidates. Maximal degree in co-relation 108929. Up to 45166 conditions per place. [2022-12-06 05:19:28,618 INFO L137 encePairwiseOnDemand]: 28/61 looper letters, 462 selfloop transitions, 144 changer transitions 1/613 dead transitions. [2022-12-06 05:19:28,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 613 transitions, 3339 flow [2022-12-06 05:19:28,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 05:19:28,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 05:19:28,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 702 transitions. [2022-12-06 05:19:28,620 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5003563791874555 [2022-12-06 05:19:28,620 INFO L175 Difference]: Start difference. First operand has 76 places, 79 transitions, 312 flow. Second operand 23 states and 702 transitions. [2022-12-06 05:19:28,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 613 transitions, 3339 flow [2022-12-06 05:19:28,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 613 transitions, 3259 flow, removed 34 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:28,753 INFO L231 Difference]: Finished difference. Result has 108 places, 238 transitions, 1553 flow [2022-12-06 05:19:28,753 INFO L276 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=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1553, PETRI_PLACES=108, PETRI_TRANSITIONS=238} [2022-12-06 05:19:28,753 INFO L294 CegarLoopForPetriNet]: 71 programPoint places, 37 predicate places. [2022-12-06 05:19:28,753 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:28,753 INFO L89 Accepts]: Start accepts. Operand has 108 places, 238 transitions, 1553 flow [2022-12-06 05:19:28,755 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:28,755 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:28,755 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 238 transitions, 1553 flow [2022-12-06 05:19:28,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 238 transitions, 1553 flow [2022-12-06 05:19:29,706 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1172] L74-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork4_#t~nondet5#1_In_1| 256) 0) (= |v_thread3Thread1of1ForFork4_#res#1.offset_Out_6| 0) (= |v_thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_Out_6| (ite (not (< v_~i_3~0_In_8 v_~n_1~0_In_24)) 1 0)) (= |v_thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_Out_6| |v_thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread3Thread1of1ForFork4_#res#1.base_Out_6| 0) (not (= |v_thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1_Out_6| 0))) InVars {~i_3~0=v_~i_3~0_In_8, thread3Thread1of1ForFork4_#t~nondet5#1=|v_thread3Thread1of1ForFork4_#t~nondet5#1_In_1|, ~n_1~0=v_~n_1~0_In_24} OutVars{~i_3~0=v_~i_3~0_In_8, thread3Thread1of1ForFork4_#res#1.base=|v_thread3Thread1of1ForFork4_#res#1.base_Out_6|, ~n_1~0=v_~n_1~0_In_24, thread3Thread1of1ForFork4_#res#1.offset=|v_thread3Thread1of1ForFork4_#res#1.offset_Out_6|, thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1_Out_6|, thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_#t~nondet5#1, thread3Thread1of1ForFork4_#res#1.base, thread3Thread1of1ForFork4_#res#1.offset, thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1][102], [113#thread2EXITtrue, Black: 257#(and (= ~s_6~0 ~s_2~0) (= ~s_6~0 0)), 114#L93-1true, Black: 254#(= ~s_6~0 0), 134#thread3EXITtrue, Black: 265#(and (= ~s_6~0 ~s_2~0) (= ~s_2~0 0)), Black: 262#(= ~s_2~0 0), 260#true, 124#L143-3true, 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, 252#true, 57#thread5EXITtrue, 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: 686#(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: 688#(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: 665#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store |#memory_int| |thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_349) ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_4~0))) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 307#(and (= ~i_7~0 0) (<= 1 ~n_1~0)), Black: 676#(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: 657#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store |#memory_int| |thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_349) ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_4~0))) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 682#(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: 674#(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: 312#(and (= ~i_3~0 0) (<= 1 ~n_1~0)), Black: 684#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 659#(and (= ~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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 672#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 680#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 663#(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))]) [2022-12-06 05:19:29,706 INFO L382 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-06 05:19:29,706 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-06 05:19:29,706 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-06 05:19:29,707 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-06 05:19:29,707 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1172] L74-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork4_#t~nondet5#1_In_1| 256) 0) (= |v_thread3Thread1of1ForFork4_#res#1.offset_Out_6| 0) (= |v_thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_Out_6| (ite (not (< v_~i_3~0_In_8 v_~n_1~0_In_24)) 1 0)) (= |v_thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_Out_6| |v_thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread3Thread1of1ForFork4_#res#1.base_Out_6| 0) (not (= |v_thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1_Out_6| 0))) InVars {~i_3~0=v_~i_3~0_In_8, thread3Thread1of1ForFork4_#t~nondet5#1=|v_thread3Thread1of1ForFork4_#t~nondet5#1_In_1|, ~n_1~0=v_~n_1~0_In_24} OutVars{~i_3~0=v_~i_3~0_In_8, thread3Thread1of1ForFork4_#res#1.base=|v_thread3Thread1of1ForFork4_#res#1.base_Out_6|, ~n_1~0=v_~n_1~0_In_24, thread3Thread1of1ForFork4_#res#1.offset=|v_thread3Thread1of1ForFork4_#res#1.offset_Out_6|, thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1_Out_6|, thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_#t~nondet5#1, thread3Thread1of1ForFork4_#res#1.base, thread3Thread1of1ForFork4_#res#1.offset, thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1][102], [113#thread2EXITtrue, Black: 257#(and (= ~s_6~0 ~s_2~0) (= ~s_6~0 0)), 114#L93-1true, Black: 254#(= ~s_6~0 0), 134#thread3EXITtrue, Black: 265#(and (= ~s_6~0 ~s_2~0) (= ~s_2~0 0)), Black: 262#(= ~s_2~0 0), 260#true, 124#L143-3true, 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, 252#true, 10#L105true, 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: 686#(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: 688#(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: 665#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store |#memory_int| |thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_349) ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_4~0))) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 307#(and (= ~i_7~0 0) (<= 1 ~n_1~0)), Black: 676#(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: 657#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store |#memory_int| |thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_349) ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_4~0))) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 682#(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: 674#(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: 684#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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)), Black: 659#(and (= ~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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 672#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 680#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 663#(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))]) [2022-12-06 05:19:29,707 INFO L382 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-06 05:19:29,707 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-06 05:19:29,707 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-06 05:19:29,707 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-06 05:19:29,839 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([981] L144-3-->L126: Formula: (and (= v_thread6Thread1of1ForFork3_thidvar3_4 0) (= v_thread6Thread1of1ForFork3_thidvar1_4 0) (= v_thread6Thread1of1ForFork3_thidvar4_4 0) (= v_thread6Thread1of1ForFork3_thidvar0_4 |v_thread4Thread1of1ForFork0_#t~pre25_10|) (= v_thread6Thread1of1ForFork3_thidvar2_4 0)) InVars {thread4Thread1of1ForFork0_#t~pre25=|v_thread4Thread1of1ForFork0_#t~pre25_10|} OutVars{thread6Thread1of1ForFork3_#t~mem21#1=|v_thread6Thread1of1ForFork3_#t~mem21#1_6|, thread6Thread1of1ForFork3_#t~ret22#1=|v_thread6Thread1of1ForFork3_#t~ret22#1_6|, thread6Thread1of1ForFork3_#t~nondet19#1=|v_thread6Thread1of1ForFork3_#t~nondet19#1_12|, thread6Thread1of1ForFork3_#res#1.offset=|v_thread6Thread1of1ForFork3_#res#1.offset_6|, thread6Thread1of1ForFork3_plus_~a#1=|v_thread6Thread1of1ForFork3_plus_~a#1_6|, thread6Thread1of1ForFork3_plus_#in~a#1=|v_thread6Thread1of1ForFork3_plus_#in~a#1_6|, thread6Thread1of1ForFork3_thidvar1=v_thread6Thread1of1ForFork3_thidvar1_4, thread6Thread1of1ForFork3_#t~post20#1=|v_thread6Thread1of1ForFork3_#t~post20#1_6|, thread6Thread1of1ForFork3_thidvar0=v_thread6Thread1of1ForFork3_thidvar0_4, thread6Thread1of1ForFork3_plus_#in~b#1=|v_thread6Thread1of1ForFork3_plus_#in~b#1_6|, thread6Thread1of1ForFork3_thidvar3=v_thread6Thread1of1ForFork3_thidvar3_4, thread6Thread1of1ForFork3_thidvar2=v_thread6Thread1of1ForFork3_thidvar2_4, thread6Thread1of1ForFork3_#res#1.base=|v_thread6Thread1of1ForFork3_#res#1.base_6|, thread6Thread1of1ForFork3_thidvar4=v_thread6Thread1of1ForFork3_thidvar4_4, thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1_10|, thread6Thread1of1ForFork3_plus_~b#1=|v_thread6Thread1of1ForFork3_plus_~b#1_6|, thread4Thread1of1ForFork0_#t~pre25=|v_thread4Thread1of1ForFork0_#t~pre25_10|, thread6Thread1of1ForFork3_plus_#res#1=|v_thread6Thread1of1ForFork3_plus_#res#1_6|, thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_10|} AuxVars[] AssignedVars[thread6Thread1of1ForFork3_#t~mem21#1, thread6Thread1of1ForFork3_#t~ret22#1, thread6Thread1of1ForFork3_#t~nondet19#1, thread6Thread1of1ForFork3_#res#1.offset, thread6Thread1of1ForFork3_plus_~a#1, thread6Thread1of1ForFork3_plus_#in~a#1, thread6Thread1of1ForFork3_thidvar1, thread6Thread1of1ForFork3_#t~post20#1, thread6Thread1of1ForFork3_thidvar0, thread6Thread1of1ForFork3_plus_#in~b#1, thread6Thread1of1ForFork3_thidvar3, thread6Thread1of1ForFork3_thidvar2, thread6Thread1of1ForFork3_#res#1.base, thread6Thread1of1ForFork3_thidvar4, thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork3_plus_~b#1, thread6Thread1of1ForFork3_plus_#res#1, thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][157], [Black: 257#(and (= ~s_6~0 ~s_2~0) (= ~s_6~0 0)), Black: 254#(= ~s_6~0 0), 114#L93-1true, 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, 75#L74true, 122#L53true, 252#true, 57#thread5EXITtrue, 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: 686#(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: 688#(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: 665#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store |#memory_int| |thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_349) ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_4~0))) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 307#(and (= ~i_7~0 0) (<= 1 ~n_1~0)), Black: 676#(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: 657#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store |#memory_int| |thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_349) ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_4~0))) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 682#(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: 674#(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)), 123#L126true, Black: 684#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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)), Black: 659#(and (= ~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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 672#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 680#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 663#(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))]) [2022-12-06 05:19:29,840 INFO L382 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-12-06 05:19:29,840 INFO L385 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-06 05:19:29,840 INFO L385 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-06 05:19:29,840 INFO L385 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-06 05:19:29,840 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([981] L144-3-->L126: Formula: (and (= v_thread6Thread1of1ForFork3_thidvar3_4 0) (= v_thread6Thread1of1ForFork3_thidvar1_4 0) (= v_thread6Thread1of1ForFork3_thidvar4_4 0) (= v_thread6Thread1of1ForFork3_thidvar0_4 |v_thread4Thread1of1ForFork0_#t~pre25_10|) (= v_thread6Thread1of1ForFork3_thidvar2_4 0)) InVars {thread4Thread1of1ForFork0_#t~pre25=|v_thread4Thread1of1ForFork0_#t~pre25_10|} OutVars{thread6Thread1of1ForFork3_#t~mem21#1=|v_thread6Thread1of1ForFork3_#t~mem21#1_6|, thread6Thread1of1ForFork3_#t~ret22#1=|v_thread6Thread1of1ForFork3_#t~ret22#1_6|, thread6Thread1of1ForFork3_#t~nondet19#1=|v_thread6Thread1of1ForFork3_#t~nondet19#1_12|, thread6Thread1of1ForFork3_#res#1.offset=|v_thread6Thread1of1ForFork3_#res#1.offset_6|, thread6Thread1of1ForFork3_plus_~a#1=|v_thread6Thread1of1ForFork3_plus_~a#1_6|, thread6Thread1of1ForFork3_plus_#in~a#1=|v_thread6Thread1of1ForFork3_plus_#in~a#1_6|, thread6Thread1of1ForFork3_thidvar1=v_thread6Thread1of1ForFork3_thidvar1_4, thread6Thread1of1ForFork3_#t~post20#1=|v_thread6Thread1of1ForFork3_#t~post20#1_6|, thread6Thread1of1ForFork3_thidvar0=v_thread6Thread1of1ForFork3_thidvar0_4, thread6Thread1of1ForFork3_plus_#in~b#1=|v_thread6Thread1of1ForFork3_plus_#in~b#1_6|, thread6Thread1of1ForFork3_thidvar3=v_thread6Thread1of1ForFork3_thidvar3_4, thread6Thread1of1ForFork3_thidvar2=v_thread6Thread1of1ForFork3_thidvar2_4, thread6Thread1of1ForFork3_#res#1.base=|v_thread6Thread1of1ForFork3_#res#1.base_6|, thread6Thread1of1ForFork3_thidvar4=v_thread6Thread1of1ForFork3_thidvar4_4, thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1_10|, thread6Thread1of1ForFork3_plus_~b#1=|v_thread6Thread1of1ForFork3_plus_~b#1_6|, thread4Thread1of1ForFork0_#t~pre25=|v_thread4Thread1of1ForFork0_#t~pre25_10|, thread6Thread1of1ForFork3_plus_#res#1=|v_thread6Thread1of1ForFork3_plus_#res#1_6|, thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_10|} AuxVars[] AssignedVars[thread6Thread1of1ForFork3_#t~mem21#1, thread6Thread1of1ForFork3_#t~ret22#1, thread6Thread1of1ForFork3_#t~nondet19#1, thread6Thread1of1ForFork3_#res#1.offset, thread6Thread1of1ForFork3_plus_~a#1, thread6Thread1of1ForFork3_plus_#in~a#1, thread6Thread1of1ForFork3_thidvar1, thread6Thread1of1ForFork3_#t~post20#1, thread6Thread1of1ForFork3_thidvar0, thread6Thread1of1ForFork3_plus_#in~b#1, thread6Thread1of1ForFork3_thidvar3, thread6Thread1of1ForFork3_thidvar2, thread6Thread1of1ForFork3_#res#1.base, thread6Thread1of1ForFork3_thidvar4, thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork3_plus_~b#1, thread6Thread1of1ForFork3_plus_#res#1, thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][157], [Black: 257#(and (= ~s_6~0 ~s_2~0) (= ~s_6~0 0)), Black: 254#(= ~s_6~0 0), 114#L93-1true, 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, 75#L74true, 122#L53true, 252#true, 10#L105true, 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: 686#(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: 688#(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: 665#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store |#memory_int| |thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_349) ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_4~0))) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 307#(and (= ~i_7~0 0) (<= 1 ~n_1~0)), Black: 676#(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: 657#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store |#memory_int| |thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_349) ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_4~0))) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 682#(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: 674#(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)), 123#L126true, Black: 684#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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)), Black: 659#(and (= ~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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 672#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 680#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 663#(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))]) [2022-12-06 05:19:29,841 INFO L382 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-12-06 05:19:29,841 INFO L385 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-06 05:19:29,841 INFO L385 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-06 05:19:29,841 INFO L385 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-06 05:19:29,846 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([992] thread2EXIT-->L93-2: Formula: (and (= v_thread2Thread1of1ForFork2_thidvar0_10 (let ((.cse0 (mod |v_thread1Thread1of1ForFork5_#t~mem13_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork2_thidvar1_10 0)) InVars {thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_10, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_10, thread1Thread1of1ForFork5_#t~mem13=|v_thread1Thread1of1ForFork5_#t~mem13_8|} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_10, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_10, thread1Thread1of1ForFork5_#t~mem13=|v_thread1Thread1of1ForFork5_#t~mem13_8|} AuxVars[] AssignedVars[][170], [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, 58#L144-1true, 148#L93-2true, 108#L71true, 252#true, 57#thread5EXITtrue, 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: 686#(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: 688#(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: 665#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store |#memory_int| |thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_349) ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_4~0))) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 307#(and (= ~i_7~0 0) (<= 1 ~n_1~0)), Black: 676#(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: 657#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store |#memory_int| |thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_349) ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_4~0))) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 682#(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: 674#(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: 684#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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)), Black: 659#(and (= ~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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 672#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 680#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 663#(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))]) [2022-12-06 05:19:29,847 INFO L382 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-06 05:19:29,847 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-06 05:19:29,847 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-06 05:19:29,847 INFO L385 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-06 05:19:29,847 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] thread2EXIT-->L93-2: Formula: (and (= (let ((.cse0 (mod |v_thread1Thread1of1ForFork5_#t~mem13_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_12) (= v_thread2Thread1of1ForFork2_thidvar1_12 0)) InVars {thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_12, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_12, thread1Thread1of1ForFork5_#t~mem13=|v_thread1Thread1of1ForFork5_#t~mem13_10|} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_12, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_12, thread1Thread1of1ForFork5_#t~mem13=|v_thread1Thread1of1ForFork5_#t~mem13_10|} AuxVars[] AssignedVars[][171], [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, 58#L144-1true, 148#L93-2true, 108#L71true, 252#true, 57#thread5EXITtrue, 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: 686#(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: 688#(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: 665#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store |#memory_int| |thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_349) ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_4~0))) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 307#(and (= ~i_7~0 0) (<= 1 ~n_1~0)), Black: 676#(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: 657#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store |#memory_int| |thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_349) ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_4~0))) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 682#(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: 674#(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: 684#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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)), Black: 659#(and (= ~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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 672#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 680#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 663#(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))]) [2022-12-06 05:19:29,847 INFO L382 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-06 05:19:29,847 INFO L385 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-06 05:19:29,847 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-06 05:19:29,847 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-06 05:19:29,848 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([992] thread2EXIT-->L93-2: Formula: (and (= v_thread2Thread1of1ForFork2_thidvar0_10 (let ((.cse0 (mod |v_thread1Thread1of1ForFork5_#t~mem13_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork2_thidvar1_10 0)) InVars {thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_10, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_10, thread1Thread1of1ForFork5_#t~mem13=|v_thread1Thread1of1ForFork5_#t~mem13_8|} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_10, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_10, thread1Thread1of1ForFork5_#t~mem13=|v_thread1Thread1of1ForFork5_#t~mem13_8|} AuxVars[] AssignedVars[][170], [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, 58#L144-1true, 148#L93-2true, 108#L71true, 252#true, 10#L105true, 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: 686#(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: 688#(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: 665#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store |#memory_int| |thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_349) ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_4~0))) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 307#(and (= ~i_7~0 0) (<= 1 ~n_1~0)), Black: 676#(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: 657#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store |#memory_int| |thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_349) ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_4~0))) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 682#(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: 674#(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: 684#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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)), Black: 659#(and (= ~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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 672#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 680#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 663#(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))]) [2022-12-06 05:19:29,848 INFO L382 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-06 05:19:29,848 INFO L385 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-06 05:19:29,848 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-06 05:19:29,848 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-06 05:19:29,848 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] thread2EXIT-->L93-2: Formula: (and (= (let ((.cse0 (mod |v_thread1Thread1of1ForFork5_#t~mem13_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_12) (= v_thread2Thread1of1ForFork2_thidvar1_12 0)) InVars {thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_12, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_12, thread1Thread1of1ForFork5_#t~mem13=|v_thread1Thread1of1ForFork5_#t~mem13_10|} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_12, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_12, thread1Thread1of1ForFork5_#t~mem13=|v_thread1Thread1of1ForFork5_#t~mem13_10|} AuxVars[] AssignedVars[][171], [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, 58#L144-1true, 148#L93-2true, 108#L71true, 252#true, 10#L105true, 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: 686#(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: 688#(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: 665#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store |#memory_int| |thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_349) ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_4~0))) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 307#(and (= ~i_7~0 0) (<= 1 ~n_1~0)), Black: 676#(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: 657#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store |#memory_int| |thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_349) ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_4~0))) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 682#(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: 674#(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: 684#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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)), Black: 659#(and (= ~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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 672#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 680#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 663#(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))]) [2022-12-06 05:19:29,848 INFO L382 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-06 05:19:29,848 INFO L385 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-06 05:19:29,848 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-06 05:19:29,848 INFO L385 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-06 05:19:29,861 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([981] L144-3-->L126: Formula: (and (= v_thread6Thread1of1ForFork3_thidvar3_4 0) (= v_thread6Thread1of1ForFork3_thidvar1_4 0) (= v_thread6Thread1of1ForFork3_thidvar4_4 0) (= v_thread6Thread1of1ForFork3_thidvar0_4 |v_thread4Thread1of1ForFork0_#t~pre25_10|) (= v_thread6Thread1of1ForFork3_thidvar2_4 0)) InVars {thread4Thread1of1ForFork0_#t~pre25=|v_thread4Thread1of1ForFork0_#t~pre25_10|} OutVars{thread6Thread1of1ForFork3_#t~mem21#1=|v_thread6Thread1of1ForFork3_#t~mem21#1_6|, thread6Thread1of1ForFork3_#t~ret22#1=|v_thread6Thread1of1ForFork3_#t~ret22#1_6|, thread6Thread1of1ForFork3_#t~nondet19#1=|v_thread6Thread1of1ForFork3_#t~nondet19#1_12|, thread6Thread1of1ForFork3_#res#1.offset=|v_thread6Thread1of1ForFork3_#res#1.offset_6|, thread6Thread1of1ForFork3_plus_~a#1=|v_thread6Thread1of1ForFork3_plus_~a#1_6|, thread6Thread1of1ForFork3_plus_#in~a#1=|v_thread6Thread1of1ForFork3_plus_#in~a#1_6|, thread6Thread1of1ForFork3_thidvar1=v_thread6Thread1of1ForFork3_thidvar1_4, thread6Thread1of1ForFork3_#t~post20#1=|v_thread6Thread1of1ForFork3_#t~post20#1_6|, thread6Thread1of1ForFork3_thidvar0=v_thread6Thread1of1ForFork3_thidvar0_4, thread6Thread1of1ForFork3_plus_#in~b#1=|v_thread6Thread1of1ForFork3_plus_#in~b#1_6|, thread6Thread1of1ForFork3_thidvar3=v_thread6Thread1of1ForFork3_thidvar3_4, thread6Thread1of1ForFork3_thidvar2=v_thread6Thread1of1ForFork3_thidvar2_4, thread6Thread1of1ForFork3_#res#1.base=|v_thread6Thread1of1ForFork3_#res#1.base_6|, thread6Thread1of1ForFork3_thidvar4=v_thread6Thread1of1ForFork3_thidvar4_4, thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1_10|, thread6Thread1of1ForFork3_plus_~b#1=|v_thread6Thread1of1ForFork3_plus_~b#1_6|, thread4Thread1of1ForFork0_#t~pre25=|v_thread4Thread1of1ForFork0_#t~pre25_10|, thread6Thread1of1ForFork3_plus_#res#1=|v_thread6Thread1of1ForFork3_plus_#res#1_6|, thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_10|} AuxVars[] AssignedVars[thread6Thread1of1ForFork3_#t~mem21#1, thread6Thread1of1ForFork3_#t~ret22#1, thread6Thread1of1ForFork3_#t~nondet19#1, thread6Thread1of1ForFork3_#res#1.offset, thread6Thread1of1ForFork3_plus_~a#1, thread6Thread1of1ForFork3_plus_#in~a#1, thread6Thread1of1ForFork3_thidvar1, thread6Thread1of1ForFork3_#t~post20#1, thread6Thread1of1ForFork3_thidvar0, thread6Thread1of1ForFork3_plus_#in~b#1, thread6Thread1of1ForFork3_thidvar3, thread6Thread1of1ForFork3_thidvar2, thread6Thread1of1ForFork3_#res#1.base, thread6Thread1of1ForFork3_thidvar4, thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork3_plus_~b#1, thread6Thread1of1ForFork3_plus_#res#1, thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][157], [Black: 257#(and (= ~s_6~0 ~s_2~0) (= ~s_6~0 0)), 114#L93-1true, Black: 254#(= ~s_6~0 0), 262#(= ~s_2~0 0), 102#L144-4true, 134#thread3EXITtrue, Black: 265#(and (= ~s_6~0 ~s_2~0) (= ~s_2~0 0)), 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, 122#L53true, 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: 686#(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: 688#(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: 665#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store |#memory_int| |thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_349) ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_4~0))) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 307#(and (= ~i_7~0 0) (<= 1 ~n_1~0)), Black: 676#(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: 657#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store |#memory_int| |thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_349) ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_4~0))) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 682#(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: 674#(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: 312#(and (= ~i_3~0 0) (<= 1 ~n_1~0)), 123#L126true, Black: 684#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 659#(and (= ~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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 672#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 680#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 663#(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))]) [2022-12-06 05:19:29,862 INFO L382 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-12-06 05:19:29,862 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-06 05:19:29,862 INFO L385 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-06 05:19:29,862 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-06 05:19:29,920 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([981] L144-3-->L126: Formula: (and (= v_thread6Thread1of1ForFork3_thidvar3_4 0) (= v_thread6Thread1of1ForFork3_thidvar1_4 0) (= v_thread6Thread1of1ForFork3_thidvar4_4 0) (= v_thread6Thread1of1ForFork3_thidvar0_4 |v_thread4Thread1of1ForFork0_#t~pre25_10|) (= v_thread6Thread1of1ForFork3_thidvar2_4 0)) InVars {thread4Thread1of1ForFork0_#t~pre25=|v_thread4Thread1of1ForFork0_#t~pre25_10|} OutVars{thread6Thread1of1ForFork3_#t~mem21#1=|v_thread6Thread1of1ForFork3_#t~mem21#1_6|, thread6Thread1of1ForFork3_#t~ret22#1=|v_thread6Thread1of1ForFork3_#t~ret22#1_6|, thread6Thread1of1ForFork3_#t~nondet19#1=|v_thread6Thread1of1ForFork3_#t~nondet19#1_12|, thread6Thread1of1ForFork3_#res#1.offset=|v_thread6Thread1of1ForFork3_#res#1.offset_6|, thread6Thread1of1ForFork3_plus_~a#1=|v_thread6Thread1of1ForFork3_plus_~a#1_6|, thread6Thread1of1ForFork3_plus_#in~a#1=|v_thread6Thread1of1ForFork3_plus_#in~a#1_6|, thread6Thread1of1ForFork3_thidvar1=v_thread6Thread1of1ForFork3_thidvar1_4, thread6Thread1of1ForFork3_#t~post20#1=|v_thread6Thread1of1ForFork3_#t~post20#1_6|, thread6Thread1of1ForFork3_thidvar0=v_thread6Thread1of1ForFork3_thidvar0_4, thread6Thread1of1ForFork3_plus_#in~b#1=|v_thread6Thread1of1ForFork3_plus_#in~b#1_6|, thread6Thread1of1ForFork3_thidvar3=v_thread6Thread1of1ForFork3_thidvar3_4, thread6Thread1of1ForFork3_thidvar2=v_thread6Thread1of1ForFork3_thidvar2_4, thread6Thread1of1ForFork3_#res#1.base=|v_thread6Thread1of1ForFork3_#res#1.base_6|, thread6Thread1of1ForFork3_thidvar4=v_thread6Thread1of1ForFork3_thidvar4_4, thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1_10|, thread6Thread1of1ForFork3_plus_~b#1=|v_thread6Thread1of1ForFork3_plus_~b#1_6|, thread4Thread1of1ForFork0_#t~pre25=|v_thread4Thread1of1ForFork0_#t~pre25_10|, thread6Thread1of1ForFork3_plus_#res#1=|v_thread6Thread1of1ForFork3_plus_#res#1_6|, thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_10|} AuxVars[] AssignedVars[thread6Thread1of1ForFork3_#t~mem21#1, thread6Thread1of1ForFork3_#t~ret22#1, thread6Thread1of1ForFork3_#t~nondet19#1, thread6Thread1of1ForFork3_#res#1.offset, thread6Thread1of1ForFork3_plus_~a#1, thread6Thread1of1ForFork3_plus_#in~a#1, thread6Thread1of1ForFork3_thidvar1, thread6Thread1of1ForFork3_#t~post20#1, thread6Thread1of1ForFork3_thidvar0, thread6Thread1of1ForFork3_plus_#in~b#1, thread6Thread1of1ForFork3_thidvar3, thread6Thread1of1ForFork3_thidvar2, thread6Thread1of1ForFork3_#res#1.base, thread6Thread1of1ForFork3_thidvar4, thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork3_plus_~b#1, thread6Thread1of1ForFork3_plus_#res#1, thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][157], [Black: 257#(and (= ~s_6~0 ~s_2~0) (= ~s_6~0 0)), 154#L56true, Black: 254#(= ~s_6~0 0), 114#L93-1true, 102#L144-4true, 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, 252#true, 57#thread5EXITtrue, 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: 686#(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: 688#(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: 665#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store |#memory_int| |thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_349) ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_4~0))) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 307#(and (= ~i_7~0 0) (<= 1 ~n_1~0)), Black: 676#(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: 657#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store |#memory_int| |thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_349) ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_4~0))) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 682#(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: 674#(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: 312#(and (= ~i_3~0 0) (<= 1 ~n_1~0)), Black: 684#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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)), 123#L126true, Black: 659#(and (= ~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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 672#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 680#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 663#(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))]) [2022-12-06 05:19:29,920 INFO L382 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-06 05:19:29,920 INFO L385 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-06 05:19:29,920 INFO L385 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-06 05:19:29,920 INFO L385 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-06 05:19:29,921 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([981] L144-3-->L126: Formula: (and (= v_thread6Thread1of1ForFork3_thidvar3_4 0) (= v_thread6Thread1of1ForFork3_thidvar1_4 0) (= v_thread6Thread1of1ForFork3_thidvar4_4 0) (= v_thread6Thread1of1ForFork3_thidvar0_4 |v_thread4Thread1of1ForFork0_#t~pre25_10|) (= v_thread6Thread1of1ForFork3_thidvar2_4 0)) InVars {thread4Thread1of1ForFork0_#t~pre25=|v_thread4Thread1of1ForFork0_#t~pre25_10|} OutVars{thread6Thread1of1ForFork3_#t~mem21#1=|v_thread6Thread1of1ForFork3_#t~mem21#1_6|, thread6Thread1of1ForFork3_#t~ret22#1=|v_thread6Thread1of1ForFork3_#t~ret22#1_6|, thread6Thread1of1ForFork3_#t~nondet19#1=|v_thread6Thread1of1ForFork3_#t~nondet19#1_12|, thread6Thread1of1ForFork3_#res#1.offset=|v_thread6Thread1of1ForFork3_#res#1.offset_6|, thread6Thread1of1ForFork3_plus_~a#1=|v_thread6Thread1of1ForFork3_plus_~a#1_6|, thread6Thread1of1ForFork3_plus_#in~a#1=|v_thread6Thread1of1ForFork3_plus_#in~a#1_6|, thread6Thread1of1ForFork3_thidvar1=v_thread6Thread1of1ForFork3_thidvar1_4, thread6Thread1of1ForFork3_#t~post20#1=|v_thread6Thread1of1ForFork3_#t~post20#1_6|, thread6Thread1of1ForFork3_thidvar0=v_thread6Thread1of1ForFork3_thidvar0_4, thread6Thread1of1ForFork3_plus_#in~b#1=|v_thread6Thread1of1ForFork3_plus_#in~b#1_6|, thread6Thread1of1ForFork3_thidvar3=v_thread6Thread1of1ForFork3_thidvar3_4, thread6Thread1of1ForFork3_thidvar2=v_thread6Thread1of1ForFork3_thidvar2_4, thread6Thread1of1ForFork3_#res#1.base=|v_thread6Thread1of1ForFork3_#res#1.base_6|, thread6Thread1of1ForFork3_thidvar4=v_thread6Thread1of1ForFork3_thidvar4_4, thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1_10|, thread6Thread1of1ForFork3_plus_~b#1=|v_thread6Thread1of1ForFork3_plus_~b#1_6|, thread4Thread1of1ForFork0_#t~pre25=|v_thread4Thread1of1ForFork0_#t~pre25_10|, thread6Thread1of1ForFork3_plus_#res#1=|v_thread6Thread1of1ForFork3_plus_#res#1_6|, thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_10|} AuxVars[] AssignedVars[thread6Thread1of1ForFork3_#t~mem21#1, thread6Thread1of1ForFork3_#t~ret22#1, thread6Thread1of1ForFork3_#t~nondet19#1, thread6Thread1of1ForFork3_#res#1.offset, thread6Thread1of1ForFork3_plus_~a#1, thread6Thread1of1ForFork3_plus_#in~a#1, thread6Thread1of1ForFork3_thidvar1, thread6Thread1of1ForFork3_#t~post20#1, thread6Thread1of1ForFork3_thidvar0, thread6Thread1of1ForFork3_plus_#in~b#1, thread6Thread1of1ForFork3_thidvar3, thread6Thread1of1ForFork3_thidvar2, thread6Thread1of1ForFork3_#res#1.base, thread6Thread1of1ForFork3_thidvar4, thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork3_plus_~b#1, thread6Thread1of1ForFork3_plus_#res#1, thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][157], [Black: 257#(and (= ~s_6~0 ~s_2~0) (= ~s_6~0 0)), 154#L56true, Black: 254#(= ~s_6~0 0), 114#L93-1true, 102#L144-4true, 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, 252#true, 10#L105true, 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: 686#(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: 688#(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: 665#(and (= ~s_6~0 ~s_2~0) (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store |#memory_int| |thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_349) ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_4~0))) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 307#(and (= ~i_7~0 0) (<= 1 ~n_1~0)), Black: 676#(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: 657#(and (= ~X_0~0.offset 0) (<= (+ ~X_0~0.base 1) |#StackHeapBarrier|) (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store |#memory_int| |thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_349) ~X_0~0.base) (+ ~X_0~0.offset 4)) (+ ~s_2~0 ~t_4~0))) (= ~t_4~0 (select (select |#memory_int| ~X_0~0.base) (+ ~X_0~0.offset (* ~i_3~0 4)))) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 682#(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: 674#(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: 312#(and (= ~i_3~0 0) (<= 1 ~n_1~0)), Black: 684#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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)), 123#L126true, Black: 659#(and (= ~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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 672#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 680#(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) (= (+ ~X_0~0.offset (* ~i_3~0 4)) 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: 663#(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))]) [2022-12-06 05:19:29,921 INFO L382 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-06 05:19:29,921 INFO L385 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-06 05:19:29,921 INFO L385 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-06 05:19:29,921 INFO L385 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-06 05:19:30,405 INFO L130 PetriNetUnfolder]: 12471/18986 cut-off events. [2022-12-06 05:19:30,405 INFO L131 PetriNetUnfolder]: For 25486/28879 co-relation queries the response was YES. [2022-12-06 05:19:30,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68160 conditions, 18986 events. 12471/18986 cut-off events. For 25486/28879 co-relation queries the response was YES. Maximal size of possible extension queue 839. Compared 127520 event pairs, 6240 based on Foata normal form. 399/15365 useless extension candidates. Maximal degree in co-relation 67969. Up to 13078 conditions per place. [2022-12-06 05:19:30,651 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 238 transitions, 1553 flow [2022-12-06 05:19:30,651 INFO L188 LiptonReduction]: Number of co-enabled transitions 5564 [2022-12-06 05:19:30,683 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [960] L123-->L126: Formula: (let ((.cse0 (+ |v_thread6Thread1of1ForFork3_plus_~a#1_1| |v_thread6Thread1of1ForFork3_plus_~b#1_1|))) (and (not (= (ite (or (<= 0 |v_thread6Thread1of1ForFork3_plus_~b#1_1|) (<= 0 (+ |v_thread6Thread1of1ForFork3_plus_~a#1_1| |v_thread6Thread1of1ForFork3_plus_~b#1_1| 2147483648))) 1 0) 0)) (= |v_thread6Thread1of1ForFork3_plus_~a#1_1| |v_thread6Thread1of1ForFork3_plus_#in~a#1_1|) (= |v_thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_5| |v_thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1_5|) (<= 0 (+ |v_thread6Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (= |v_thread6Thread1of1ForFork3_plus_#in~b#1_1| v_~t_9~0_17) (= v_~s_6~0_47 |v_thread6Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread6Thread1of1ForFork3_plus_~b#1_1| 0)) 1 0)) (= |v_thread6Thread1of1ForFork3_plus_#in~a#1_1| v_~s_6~0_48) (not (= |v_thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1_5| 0)) (<= |v_thread6Thread1of1ForFork3_plus_#res#1_1| 2147483647) (= |v_thread6Thread1of1ForFork3_plus_~b#1_1| |v_thread6Thread1of1ForFork3_plus_#in~b#1_1|) (= .cse0 |v_thread6Thread1of1ForFork3_plus_#res#1_1|))) InVars {~s_6~0=v_~s_6~0_48, ~t_9~0=v_~t_9~0_17} OutVars{~s_6~0=v_~s_6~0_47, thread6Thread1of1ForFork3_plus_#in~b#1=|v_thread6Thread1of1ForFork3_plus_#in~b#1_1|, thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1_5|, thread6Thread1of1ForFork3_plus_~b#1=|v_thread6Thread1of1ForFork3_plus_~b#1_1|, ~t_9~0=v_~t_9~0_17, thread6Thread1of1ForFork3_#t~ret22#1=|v_thread6Thread1of1ForFork3_#t~ret22#1_1|, thread6Thread1of1ForFork3_plus_#res#1=|v_thread6Thread1of1ForFork3_plus_#res#1_1|, thread6Thread1of1ForFork3_plus_~a#1=|v_thread6Thread1of1ForFork3_plus_~a#1_1|, thread6Thread1of1ForFork3_plus_#in~a#1=|v_thread6Thread1of1ForFork3_plus_#in~a#1_1|, thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[~s_6~0, thread6Thread1of1ForFork3_plus_#in~b#1, thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork3_plus_~b#1, thread6Thread1of1ForFork3_#t~ret22#1, thread6Thread1of1ForFork3_plus_#res#1, thread6Thread1of1ForFork3_plus_~a#1, thread6Thread1of1ForFork3_plus_#in~a#1, thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1] [2022-12-06 05:19:30,850 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [1167] L108-->thread5EXIT: Formula: (and (= |v_thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_8| (ite (not (< v_~i_7~0_In_8 v_~n_1~0_In_20)) 1 0)) (not (= |v_thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_8| 0)) (= (mod |v_thread5Thread1of1ForFork1_#t~nondet15#1_In_1| 256) 0) (= |v_thread5Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread5Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= |v_thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_8| |v_thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_8|)) InVars {thread5Thread1of1ForFork1_#t~nondet15#1=|v_thread5Thread1of1ForFork1_#t~nondet15#1_In_1|, ~n_1~0=v_~n_1~0_In_20, ~i_7~0=v_~i_7~0_In_8} OutVars{thread5Thread1of1ForFork1_#res#1.offset=|v_thread5Thread1of1ForFork1_#res#1.offset_Out_4|, thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_8|, ~n_1~0=v_~n_1~0_In_20, thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_8|, thread5Thread1of1ForFork1_#res#1.base=|v_thread5Thread1of1ForFork1_#res#1.base_Out_4|, ~i_7~0=v_~i_7~0_In_8} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#res#1.offset, thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork1_#t~nondet15#1, thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread5Thread1of1ForFork1_#res#1.base] [2022-12-06 05:19:30,946 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [916] L136-->L136-1: Formula: (and (= (select |v_#valid_16| |v_thread4Thread1of1ForFork0_~#t6~0.base_1|) 0) (= |v_#length_7| (store |v_#length_8| |v_thread4Thread1of1ForFork0_~#t6~0.base_1| 4)) (not (= |v_thread4Thread1of1ForFork0_~#t6~0.base_1| 0)) (= |v_thread4Thread1of1ForFork0_~#t6~0.offset_1| 0) (< |v_#StackHeapBarrier_4| |v_thread4Thread1of1ForFork0_~#t6~0.base_1|) (= (store |v_#valid_16| |v_thread4Thread1of1ForFork0_~#t6~0.base_1| 1) |v_#valid_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_8|, #valid=|v_#valid_16|} OutVars{thread4Thread1of1ForFork0_~#t6~0.base=|v_thread4Thread1of1ForFork0_~#t6~0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_7|, thread4Thread1of1ForFork0_~#t6~0.offset=|v_thread4Thread1of1ForFork0_~#t6~0.offset_1|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_~#t6~0.offset, #valid, thread4Thread1of1ForFork0_~#t6~0.base, #length] [2022-12-06 05:19:31,011 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [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] [2022-12-06 05:19:31,087 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [1097] L143-3-->L144-1: Formula: (= |v_#pthreadsForks_95| |v_thread4Thread1of1ForFork0_#t~pre25_17|) InVars {#pthreadsForks=|v_#pthreadsForks_95|} OutVars{thread4Thread1of1ForFork0_#t~pre23=|v_thread4Thread1of1ForFork0_#t~pre23_15|, thread4Thread1of1ForFork0_#t~nondet24=|v_thread4Thread1of1ForFork0_#t~nondet24_7|, #pthreadsForks=|v_#pthreadsForks_95|, thread4Thread1of1ForFork0_#t~pre25=|v_thread4Thread1of1ForFork0_#t~pre25_17|} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#t~pre23, thread4Thread1of1ForFork0_#t~nondet24, thread4Thread1of1ForFork0_#t~pre25] [2022-12-06 05:19:31,122 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [1008] L91-3-->L92-1: Formula: (= |v_thread1Thread1of1ForFork5_#t~pre11_11| |v_#pthreadsForks_19|) InVars {#pthreadsForks=|v_#pthreadsForks_19|} OutVars{thread1Thread1of1ForFork5_#t~nondet10=|v_thread1Thread1of1ForFork5_#t~nondet10_7|, thread1Thread1of1ForFork5_#t~pre9=|v_thread1Thread1of1ForFork5_#t~pre9_13|, #pthreadsForks=|v_#pthreadsForks_19|, thread1Thread1of1ForFork5_#t~pre11=|v_thread1Thread1of1ForFork5_#t~pre11_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_#t~nondet10, thread1Thread1of1ForFork5_#t~pre9, thread1Thread1of1ForFork5_#t~pre11] [2022-12-06 05:19:31,158 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [1060] L145-2-->L146-1: Formula: (= (select (select |v_#memory_int_91| |v_thread4Thread1of1ForFork0_~#t6~0.base_27|) |v_thread4Thread1of1ForFork0_~#t6~0.offset_19|) |v_thread4Thread1of1ForFork0_#t~mem28_11|) InVars {thread4Thread1of1ForFork0_~#t6~0.offset=|v_thread4Thread1of1ForFork0_~#t6~0.offset_19|, #memory_int=|v_#memory_int_91|, thread4Thread1of1ForFork0_~#t6~0.base=|v_thread4Thread1of1ForFork0_~#t6~0.base_27|} OutVars{thread4Thread1of1ForFork0_~#t6~0.offset=|v_thread4Thread1of1ForFork0_~#t6~0.offset_19|, thread4Thread1of1ForFork0_#t~mem28=|v_thread4Thread1of1ForFork0_#t~mem28_11|, #memory_int=|v_#memory_int_91|, thread4Thread1of1ForFork0_~#t6~0.base=|v_thread4Thread1of1ForFork0_~#t6~0.base_27|, thread4Thread1of1ForFork0_#t~mem27=|v_thread4Thread1of1ForFork0_#t~mem27_11|} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#t~mem28, thread4Thread1of1ForFork0_#t~mem27] [2022-12-06 05:19:31,195 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [1119] L92-4-->L93-1: Formula: (= |v_thread1Thread1of1ForFork5_#t~mem13_13| (select (select |v_#memory_int_133| |v_thread1Thread1of1ForFork5_~#t2~0.base_33|) |v_thread1Thread1of1ForFork5_~#t2~0.offset_25|)) InVars {thread1Thread1of1ForFork5_~#t2~0.offset=|v_thread1Thread1of1ForFork5_~#t2~0.offset_25|, #memory_int=|v_#memory_int_133|, thread1Thread1of1ForFork5_~#t2~0.base=|v_thread1Thread1of1ForFork5_~#t2~0.base_33|} OutVars{thread1Thread1of1ForFork5_#t~nondet12=|v_thread1Thread1of1ForFork5_#t~nondet12_7|, thread1Thread1of1ForFork5_~#t2~0.offset=|v_thread1Thread1of1ForFork5_~#t2~0.offset_25|, thread1Thread1of1ForFork5_#t~pre11=|v_thread1Thread1of1ForFork5_#t~pre11_19|, #memory_int=|v_#memory_int_133|, thread1Thread1of1ForFork5_#t~mem13=|v_thread1Thread1of1ForFork5_#t~mem13_13|, thread1Thread1of1ForFork5_~#t2~0.base=|v_thread1Thread1of1ForFork5_~#t2~0.base_33|} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_#t~nondet12, thread1Thread1of1ForFork5_#t~pre11, thread1Thread1of1ForFork5_#t~mem13] [2022-12-06 05:19:31,231 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [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] [2022-12-06 05:19:31,567 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [1099] L146-2-->L136-4: Formula: (and (= |v_thread4Thread1of1ForFork0_#res.offset_15| 0) (= (store |v_#valid_165| |v_thread4Thread1of1ForFork0_~#t5~0.base_28| 0) |v_#valid_164|) (= |v_thread4Thread1of1ForFork0_#res.base_15| 0)) InVars {thread4Thread1of1ForFork0_~#t5~0.base=|v_thread4Thread1of1ForFork0_~#t5~0.base_28|, #valid=|v_#valid_165|} OutVars{thread4Thread1of1ForFork0_#res.base=|v_thread4Thread1of1ForFork0_#res.base_15|, thread4Thread1of1ForFork0_#res.offset=|v_thread4Thread1of1ForFork0_#res.offset_15|, thread4Thread1of1ForFork0_~#t5~0.offset=|v_thread4Thread1of1ForFork0_~#t5~0.offset_11|, #valid=|v_#valid_164|, thread4Thread1of1ForFork0_#t~mem28=|v_thread4Thread1of1ForFork0_#t~mem28_25|} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res.base, thread4Thread1of1ForFork0_~#t5~0.base, thread4Thread1of1ForFork0_#res.offset, thread4Thread1of1ForFork0_~#t5~0.offset, #valid, thread4Thread1of1ForFork0_#t~mem28] [2022-12-06 05:19:31,619 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [1009] L136-1-->L143: Formula: (and (= v_~s_6~0_51 0) (= |v_#pthreadsForks_21| |v_thread4Thread1of1ForFork0_#t~pre23_11|) (= v_~i_7~0_84 0)) InVars {#pthreadsForks=|v_#pthreadsForks_21|} OutVars{thread4Thread1of1ForFork0_#t~pre23=|v_thread4Thread1of1ForFork0_#t~pre23_11|, ~s_6~0=v_~s_6~0_51, #pthreadsForks=|v_#pthreadsForks_21|, ~i_7~0=v_~i_7~0_84} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#t~pre23, ~s_6~0, ~i_7~0] [2022-12-06 05:19:31,680 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [1172] L74-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork4_#t~nondet5#1_In_1| 256) 0) (= |v_thread3Thread1of1ForFork4_#res#1.offset_Out_6| 0) (= |v_thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_Out_6| (ite (not (< v_~i_3~0_In_8 v_~n_1~0_In_24)) 1 0)) (= |v_thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_Out_6| |v_thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread3Thread1of1ForFork4_#res#1.base_Out_6| 0) (not (= |v_thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1_Out_6| 0))) InVars {~i_3~0=v_~i_3~0_In_8, thread3Thread1of1ForFork4_#t~nondet5#1=|v_thread3Thread1of1ForFork4_#t~nondet5#1_In_1|, ~n_1~0=v_~n_1~0_In_24} OutVars{~i_3~0=v_~i_3~0_In_8, thread3Thread1of1ForFork4_#res#1.base=|v_thread3Thread1of1ForFork4_#res#1.base_Out_6|, ~n_1~0=v_~n_1~0_In_24, thread3Thread1of1ForFork4_#res#1.offset=|v_thread3Thread1of1ForFork4_#res#1.offset_Out_6|, thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1_Out_6|, thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_#t~nondet5#1, thread3Thread1of1ForFork4_#res#1.base, thread3Thread1of1ForFork4_#res#1.offset, thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1] [2022-12-06 05:19:31,788 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] 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-06 05:19:31,896 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] 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-06 05:19:31,934 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [1164] L144-4-->L145-1: Formula: (= (select (select |v_#memory_int_185| |v_thread4Thread1of1ForFork0_~#t5~0.base_49|) |v_thread4Thread1of1ForFork0_~#t5~0.offset_27|) |v_thread4Thread1of1ForFork0_#t~mem27_17|) InVars {thread4Thread1of1ForFork0_~#t5~0.base=|v_thread4Thread1of1ForFork0_~#t5~0.base_49|, thread4Thread1of1ForFork0_~#t5~0.offset=|v_thread4Thread1of1ForFork0_~#t5~0.offset_27|, #memory_int=|v_#memory_int_185|} OutVars{thread4Thread1of1ForFork0_~#t5~0.base=|v_thread4Thread1of1ForFork0_~#t5~0.base_49|, thread4Thread1of1ForFork0_#t~nondet26=|v_thread4Thread1of1ForFork0_#t~nondet26_7|, thread4Thread1of1ForFork0_~#t5~0.offset=|v_thread4Thread1of1ForFork0_~#t5~0.offset_27|, thread4Thread1of1ForFork0_#t~pre25=|v_thread4Thread1of1ForFork0_#t~pre25_21|, #memory_int=|v_#memory_int_185|, thread4Thread1of1ForFork0_#t~mem27=|v_thread4Thread1of1ForFork0_#t~mem27_17|} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#t~nondet26, thread4Thread1of1ForFork0_#t~pre25, thread4Thread1of1ForFork0_#t~mem27] [2022-12-06 05:19:31,970 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [1169] L126-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork3_#res#1.offset_Out_4| 0) (= (mod |v_thread6Thread1of1ForFork3_#t~nondet19#1_In_1| 256) 0) (not (= |v_thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1_Out_10| 0)) (= 0 |v_thread6Thread1of1ForFork3_#res#1.base_Out_4|) (= |v_thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_Out_10| |v_thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1_Out_10|) (= (ite (not (< v_~i_7~0_In_10 v_~n_1~0_In_22)) 1 0) |v_thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_Out_10|)) InVars {~n_1~0=v_~n_1~0_In_22, thread6Thread1of1ForFork3_#t~nondet19#1=|v_thread6Thread1of1ForFork3_#t~nondet19#1_In_1|, ~i_7~0=v_~i_7~0_In_10} OutVars{thread6Thread1of1ForFork3_#res#1.base=|v_thread6Thread1of1ForFork3_#res#1.base_Out_4|, thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1_Out_10|, ~n_1~0=v_~n_1~0_In_22, thread6Thread1of1ForFork3_#res#1.offset=|v_thread6Thread1of1ForFork3_#res#1.offset_Out_4|, thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_Out_10|, ~i_7~0=v_~i_7~0_In_10} 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] [2022-12-06 05:19:32,087 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [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] [2022-12-06 05:19:32,164 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] 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-06 05:19:32,213 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [1172] L74-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork4_#t~nondet5#1_In_1| 256) 0) (= |v_thread3Thread1of1ForFork4_#res#1.offset_Out_6| 0) (= |v_thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_Out_6| (ite (not (< v_~i_3~0_In_8 v_~n_1~0_In_24)) 1 0)) (= |v_thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_Out_6| |v_thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread3Thread1of1ForFork4_#res#1.base_Out_6| 0) (not (= |v_thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1_Out_6| 0))) InVars {~i_3~0=v_~i_3~0_In_8, thread3Thread1of1ForFork4_#t~nondet5#1=|v_thread3Thread1of1ForFork4_#t~nondet5#1_In_1|, ~n_1~0=v_~n_1~0_In_24} OutVars{~i_3~0=v_~i_3~0_In_8, thread3Thread1of1ForFork4_#res#1.base=|v_thread3Thread1of1ForFork4_#res#1.base_Out_6|, ~n_1~0=v_~n_1~0_In_24, thread3Thread1of1ForFork4_#res#1.offset=|v_thread3Thread1of1ForFork4_#res#1.offset_Out_6|, thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1_Out_6|, thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_#t~nondet5#1, thread3Thread1of1ForFork4_#res#1.base, thread3Thread1of1ForFork4_#res#1.offset, thread3Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork4_assume_abort_if_not_#in~cond#1] [2022-12-06 05:19:32,327 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [960] L123-->L126: Formula: (let ((.cse0 (+ |v_thread6Thread1of1ForFork3_plus_~a#1_1| |v_thread6Thread1of1ForFork3_plus_~b#1_1|))) (and (not (= (ite (or (<= 0 |v_thread6Thread1of1ForFork3_plus_~b#1_1|) (<= 0 (+ |v_thread6Thread1of1ForFork3_plus_~a#1_1| |v_thread6Thread1of1ForFork3_plus_~b#1_1| 2147483648))) 1 0) 0)) (= |v_thread6Thread1of1ForFork3_plus_~a#1_1| |v_thread6Thread1of1ForFork3_plus_#in~a#1_1|) (= |v_thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_5| |v_thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1_5|) (<= 0 (+ |v_thread6Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (= |v_thread6Thread1of1ForFork3_plus_#in~b#1_1| v_~t_9~0_17) (= v_~s_6~0_47 |v_thread6Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread6Thread1of1ForFork3_plus_~b#1_1| 0)) 1 0)) (= |v_thread6Thread1of1ForFork3_plus_#in~a#1_1| v_~s_6~0_48) (not (= |v_thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1_5| 0)) (<= |v_thread6Thread1of1ForFork3_plus_#res#1_1| 2147483647) (= |v_thread6Thread1of1ForFork3_plus_~b#1_1| |v_thread6Thread1of1ForFork3_plus_#in~b#1_1|) (= .cse0 |v_thread6Thread1of1ForFork3_plus_#res#1_1|))) InVars {~s_6~0=v_~s_6~0_48, ~t_9~0=v_~t_9~0_17} OutVars{~s_6~0=v_~s_6~0_47, thread6Thread1of1ForFork3_plus_#in~b#1=|v_thread6Thread1of1ForFork3_plus_#in~b#1_1|, thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1_5|, thread6Thread1of1ForFork3_plus_~b#1=|v_thread6Thread1of1ForFork3_plus_~b#1_1|, ~t_9~0=v_~t_9~0_17, thread6Thread1of1ForFork3_#t~ret22#1=|v_thread6Thread1of1ForFork3_#t~ret22#1_1|, thread6Thread1of1ForFork3_plus_#res#1=|v_thread6Thread1of1ForFork3_plus_#res#1_1|, thread6Thread1of1ForFork3_plus_~a#1=|v_thread6Thread1of1ForFork3_plus_~a#1_1|, thread6Thread1of1ForFork3_plus_#in~a#1=|v_thread6Thread1of1ForFork3_plus_#in~a#1_1|, thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[~s_6~0, thread6Thread1of1ForFork3_plus_#in~b#1, thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork3_plus_~b#1, thread6Thread1of1ForFork3_#t~ret22#1, thread6Thread1of1ForFork3_plus_#res#1, thread6Thread1of1ForFork3_plus_~a#1, thread6Thread1of1ForFork3_plus_#in~a#1, thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1] [2022-12-06 05:19:32,496 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [920] L143-1-->L143-2: Formula: (= (store |v_#memory_int_11| |v_thread4Thread1of1ForFork0_~#t5~0.base_3| (store (select |v_#memory_int_11| |v_thread4Thread1of1ForFork0_~#t5~0.base_3|) |v_thread4Thread1of1ForFork0_~#t5~0.offset_3| |v_thread4Thread1of1ForFork0_#t~pre23_3|)) |v_#memory_int_10|) InVars {thread4Thread1of1ForFork0_#t~pre23=|v_thread4Thread1of1ForFork0_#t~pre23_3|, #memory_int=|v_#memory_int_11|, thread4Thread1of1ForFork0_~#t5~0.base=|v_thread4Thread1of1ForFork0_~#t5~0.base_3|, thread4Thread1of1ForFork0_~#t5~0.offset=|v_thread4Thread1of1ForFork0_~#t5~0.offset_3|} OutVars{thread4Thread1of1ForFork0_#t~pre23=|v_thread4Thread1of1ForFork0_#t~pre23_3|, #memory_int=|v_#memory_int_10|, thread4Thread1of1ForFork0_~#t5~0.base=|v_thread4Thread1of1ForFork0_~#t5~0.base_3|, thread4Thread1of1ForFork0_~#t5~0.offset=|v_thread4Thread1of1ForFork0_~#t5~0.offset_3|} AuxVars[] AssignedVars[#memory_int] [2022-12-06 05:19:32,536 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] 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-06 05:19:32,634 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [1167] L108-->thread5EXIT: Formula: (and (= |v_thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_8| (ite (not (< v_~i_7~0_In_8 v_~n_1~0_In_20)) 1 0)) (not (= |v_thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_8| 0)) (= (mod |v_thread5Thread1of1ForFork1_#t~nondet15#1_In_1| 256) 0) (= |v_thread5Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread5Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= |v_thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_8| |v_thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_8|)) InVars {thread5Thread1of1ForFork1_#t~nondet15#1=|v_thread5Thread1of1ForFork1_#t~nondet15#1_In_1|, ~n_1~0=v_~n_1~0_In_20, ~i_7~0=v_~i_7~0_In_8} OutVars{thread5Thread1of1ForFork1_#res#1.offset=|v_thread5Thread1of1ForFork1_#res#1.offset_Out_4|, thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_8|, ~n_1~0=v_~n_1~0_In_20, thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_8|, thread5Thread1of1ForFork1_#res#1.base=|v_thread5Thread1of1ForFork1_#res#1.base_Out_4|, ~i_7~0=v_~i_7~0_In_8} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#res#1.offset, thread5Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork1_#t~nondet15#1, thread5Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread5Thread1of1ForFork1_#res#1.base] [2022-12-06 05:19:33,007 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [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] [2022-12-06 05:19:33,088 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [1097] L143-3-->L144-1: Formula: (= |v_#pthreadsForks_95| |v_thread4Thread1of1ForFork0_#t~pre25_17|) InVars {#pthreadsForks=|v_#pthreadsForks_95|} OutVars{thread4Thread1of1ForFork0_#t~pre23=|v_thread4Thread1of1ForFork0_#t~pre23_15|, thread4Thread1of1ForFork0_#t~nondet24=|v_thread4Thread1of1ForFork0_#t~nondet24_7|, #pthreadsForks=|v_#pthreadsForks_95|, thread4Thread1of1ForFork0_#t~pre25=|v_thread4Thread1of1ForFork0_#t~pre25_17|} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#t~pre23, thread4Thread1of1ForFork0_#t~nondet24, thread4Thread1of1ForFork0_#t~pre25] [2022-12-06 05:19:33,128 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [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] [2022-12-06 05:19:33,209 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [1164] L144-4-->L145-1: Formula: (= (select (select |v_#memory_int_185| |v_thread4Thread1of1ForFork0_~#t5~0.base_49|) |v_thread4Thread1of1ForFork0_~#t5~0.offset_27|) |v_thread4Thread1of1ForFork0_#t~mem27_17|) InVars {thread4Thread1of1ForFork0_~#t5~0.base=|v_thread4Thread1of1ForFork0_~#t5~0.base_49|, thread4Thread1of1ForFork0_~#t5~0.offset=|v_thread4Thread1of1ForFork0_~#t5~0.offset_27|, #memory_int=|v_#memory_int_185|} OutVars{thread4Thread1of1ForFork0_~#t5~0.base=|v_thread4Thread1of1ForFork0_~#t5~0.base_49|, thread4Thread1of1ForFork0_#t~nondet26=|v_thread4Thread1of1ForFork0_#t~nondet26_7|, thread4Thread1of1ForFork0_~#t5~0.offset=|v_thread4Thread1of1ForFork0_~#t5~0.offset_27|, thread4Thread1of1ForFork0_#t~pre25=|v_thread4Thread1of1ForFork0_#t~pre25_21|, #memory_int=|v_#memory_int_185|, thread4Thread1of1ForFork0_#t~mem27=|v_thread4Thread1of1ForFork0_#t~mem27_17|} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#t~nondet26, thread4Thread1of1ForFork0_#t~pre25, thread4Thread1of1ForFork0_#t~mem27] [2022-12-06 05:19:33,264 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [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] [2022-12-06 05:19:33,342 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [1008] L91-3-->L92-1: Formula: (= |v_thread1Thread1of1ForFork5_#t~pre11_11| |v_#pthreadsForks_19|) InVars {#pthreadsForks=|v_#pthreadsForks_19|} OutVars{thread1Thread1of1ForFork5_#t~nondet10=|v_thread1Thread1of1ForFork5_#t~nondet10_7|, thread1Thread1of1ForFork5_#t~pre9=|v_thread1Thread1of1ForFork5_#t~pre9_13|, #pthreadsForks=|v_#pthreadsForks_19|, thread1Thread1of1ForFork5_#t~pre11=|v_thread1Thread1of1ForFork5_#t~pre11_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_#t~nondet10, thread1Thread1of1ForFork5_#t~pre9, thread1Thread1of1ForFork5_#t~pre11] [2022-12-06 05:19:33,398 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] 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-06 05:19:33,462 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [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] [2022-12-06 05:19:33,636 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [1060] L145-2-->L146-1: Formula: (= (select (select |v_#memory_int_91| |v_thread4Thread1of1ForFork0_~#t6~0.base_27|) |v_thread4Thread1of1ForFork0_~#t6~0.offset_19|) |v_thread4Thread1of1ForFork0_#t~mem28_11|) InVars {thread4Thread1of1ForFork0_~#t6~0.offset=|v_thread4Thread1of1ForFork0_~#t6~0.offset_19|, #memory_int=|v_#memory_int_91|, thread4Thread1of1ForFork0_~#t6~0.base=|v_thread4Thread1of1ForFork0_~#t6~0.base_27|} OutVars{thread4Thread1of1ForFork0_~#t6~0.offset=|v_thread4Thread1of1ForFork0_~#t6~0.offset_19|, thread4Thread1of1ForFork0_#t~mem28=|v_thread4Thread1of1ForFork0_#t~mem28_11|, #memory_int=|v_#memory_int_91|, thread4Thread1of1ForFork0_~#t6~0.base=|v_thread4Thread1of1ForFork0_~#t6~0.base_27|, thread4Thread1of1ForFork0_#t~mem27=|v_thread4Thread1of1ForFork0_#t~mem27_11|} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#t~mem28, thread4Thread1of1ForFork0_#t~mem27] [2022-12-06 05:19:33,672 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [1169] L126-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork3_#res#1.offset_Out_4| 0) (= (mod |v_thread6Thread1of1ForFork3_#t~nondet19#1_In_1| 256) 0) (not (= |v_thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1_Out_10| 0)) (= 0 |v_thread6Thread1of1ForFork3_#res#1.base_Out_4|) (= |v_thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_Out_10| |v_thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1_Out_10|) (= (ite (not (< v_~i_7~0_In_10 v_~n_1~0_In_22)) 1 0) |v_thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_Out_10|)) InVars {~n_1~0=v_~n_1~0_In_22, thread6Thread1of1ForFork3_#t~nondet19#1=|v_thread6Thread1of1ForFork3_#t~nondet19#1_In_1|, ~i_7~0=v_~i_7~0_In_10} OutVars{thread6Thread1of1ForFork3_#res#1.base=|v_thread6Thread1of1ForFork3_#res#1.base_Out_4|, thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork3_assume_abort_if_not_~cond#1_Out_10|, ~n_1~0=v_~n_1~0_In_22, thread6Thread1of1ForFork3_#res#1.offset=|v_thread6Thread1of1ForFork3_#res#1.offset_Out_4|, thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_Out_10|, ~i_7~0=v_~i_7~0_In_10} 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] [2022-12-06 05:19:33,768 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] 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-06 05:19:33,807 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [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] [2022-12-06 05:19:33,882 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [1119] L92-4-->L93-1: Formula: (= |v_thread1Thread1of1ForFork5_#t~mem13_13| (select (select |v_#memory_int_133| |v_thread1Thread1of1ForFork5_~#t2~0.base_33|) |v_thread1Thread1of1ForFork5_~#t2~0.offset_25|)) InVars {thread1Thread1of1ForFork5_~#t2~0.offset=|v_thread1Thread1of1ForFork5_~#t2~0.offset_25|, #memory_int=|v_#memory_int_133|, thread1Thread1of1ForFork5_~#t2~0.base=|v_thread1Thread1of1ForFork5_~#t2~0.base_33|} OutVars{thread1Thread1of1ForFork5_#t~nondet12=|v_thread1Thread1of1ForFork5_#t~nondet12_7|, thread1Thread1of1ForFork5_~#t2~0.offset=|v_thread1Thread1of1ForFork5_~#t2~0.offset_25|, thread1Thread1of1ForFork5_#t~pre11=|v_thread1Thread1of1ForFork5_#t~pre11_19|, #memory_int=|v_#memory_int_133|, thread1Thread1of1ForFork5_#t~mem13=|v_thread1Thread1of1ForFork5_#t~mem13_13|, thread1Thread1of1ForFork5_~#t2~0.base=|v_thread1Thread1of1ForFork5_~#t2~0.base_33|} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_#t~nondet12, thread1Thread1of1ForFork5_#t~pre11, thread1Thread1of1ForFork5_#t~mem13] [2022-12-06 05:19:33,940 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-06 05:19:34,213 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-06 05:19:34,254 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-06 05:19:34,294 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-06 05:19:34,403 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:19:34,403 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5650 [2022-12-06 05:19:34,403 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 237 transitions, 1751 flow [2022-12-06 05:19:34,404 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-06 05:19:34,404 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:34,404 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:34,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 05:19:34,604 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-06 05:19:34,605 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-06 05:19:34,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:34,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1145226971, now seen corresponding path program 2 times [2022-12-06 05:19:34,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:34,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87161193] [2022-12-06 05:19:34,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:34,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:35,445 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-06 05:19:35,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:35,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87161193] [2022-12-06 05:19:35,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87161193] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:19:35,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720301340] [2022-12-06 05:19:35,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:19:35,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:19:35,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:19:35,448 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:19:35,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 05:19:35,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:19:35,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:19:35,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-06 05:19:35,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:19:35,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:19:35,834 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-06 05:19:35,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:19:35,903 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-06 05:19:35,931 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-06 05:19:35,954 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-06 05:19:35,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:19:36,153 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_423 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_422) |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_423) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) c_~s_2~0)) is different from false [2022-12-06 05:19:36,159 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_423 (Array Int Int)) (v_ArrVal_422 (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_422) |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_423) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) is different from false [2022-12-06 05:19:36,170 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_135| Int)) (or (forall ((v_ArrVal_423 (Array Int Int)) (v_ArrVal_422 (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_422) |v_thread4Thread1of1ForFork0_~#t6~0.base_135| v_ArrVal_423) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_135|)))) is different from false [2022-12-06 05:19:37,092 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_119| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_135| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_135|)) (forall ((v_ArrVal_423 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_119| v_ArrVal_422) |v_thread4Thread1of1ForFork0_~#t6~0.base_135| v_ArrVal_423) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_119|)))) is different from false [2022-12-06 05:19:37,112 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:19:37,112 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 218 treesize of output 144 [2022-12-06 05:19:37,116 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 134 treesize of output 118 [2022-12-06 05:19:37,120 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 118 treesize of output 110 [2022-12-06 05:19:37,267 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-06 05:19:37,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720301340] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:19:37,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:19:37,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 30 [2022-12-06 05:19:37,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099210826] [2022-12-06 05:19:37,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:19:37,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-06 05:19:37,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:37,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-06 05:19:37,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=661, Unknown=11, NotChecked=220, Total=992 [2022-12-06 05:19:37,269 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 104 [2022-12-06 05:19:37,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 237 transitions, 1751 flow. Second operand has 32 states, 32 states have (on average 8.75) internal successors, (280), 32 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:37,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:37,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 104 [2022-12-06 05:19:37,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand