./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0307f20ae0363cc6fed70ae0937c5000167639ab486b68a523e3313ccdd28e28 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 00:40:40,431 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 00:40:40,433 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 00:40:40,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 00:40:40,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 00:40:40,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 00:40:40,468 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 00:40:40,470 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 00:40:40,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 00:40:40,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 00:40:40,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 00:40:40,478 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 00:40:40,479 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 00:40:40,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 00:40:40,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 00:40:40,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 00:40:40,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 00:40:40,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 00:40:40,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 00:40:40,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 00:40:40,490 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 00:40:40,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 00:40:40,501 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 00:40:40,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 00:40:40,506 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 00:40:40,506 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 00:40:40,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 00:40:40,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 00:40:40,508 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 00:40:40,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 00:40:40,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 00:40:40,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 00:40:40,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 00:40:40,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 00:40:40,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 00:40:40,512 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 00:40:40,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 00:40:40,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 00:40:40,513 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 00:40:40,514 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 00:40:40,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 00:40:40,515 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 00:40:40,538 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 00:40:40,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 00:40:40,539 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 00:40:40,539 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 00:40:40,540 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 00:40:40,540 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 00:40:40,541 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 00:40:40,541 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 00:40:40,541 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 00:40:40,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 00:40:40,542 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 00:40:40,542 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 00:40:40,542 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 00:40:40,542 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 00:40:40,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 00:40:40,542 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 00:40:40,543 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 00:40:40,543 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 00:40:40,543 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 00:40:40,543 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 00:40:40,543 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 00:40:40,543 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 00:40:40,543 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 00:40:40,544 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 00:40:40,544 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 00:40:40,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 00:40:40,544 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 00:40:40,544 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 00:40:40,544 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 00:40:40,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 00:40:40,545 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 00:40:40,545 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 00:40:40,545 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 00:40:40,545 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 00:40:40,545 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0307f20ae0363cc6fed70ae0937c5000167639ab486b68a523e3313ccdd28e28 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 00:40:40,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 00:40:40,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 00:40:40,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 00:40:40,791 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 00:40:40,791 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 00:40:40,792 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2023-08-30 00:40:41,641 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 00:40:41,816 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 00:40:41,817 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2023-08-30 00:40:41,822 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6370fd9f7/029a4d6a44a94e73adff983258a41ace/FLAG33a91f0b0 [2023-08-30 00:40:41,837 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6370fd9f7/029a4d6a44a94e73adff983258a41ace [2023-08-30 00:40:41,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 00:40:41,846 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 00:40:41,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 00:40:41,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 00:40:41,850 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 00:40:41,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 12:40:41" (1/1) ... [2023-08-30 00:40:41,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58a1093e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:40:41, skipping insertion in model container [2023-08-30 00:40:41,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 12:40:41" (1/1) ... [2023-08-30 00:40:41,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 00:40:41,871 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 00:40:41,969 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2023-08-30 00:40:41,976 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 00:40:41,983 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-08-30 00:40:41,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7f98e779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:40:41, skipping insertion in model container [2023-08-30 00:40:41,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 00:40:41,984 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-08-30 00:40:41,985 INFO L158 Benchmark]: Toolchain (without parser) took 138.70ms. Allocated memory is still 79.7MB. Free memory was 58.3MB in the beginning and 48.5MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-08-30 00:40:41,985 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 58.7MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 00:40:41,985 INFO L158 Benchmark]: CACSL2BoogieTranslator took 136.37ms. Allocated memory is still 79.7MB. Free memory was 58.0MB in the beginning and 48.5MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-08-30 00:40:41,986 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 58.7MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 136.37ms. Allocated memory is still 79.7MB. Free memory was 58.0MB in the beginning and 48.5MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 99]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0307f20ae0363cc6fed70ae0937c5000167639ab486b68a523e3313ccdd28e28 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 00:40:43,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 00:40:43,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 00:40:43,300 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 00:40:43,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 00:40:43,303 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 00:40:43,305 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 00:40:43,307 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 00:40:43,309 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 00:40:43,312 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 00:40:43,313 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 00:40:43,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 00:40:43,316 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 00:40:43,318 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 00:40:43,319 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 00:40:43,321 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 00:40:43,322 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 00:40:43,323 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 00:40:43,324 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 00:40:43,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 00:40:43,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 00:40:43,329 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 00:40:43,329 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 00:40:43,330 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 00:40:43,335 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 00:40:43,336 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 00:40:43,336 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 00:40:43,337 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 00:40:43,338 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 00:40:43,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 00:40:43,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 00:40:43,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 00:40:43,347 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 00:40:43,348 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 00:40:43,349 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 00:40:43,349 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 00:40:43,350 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 00:40:43,350 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 00:40:43,350 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 00:40:43,351 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 00:40:43,351 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 00:40:43,352 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 00:40:43,379 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 00:40:43,379 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 00:40:43,380 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 00:40:43,380 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 00:40:43,381 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 00:40:43,381 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 00:40:43,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 00:40:43,381 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 00:40:43,381 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 00:40:43,381 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 00:40:43,382 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 00:40:43,382 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 00:40:43,382 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 00:40:43,382 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 00:40:43,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 00:40:43,383 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 00:40:43,383 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 00:40:43,383 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 00:40:43,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 00:40:43,383 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 00:40:43,383 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 00:40:43,383 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 00:40:43,384 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 00:40:43,384 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 00:40:43,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 00:40:43,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 00:40:43,384 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 00:40:43,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 00:40:43,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 00:40:43,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 00:40:43,385 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 00:40:43,385 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 00:40:43,385 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 00:40:43,385 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 00:40:43,385 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 00:40:43,385 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 00:40:43,386 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 00:40:43,386 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0307f20ae0363cc6fed70ae0937c5000167639ab486b68a523e3313ccdd28e28 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 00:40:43,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 00:40:43,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 00:40:43,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 00:40:43,651 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 00:40:43,651 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 00:40:43,652 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2023-08-30 00:40:44,597 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 00:40:44,769 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 00:40:44,769 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2023-08-30 00:40:44,775 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c230a7be/90a04e0971cc4ed6b6e3390dc5b1d634/FLAG8c54b797c [2023-08-30 00:40:44,783 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c230a7be/90a04e0971cc4ed6b6e3390dc5b1d634 [2023-08-30 00:40:44,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 00:40:44,786 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 00:40:44,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 00:40:44,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 00:40:44,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 00:40:44,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 12:40:44" (1/1) ... [2023-08-30 00:40:44,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7975da9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:40:44, skipping insertion in model container [2023-08-30 00:40:44,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 12:40:44" (1/1) ... [2023-08-30 00:40:44,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 00:40:44,811 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 00:40:44,910 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2023-08-30 00:40:44,916 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 00:40:44,924 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-08-30 00:40:44,926 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 00:40:44,933 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2023-08-30 00:40:44,940 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 00:40:44,946 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 00:40:44,961 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2023-08-30 00:40:44,964 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 00:40:45,004 INFO L208 MainTranslator]: Completed translation [2023-08-30 00:40:45,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:40:45 WrapperNode [2023-08-30 00:40:45,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 00:40:45,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 00:40:45,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 00:40:45,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 00:40:45,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:40:45" (1/1) ... [2023-08-30 00:40:45,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:40:45" (1/1) ... [2023-08-30 00:40:45,059 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2023-08-30 00:40:45,060 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 00:40:45,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 00:40:45,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 00:40:45,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 00:40:45,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:40:45" (1/1) ... [2023-08-30 00:40:45,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:40:45" (1/1) ... [2023-08-30 00:40:45,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:40:45" (1/1) ... [2023-08-30 00:40:45,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:40:45" (1/1) ... [2023-08-30 00:40:45,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:40:45" (1/1) ... [2023-08-30 00:40:45,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:40:45" (1/1) ... [2023-08-30 00:40:45,103 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:40:45" (1/1) ... [2023-08-30 00:40:45,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:40:45" (1/1) ... [2023-08-30 00:40:45,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 00:40:45,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 00:40:45,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 00:40:45,112 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 00:40:45,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:40:45" (1/1) ... [2023-08-30 00:40:45,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 00:40:45,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 00:40:45,146 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) [2023-08-30 00:40:45,152 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 [2023-08-30 00:40:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 00:40:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 00:40:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 00:40:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-30 00:40:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-30 00:40:45,172 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-30 00:40:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-30 00:40:45,173 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-30 00:40:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-30 00:40:45,173 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-30 00:40:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-30 00:40:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 00:40:45,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 00:40:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 00:40:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 00:40:45,175 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 00:40:45,276 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 00:40:45,278 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 00:40:45,566 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 00:40:45,571 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 00:40:45,571 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-30 00:40:45,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 12:40:45 BoogieIcfgContainer [2023-08-30 00:40:45,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 00:40:45,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 00:40:45,580 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 00:40:45,582 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 00:40:45,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 12:40:44" (1/3) ... [2023-08-30 00:40:45,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1afea27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 12:40:45, skipping insertion in model container [2023-08-30 00:40:45,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:40:45" (2/3) ... [2023-08-30 00:40:45,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1afea27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 12:40:45, skipping insertion in model container [2023-08-30 00:40:45,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 12:40:45" (3/3) ... [2023-08-30 00:40:45,585 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2023-08-30 00:40:45,597 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 00:40:45,597 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2023-08-30 00:40:45,597 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 00:40:45,697 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-30 00:40:45,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 172 transitions, 368 flow [2023-08-30 00:40:45,804 INFO L130 PetriNetUnfolder]: 12/169 cut-off events. [2023-08-30 00:40:45,805 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 00:40:45,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 169 events. 12/169 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 197 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2023-08-30 00:40:45,809 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 172 transitions, 368 flow [2023-08-30 00:40:45,816 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 165 transitions, 348 flow [2023-08-30 00:40:45,819 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 00:40:45,834 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 165 transitions, 348 flow [2023-08-30 00:40:45,840 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 163 places, 165 transitions, 348 flow [2023-08-30 00:40:45,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 165 transitions, 348 flow [2023-08-30 00:40:45,876 INFO L130 PetriNetUnfolder]: 12/165 cut-off events. [2023-08-30 00:40:45,877 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 00:40:45,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 165 events. 12/165 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 193 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2023-08-30 00:40:45,880 INFO L119 LiptonReduction]: Number of co-enabled transitions 2688 [2023-08-30 00:40:58,086 INFO L134 LiptonReduction]: Checked pairs total: 3177 [2023-08-30 00:40:58,086 INFO L136 LiptonReduction]: Total number of compositions: 161 [2023-08-30 00:40:58,095 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 00:40:58,099 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@3c3d5a3a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 00:40:58,099 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-08-30 00:40:58,100 INFO L130 PetriNetUnfolder]: 1/2 cut-off events. [2023-08-30 00:40:58,101 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 00:40:58,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:40:58,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 00:40:58,101 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:40:58,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:40:58,104 INFO L85 PathProgramCache]: Analyzing trace with hash 20235, now seen corresponding path program 1 times [2023-08-30 00:40:58,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:40:58,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342919213] [2023-08-30 00:40:58,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:40:58,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:40:58,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:40:58,114 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:40:58,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-30 00:40:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:40:58,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 00:40:58,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:40:58,292 INFO L321 Elim1Store]: treesize reduction 84, result has 33.9 percent of original size [2023-08-30 00:40:58,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 50 [2023-08-30 00:40:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:40:58,311 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 00:40:58,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:40:58,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342919213] [2023-08-30 00:40:58,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [342919213] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:40:58,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:40:58,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 00:40:58,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862998939] [2023-08-30 00:40:58,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:40:58,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 00:40:58,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:40:58,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 00:40:58,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 00:40:58,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 333 [2023-08-30 00:40:58,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:40:58,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:40:58,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 333 [2023-08-30 00:40:58,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:40:58,833 INFO L130 PetriNetUnfolder]: 2765/3512 cut-off events. [2023-08-30 00:40:58,834 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2023-08-30 00:40:58,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7096 conditions, 3512 events. 2765/3512 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 14361 event pairs, 1310 based on Foata normal form. 0/910 useless extension candidates. Maximal degree in co-relation 6096. Up to 3486 conditions per place. [2023-08-30 00:40:58,853 INFO L137 encePairwiseOnDemand]: 330/333 looper letters, 39 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2023-08-30 00:40:58,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 184 flow [2023-08-30 00:40:58,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 00:40:58,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 00:40:58,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2023-08-30 00:40:58,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4924924924924925 [2023-08-30 00:40:58,868 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 492 transitions. [2023-08-30 00:40:58,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 492 transitions. [2023-08-30 00:40:58,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:40:58,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 492 transitions. [2023-08-30 00:40:58,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:40:58,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:40:58,882 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:40:58,884 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 108 flow. Second operand 3 states and 492 transitions. [2023-08-30 00:40:58,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 184 flow [2023-08-30 00:40:58,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 172 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-30 00:40:58,891 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 94 flow [2023-08-30 00:40:58,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2023-08-30 00:40:58,896 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2023-08-30 00:40:58,897 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 94 flow [2023-08-30 00:40:58,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:40:58,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:40:58,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 00:40:58,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-08-30 00:40:59,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:40:59,107 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:40:59,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:40:59,108 INFO L85 PathProgramCache]: Analyzing trace with hash 20283, now seen corresponding path program 1 times [2023-08-30 00:40:59,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:40:59,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475563612] [2023-08-30 00:40:59,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:40:59,109 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:40:59,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:40:59,110 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:40:59,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-30 00:40:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:40:59,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-30 00:40:59,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:40:59,227 INFO L321 Elim1Store]: treesize reduction 111, result has 19.0 percent of original size [2023-08-30 00:40:59,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 51 [2023-08-30 00:40:59,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:40:59,259 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 00:40:59,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:40:59,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475563612] [2023-08-30 00:40:59,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475563612] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:40:59,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:40:59,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 00:40:59,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441289560] [2023-08-30 00:40:59,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:40:59,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 00:40:59,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:40:59,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 00:40:59,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 00:40:59,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 333 [2023-08-30 00:40:59,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:40:59,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:40:59,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 333 [2023-08-30 00:40:59,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:40:59,630 INFO L130 PetriNetUnfolder]: 2185/2806 cut-off events. [2023-08-30 00:40:59,630 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-30 00:40:59,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5621 conditions, 2806 events. 2185/2806 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 11317 event pairs, 1030 based on Foata normal form. 0/780 useless extension candidates. Maximal degree in co-relation 5615. Up to 2780 conditions per place. [2023-08-30 00:40:59,640 INFO L137 encePairwiseOnDemand]: 330/333 looper letters, 37 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-08-30 00:40:59,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 166 flow [2023-08-30 00:40:59,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 00:40:59,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 00:40:59,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2023-08-30 00:40:59,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4904904904904905 [2023-08-30 00:40:59,642 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 490 transitions. [2023-08-30 00:40:59,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 490 transitions. [2023-08-30 00:40:59,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:40:59,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 490 transitions. [2023-08-30 00:40:59,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:40:59,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:40:59,646 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:40:59,646 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 94 flow. Second operand 3 states and 490 transitions. [2023-08-30 00:40:59,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 166 flow [2023-08-30 00:40:59,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 41 transitions, 165 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 00:40:59,647 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 91 flow [2023-08-30 00:40:59,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2023-08-30 00:40:59,647 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -7 predicate places. [2023-08-30 00:40:59,648 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 91 flow [2023-08-30 00:40:59,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:40:59,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:40:59,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 00:40:59,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-30 00:40:59,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:40:59,855 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:40:59,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:40:59,856 INFO L85 PathProgramCache]: Analyzing trace with hash 20284, now seen corresponding path program 1 times [2023-08-30 00:40:59,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:40:59,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383525143] [2023-08-30 00:40:59,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:40:59,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:40:59,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:40:59,858 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:40:59,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-30 00:40:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:40:59,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-30 00:40:59,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:40:59,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 00:40:59,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 00:41:00,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 00:41:00,049 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-08-30 00:41:00,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 32 [2023-08-30 00:41:00,085 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2023-08-30 00:41:00,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 90 treesize of output 89 [2023-08-30 00:41:00,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:41:00,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 00:41:00,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:41:00,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383525143] [2023-08-30 00:41:00,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1383525143] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:41:00,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:41:00,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 00:41:00,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438722495] [2023-08-30 00:41:00,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:41:00,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 00:41:00,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:41:00,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 00:41:00,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 00:41:00,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 333 [2023-08-30 00:41:00,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:00,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:41:00,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 333 [2023-08-30 00:41:00,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:41:00,502 INFO L130 PetriNetUnfolder]: 1605/2100 cut-off events. [2023-08-30 00:41:00,502 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-30 00:41:00,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4210 conditions, 2100 events. 1605/2100 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 8419 event pairs, 750 based on Foata normal form. 0/650 useless extension candidates. Maximal degree in co-relation 4203. Up to 2074 conditions per place. [2023-08-30 00:41:00,509 INFO L137 encePairwiseOnDemand]: 330/333 looper letters, 35 selfloop transitions, 1 changer transitions 0/39 dead transitions. [2023-08-30 00:41:00,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 39 transitions, 159 flow [2023-08-30 00:41:00,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 00:41:00,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 00:41:00,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2023-08-30 00:41:00,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4914914914914915 [2023-08-30 00:41:00,512 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 491 transitions. [2023-08-30 00:41:00,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 491 transitions. [2023-08-30 00:41:00,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:41:00,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 491 transitions. [2023-08-30 00:41:00,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:00,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:00,515 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:00,515 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 91 flow. Second operand 3 states and 491 transitions. [2023-08-30 00:41:00,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 39 transitions, 159 flow [2023-08-30 00:41:00,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 00:41:00,521 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 88 flow [2023-08-30 00:41:00,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2023-08-30 00:41:00,521 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -8 predicate places. [2023-08-30 00:41:00,521 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 88 flow [2023-08-30 00:41:00,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:00,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:41:00,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 00:41:00,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-30 00:41:00,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:00,728 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:41:00,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:41:00,729 INFO L85 PathProgramCache]: Analyzing trace with hash 20236, now seen corresponding path program 1 times [2023-08-30 00:41:00,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:41:00,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840421381] [2023-08-30 00:41:00,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:41:00,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:00,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:41:00,730 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:41:00,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-30 00:41:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:41:00,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-30 00:41:00,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:41:00,840 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 00:41:00,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 00:41:00,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:41:00,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 00:41:00,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:41:00,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840421381] [2023-08-30 00:41:00,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840421381] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:41:00,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:41:00,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 00:41:00,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021374799] [2023-08-30 00:41:00,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:41:00,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 00:41:00,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:41:00,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 00:41:00,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 00:41:00,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 333 [2023-08-30 00:41:00,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:00,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:41:00,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 333 [2023-08-30 00:41:00,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:41:01,363 INFO L130 PetriNetUnfolder]: 3161/4150 cut-off events. [2023-08-30 00:41:01,363 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2023-08-30 00:41:01,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8311 conditions, 4150 events. 3161/4150 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 18563 event pairs, 1491 based on Foata normal form. 0/1322 useless extension candidates. Maximal degree in co-relation 8303. Up to 2072 conditions per place. [2023-08-30 00:41:01,378 INFO L137 encePairwiseOnDemand]: 330/333 looper letters, 68 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2023-08-30 00:41:01,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 73 transitions, 302 flow [2023-08-30 00:41:01,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 00:41:01,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 00:41:01,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2023-08-30 00:41:01,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5215215215215215 [2023-08-30 00:41:01,380 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 521 transitions. [2023-08-30 00:41:01,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 521 transitions. [2023-08-30 00:41:01,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:41:01,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 521 transitions. [2023-08-30 00:41:01,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:01,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:01,383 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:01,383 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 88 flow. Second operand 3 states and 521 transitions. [2023-08-30 00:41:01,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 73 transitions, 302 flow [2023-08-30 00:41:01,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 73 transitions, 301 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 00:41:01,384 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 99 flow [2023-08-30 00:41:01,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2023-08-30 00:41:01,385 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2023-08-30 00:41:01,385 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 99 flow [2023-08-30 00:41:01,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:01,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:41:01,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 00:41:01,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-30 00:41:01,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:01,592 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:41:01,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:41:01,593 INFO L85 PathProgramCache]: Analyzing trace with hash 628487, now seen corresponding path program 1 times [2023-08-30 00:41:01,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:41:01,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503538457] [2023-08-30 00:41:01,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:41:01,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:01,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:41:01,594 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:41:01,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-30 00:41:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:41:01,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-30 00:41:01,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:41:01,732 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 00:41:01,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 00:41:01,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:41:01,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:41:01,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:41:01,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:41:01,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503538457] [2023-08-30 00:41:01,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503538457] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:41:01,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 00:41:01,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2023-08-30 00:41:01,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365810722] [2023-08-30 00:41:01,902 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 00:41:01,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 00:41:01,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:41:01,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 00:41:01,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-30 00:41:02,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 333 [2023-08-30 00:41:02,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 99 flow. Second operand has 6 states, 6 states have (on average 146.0) internal successors, (876), 6 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:02,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:41:02,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 333 [2023-08-30 00:41:02,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:41:03,144 INFO L130 PetriNetUnfolder]: 4719/6204 cut-off events. [2023-08-30 00:41:03,145 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-30 00:41:03,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12428 conditions, 6204 events. 4719/6204 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 29669 event pairs, 2232 based on Foata normal form. 0/2001 useless extension candidates. Maximal degree in co-relation 12418. Up to 2072 conditions per place. [2023-08-30 00:41:03,166 INFO L137 encePairwiseOnDemand]: 329/333 looper letters, 101 selfloop transitions, 7 changer transitions 0/111 dead transitions. [2023-08-30 00:41:03,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 111 transitions, 475 flow [2023-08-30 00:41:03,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 00:41:03,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 00:41:03,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 981 transitions. [2023-08-30 00:41:03,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49099099099099097 [2023-08-30 00:41:03,169 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 981 transitions. [2023-08-30 00:41:03,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 981 transitions. [2023-08-30 00:41:03,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:41:03,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 981 transitions. [2023-08-30 00:41:03,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 163.5) internal successors, (981), 6 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:03,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:03,174 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:03,174 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 99 flow. Second operand 6 states and 981 transitions. [2023-08-30 00:41:03,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 111 transitions, 475 flow [2023-08-30 00:41:03,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 111 transitions, 473 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 00:41:03,176 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 151 flow [2023-08-30 00:41:03,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=151, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2023-08-30 00:41:03,177 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2023-08-30 00:41:03,177 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 151 flow [2023-08-30 00:41:03,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 146.0) internal successors, (876), 6 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:03,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:41:03,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-30 00:41:03,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-30 00:41:03,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:03,384 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:41:03,384 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:41:03,384 INFO L85 PathProgramCache]: Analyzing trace with hash 19507983, now seen corresponding path program 1 times [2023-08-30 00:41:03,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:41:03,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611202106] [2023-08-30 00:41:03,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:41:03,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:03,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:41:03,386 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:41:03,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-30 00:41:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:41:03,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-30 00:41:03,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:41:03,507 INFO L321 Elim1Store]: treesize reduction 105, result has 17.3 percent of original size [2023-08-30 00:41:03,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 40 [2023-08-30 00:41:03,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:41:03,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 00:41:03,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:41:03,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611202106] [2023-08-30 00:41:03,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611202106] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:41:03,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:41:03,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 00:41:03,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703891155] [2023-08-30 00:41:03,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:41:03,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 00:41:03,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:41:03,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 00:41:03,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 00:41:03,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 333 [2023-08-30 00:41:03,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:03,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:41:03,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 333 [2023-08-30 00:41:03,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:41:04,090 INFO L130 PetriNetUnfolder]: 4554/5949 cut-off events. [2023-08-30 00:41:04,090 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-08-30 00:41:04,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11953 conditions, 5949 events. 4554/5949 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 27996 event pairs, 2121 based on Foata normal form. 0/1890 useless extension candidates. Maximal degree in co-relation 11938. Up to 5871 conditions per place. [2023-08-30 00:41:04,110 INFO L137 encePairwiseOnDemand]: 330/333 looper letters, 39 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2023-08-30 00:41:04,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 43 transitions, 227 flow [2023-08-30 00:41:04,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 00:41:04,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 00:41:04,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2023-08-30 00:41:04,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2023-08-30 00:41:04,113 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 486 transitions. [2023-08-30 00:41:04,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 486 transitions. [2023-08-30 00:41:04,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:41:04,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 486 transitions. [2023-08-30 00:41:04,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:04,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:04,115 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:04,115 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 151 flow. Second operand 3 states and 486 transitions. [2023-08-30 00:41:04,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 43 transitions, 227 flow [2023-08-30 00:41:04,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 43 transitions, 217 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-30 00:41:04,118 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 139 flow [2023-08-30 00:41:04,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-08-30 00:41:04,120 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places. [2023-08-30 00:41:04,120 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 139 flow [2023-08-30 00:41:04,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:04,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:41:04,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-30 00:41:04,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-30 00:41:04,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:04,328 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:41:04,328 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:41:04,328 INFO L85 PathProgramCache]: Analyzing trace with hash 19507984, now seen corresponding path program 1 times [2023-08-30 00:41:04,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:41:04,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662550176] [2023-08-30 00:41:04,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:41:04,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:04,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:41:04,329 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:41:04,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-30 00:41:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:41:04,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-30 00:41:04,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:41:04,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 00:41:04,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 00:41:04,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 00:41:04,437 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-08-30 00:41:04,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 32 [2023-08-30 00:41:04,447 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 14 treesize of output 12 [2023-08-30 00:41:04,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:41:04,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 00:41:04,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:41:04,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662550176] [2023-08-30 00:41:04,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662550176] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:41:04,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:41:04,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 00:41:04,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073828501] [2023-08-30 00:41:04,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:41:04,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 00:41:04,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:41:04,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 00:41:04,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 00:41:04,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 333 [2023-08-30 00:41:04,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:04,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:41:04,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 333 [2023-08-30 00:41:04,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:41:04,970 INFO L130 PetriNetUnfolder]: 4293/5598 cut-off events. [2023-08-30 00:41:04,971 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2023-08-30 00:41:04,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11248 conditions, 5598 events. 4293/5598 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 25873 event pairs, 1992 based on Foata normal form. 0/1824 useless extension candidates. Maximal degree in co-relation 11232. Up to 5520 conditions per place. [2023-08-30 00:41:04,985 INFO L137 encePairwiseOnDemand]: 330/333 looper letters, 37 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-08-30 00:41:04,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 41 transitions, 211 flow [2023-08-30 00:41:04,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 00:41:04,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 00:41:04,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2023-08-30 00:41:04,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4874874874874875 [2023-08-30 00:41:04,988 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 487 transitions. [2023-08-30 00:41:04,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 487 transitions. [2023-08-30 00:41:04,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:41:04,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 487 transitions. [2023-08-30 00:41:04,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:04,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:04,990 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:04,990 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 139 flow. Second operand 3 states and 487 transitions. [2023-08-30 00:41:04,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 41 transitions, 211 flow [2023-08-30 00:41:04,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 41 transitions, 210 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 00:41:04,992 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 136 flow [2023-08-30 00:41:04,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-08-30 00:41:04,993 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2023-08-30 00:41:04,993 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 136 flow [2023-08-30 00:41:04,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:04,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:41:04,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 00:41:05,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-30 00:41:05,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:05,200 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:41:05,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:41:05,200 INFO L85 PathProgramCache]: Analyzing trace with hash 604742081, now seen corresponding path program 1 times [2023-08-30 00:41:05,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:41:05,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1493928395] [2023-08-30 00:41:05,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:41:05,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:05,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:41:05,202 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:41:05,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-30 00:41:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:41:05,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 00:41:05,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:41:05,302 INFO L321 Elim1Store]: treesize reduction 84, result has 33.9 percent of original size [2023-08-30 00:41:05,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 50 [2023-08-30 00:41:05,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:41:05,316 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 00:41:05,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:41:05,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1493928395] [2023-08-30 00:41:05,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1493928395] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:41:05,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:41:05,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 00:41:05,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254126608] [2023-08-30 00:41:05,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:41:05,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 00:41:05,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:41:05,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 00:41:05,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 00:41:05,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 333 [2023-08-30 00:41:05,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:05,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:41:05,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 333 [2023-08-30 00:41:05,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:41:05,700 INFO L130 PetriNetUnfolder]: 2229/2988 cut-off events. [2023-08-30 00:41:05,700 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2023-08-30 00:41:05,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6026 conditions, 2988 events. 2229/2988 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 13170 event pairs, 1014 based on Foata normal form. 0/1194 useless extension candidates. Maximal degree in co-relation 6009. Up to 2930 conditions per place. [2023-08-30 00:41:05,710 INFO L137 encePairwiseOnDemand]: 328/333 looper letters, 31 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2023-08-30 00:41:05,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 38 transitions, 200 flow [2023-08-30 00:41:05,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 00:41:05,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 00:41:05,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 600 transitions. [2023-08-30 00:41:05,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45045045045045046 [2023-08-30 00:41:05,712 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 600 transitions. [2023-08-30 00:41:05,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 600 transitions. [2023-08-30 00:41:05,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:41:05,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 600 transitions. [2023-08-30 00:41:05,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:05,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:05,715 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:05,715 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 136 flow. Second operand 4 states and 600 transitions. [2023-08-30 00:41:05,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 38 transitions, 200 flow [2023-08-30 00:41:05,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 38 transitions, 199 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 00:41:05,716 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 137 flow [2023-08-30 00:41:05,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2023-08-30 00:41:05,717 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2023-08-30 00:41:05,717 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 137 flow [2023-08-30 00:41:05,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:05,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:41:05,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 00:41:05,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-30 00:41:05,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:05,924 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:41:05,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:41:05,925 INFO L85 PathProgramCache]: Analyzing trace with hash 604742082, now seen corresponding path program 1 times [2023-08-30 00:41:05,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:41:05,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469903775] [2023-08-30 00:41:05,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:41:05,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:05,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:41:05,926 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:41:05,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-30 00:41:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:41:05,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-30 00:41:05,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:41:06,049 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 00:41:06,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 00:41:06,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:41:06,112 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 00:41:06,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:41:06,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469903775] [2023-08-30 00:41:06,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469903775] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:41:06,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:41:06,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 00:41:06,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332601274] [2023-08-30 00:41:06,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:41:06,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:41:06,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:41:06,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:41:06,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:41:06,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 333 [2023-08-30 00:41:06,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 146.0) internal successors, (730), 5 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:06,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:41:06,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 333 [2023-08-30 00:41:06,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:41:06,674 INFO L130 PetriNetUnfolder]: 3213/4422 cut-off events. [2023-08-30 00:41:06,674 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2023-08-30 00:41:06,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8930 conditions, 4422 events. 3213/4422 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 21645 event pairs, 783 based on Foata normal form. 0/1977 useless extension candidates. Maximal degree in co-relation 8912. Up to 2642 conditions per place. [2023-08-30 00:41:06,687 INFO L137 encePairwiseOnDemand]: 328/333 looper letters, 53 selfloop transitions, 6 changer transitions 0/61 dead transitions. [2023-08-30 00:41:06,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 61 transitions, 306 flow [2023-08-30 00:41:06,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:41:06,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:41:06,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 779 transitions. [2023-08-30 00:41:06,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4678678678678679 [2023-08-30 00:41:06,690 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 779 transitions. [2023-08-30 00:41:06,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 779 transitions. [2023-08-30 00:41:06,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:41:06,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 779 transitions. [2023-08-30 00:41:06,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:06,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:06,693 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:06,693 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 137 flow. Second operand 5 states and 779 transitions. [2023-08-30 00:41:06,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 61 transitions, 306 flow [2023-08-30 00:41:06,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 61 transitions, 301 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 00:41:06,694 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 152 flow [2023-08-30 00:41:06,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2023-08-30 00:41:06,695 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2023-08-30 00:41:06,695 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 152 flow [2023-08-30 00:41:06,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 146.0) internal successors, (730), 5 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:06,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:41:06,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 00:41:06,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-30 00:41:06,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:06,904 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:41:06,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:41:06,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1567139639, now seen corresponding path program 1 times [2023-08-30 00:41:06,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:41:06,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143648909] [2023-08-30 00:41:06,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:41:06,905 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:06,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:41:06,905 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:41:06,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-30 00:41:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:41:06,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-30 00:41:06,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:41:07,034 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 00:41:07,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 00:41:07,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:41:07,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 00:41:07,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:41:07,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143648909] [2023-08-30 00:41:07,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143648909] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:41:07,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:41:07,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 00:41:07,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485317037] [2023-08-30 00:41:07,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:41:07,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:41:07,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:41:07,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:41:07,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:41:07,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 333 [2023-08-30 00:41:07,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 143.2) internal successors, (716), 5 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:07,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:41:07,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 333 [2023-08-30 00:41:07,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:41:07,760 INFO L130 PetriNetUnfolder]: 2173/3114 cut-off events. [2023-08-30 00:41:07,760 INFO L131 PetriNetUnfolder]: For 566/566 co-relation queries the response was YES. [2023-08-30 00:41:07,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6773 conditions, 3114 events. 2173/3114 cut-off events. For 566/566 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 15710 event pairs, 1130 based on Foata normal form. 32/1738 useless extension candidates. Maximal degree in co-relation 6754. Up to 2757 conditions per place. [2023-08-30 00:41:07,769 INFO L137 encePairwiseOnDemand]: 326/333 looper letters, 67 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2023-08-30 00:41:07,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 73 transitions, 380 flow [2023-08-30 00:41:07,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:41:07,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:41:07,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 780 transitions. [2023-08-30 00:41:07,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46846846846846846 [2023-08-30 00:41:07,771 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 780 transitions. [2023-08-30 00:41:07,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 780 transitions. [2023-08-30 00:41:07,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:41:07,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 780 transitions. [2023-08-30 00:41:07,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 156.0) internal successors, (780), 5 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:07,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:07,775 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:07,775 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 152 flow. Second operand 5 states and 780 transitions. [2023-08-30 00:41:07,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 73 transitions, 380 flow [2023-08-30 00:41:07,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 73 transitions, 367 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 00:41:07,777 INFO L231 Difference]: Finished difference. Result has 57 places, 41 transitions, 181 flow [2023-08-30 00:41:07,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2023-08-30 00:41:07,777 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2023-08-30 00:41:07,777 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 181 flow [2023-08-30 00:41:07,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 143.2) internal successors, (716), 5 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:07,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:41:07,778 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1] [2023-08-30 00:41:07,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-30 00:41:07,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:07,985 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:41:07,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:41:07,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1544549836, now seen corresponding path program 2 times [2023-08-30 00:41:07,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:41:07,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705211558] [2023-08-30 00:41:07,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 00:41:07,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:07,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:41:07,987 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:41:07,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-30 00:41:08,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 00:41:08,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 00:41:08,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-30 00:41:08,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:41:08,123 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 00:41:08,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 00:41:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:41:08,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:41:08,645 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:41:08,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:41:08,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705211558] [2023-08-30 00:41:08,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705211558] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:41:08,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 00:41:08,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2023-08-30 00:41:08,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565828962] [2023-08-30 00:41:08,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 00:41:08,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-30 00:41:08,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:41:08,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-30 00:41:08,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-08-30 00:41:11,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 333 [2023-08-30 00:41:11,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 41 transitions, 181 flow. Second operand has 12 states, 12 states have (on average 147.0) internal successors, (1764), 12 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:11,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:41:11,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 333 [2023-08-30 00:41:11,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:41:13,672 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][46], [Black: 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 119#thread3EXITtrue, 69#L84-4true, 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 332#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 39#L48-5true, 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:13,673 INFO L383 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2023-08-30 00:41:13,673 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 00:41:13,673 INFO L386 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2023-08-30 00:41:13,673 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 00:41:13,673 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][46], [Black: 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 295#true, 69#L84-4true, 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 332#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 39#L48-5true, 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:13,674 INFO L383 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2023-08-30 00:41:13,674 INFO L386 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2023-08-30 00:41:13,674 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 00:41:13,674 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 00:41:13,872 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][46], [Black: 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 60#L85-1true, Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 119#thread3EXITtrue, 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 332#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 39#L48-5true, 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:13,873 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-08-30 00:41:13,873 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 00:41:13,873 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 00:41:13,873 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 00:41:13,873 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][46], [Black: 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 60#L85-1true, Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 295#true, 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 332#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 39#L48-5true, 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:13,874 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-08-30 00:41:13,874 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 00:41:13,874 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 00:41:13,874 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 00:41:13,879 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][65], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 336#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (= (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 119#thread3EXITtrue, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:13,879 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-08-30 00:41:13,880 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 00:41:13,880 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 00:41:13,880 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 00:41:13,880 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][65], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 336#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (= (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:13,880 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-08-30 00:41:13,881 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 00:41:13,881 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 00:41:13,881 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 00:41:14,100 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][65], [60#L85-1true, Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 336#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (= (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 119#thread3EXITtrue, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,100 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-30 00:41:14,100 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 00:41:14,100 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 00:41:14,100 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 00:41:14,100 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][65], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 60#L85-1true, Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 336#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (= (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,100 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-30 00:41:14,100 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 00:41:14,100 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 00:41:14,100 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 00:41:14,108 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][91], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 119#thread3EXITtrue, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 340#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (= (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,108 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-30 00:41:14,108 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 00:41:14,108 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 00:41:14,108 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 00:41:14,108 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][91], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 295#true, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 340#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (= (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,109 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-30 00:41:14,109 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 00:41:14,109 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 00:41:14,109 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 00:41:14,301 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][91], [60#L85-1true, Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 119#thread3EXITtrue, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 340#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (= (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,301 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-30 00:41:14,301 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 00:41:14,301 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 00:41:14,301 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 00:41:14,302 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][91], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 60#L85-1true, Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 295#true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 340#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (= (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,302 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-30 00:41:14,302 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 00:41:14,302 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 00:41:14,302 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 00:41:14,335 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][119], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 344#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (= (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule (_ bv16 32) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 119#thread3EXITtrue, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,335 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-30 00:41:14,335 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 00:41:14,335 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 00:41:14,335 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 00:41:14,336 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][119], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 344#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (= (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule (_ bv16 32) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,336 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-30 00:41:14,336 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 00:41:14,336 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 00:41:14,336 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 00:41:14,437 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][132], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 366#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 295#true, 119#thread3EXITtrue, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,437 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 00:41:14,437 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 00:41:14,437 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 00:41:14,437 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 00:41:14,437 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][132], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 366#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 295#true, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,437 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 00:41:14,437 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 00:41:14,438 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 00:41:14,438 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 00:41:14,490 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][119], [60#L85-1true, Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 344#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (= (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule (_ bv16 32) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 119#thread3EXITtrue, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,490 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 00:41:14,490 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 00:41:14,490 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 00:41:14,490 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 00:41:14,490 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][119], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 60#L85-1true, Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 344#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (= (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule (_ bv16 32) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,490 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 00:41:14,490 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 00:41:14,490 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 00:41:14,490 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 00:41:14,578 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][153], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 368#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 119#thread3EXITtrue, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,578 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 00:41:14,578 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 00:41:14,578 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 00:41:14,578 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 00:41:14,579 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][153], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 368#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 295#true, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,579 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 00:41:14,579 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 00:41:14,579 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 00:41:14,579 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 00:41:14,587 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][132], [60#L85-1true, Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 366#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 295#true, 119#thread3EXITtrue, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,587 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 00:41:14,587 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 00:41:14,587 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 00:41:14,587 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 00:41:14,588 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][132], [60#L85-1true, Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 366#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 295#true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,588 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 00:41:14,588 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 00:41:14,588 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 00:41:14,588 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 00:41:14,655 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][172], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 370#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 119#thread3EXITtrue, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,655 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 00:41:14,655 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 00:41:14,655 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 00:41:14,655 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 00:41:14,655 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][172], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 370#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,656 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 00:41:14,656 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 00:41:14,656 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 00:41:14,656 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 00:41:14,715 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][153], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 60#L85-1true, 368#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 119#thread3EXITtrue, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,716 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 00:41:14,716 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 00:41:14,716 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 00:41:14,716 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 00:41:14,717 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][153], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 60#L85-1true, Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 368#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 295#true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,717 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 00:41:14,717 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 00:41:14,717 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 00:41:14,717 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 00:41:14,806 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][188], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), 295#true, 119#thread3EXITtrue, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 372#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,806 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 00:41:14,806 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 00:41:14,806 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 00:41:14,806 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 00:41:14,807 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][188], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), 295#true, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 372#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,807 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 00:41:14,807 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 00:41:14,807 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 00:41:14,807 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 00:41:14,814 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][172], [60#L85-1true, Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 370#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 119#thread3EXITtrue, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,814 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 00:41:14,814 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 00:41:14,814 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 00:41:14,814 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 00:41:14,815 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][172], [60#L85-1true, Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 370#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 295#true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,815 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 00:41:14,815 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 00:41:14,815 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 00:41:14,815 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 00:41:14,897 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][203], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 348#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), 295#true, 119#thread3EXITtrue, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,897 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 00:41:14,897 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 00:41:14,897 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 00:41:14,897 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 00:41:14,898 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][203], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 348#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), 295#true, 69#L84-4true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,898 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 00:41:14,898 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 00:41:14,898 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 00:41:14,898 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 00:41:14,903 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][188], [60#L85-1true, Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), 295#true, 119#thread3EXITtrue, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 372#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,903 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 00:41:14,903 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 00:41:14,903 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 00:41:14,903 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 00:41:14,904 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][188], [60#L85-1true, Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), 295#true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 372#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,904 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 00:41:14,904 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 00:41:14,904 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 00:41:14,904 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 00:41:14,993 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][203], [60#L85-1true, Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 348#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), 295#true, 119#thread3EXITtrue, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,993 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-30 00:41:14,993 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 00:41:14,993 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 00:41:14,993 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 00:41:14,993 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L56-5-->L56-5: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_36))) (let ((.cse1 (bvadd v_~A~0.offset_37 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_37 .cse3))) (and (bvule .cse0 .cse1) (bvule .cse1 (select |v_#length_129| v_~A~0.base_46)) (bvslt v_thread2Thread1of1ForFork2_~i~1_36 v_~M~0_33) (= (bvadd v_thread2Thread1of1ForFork2_~i~1_36 (_ bv1 32)) v_thread2Thread1of1ForFork2_~i~1_35) (= (bvadd v_~sum2~0_24 (let ((.cse2 (select |v_#memory_int_71| v_~A~0.base_46))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv3 32))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv2 32)))) (select .cse2 (bvadd v_~A~0.offset_37 .cse3 (_ bv1 32)))) (select .cse2 .cse0)))) v_~sum2~0_23) (= (_ bv0 1) (bvadd (select |v_#valid_174| v_~A~0.base_46) (_ bv1 1)))))) InVars {~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_36, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_24, #length=|v_#length_129|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_17|, ~A~0.base=v_~A~0.base_46, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_35, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_19|, ~A~0.offset=v_~A~0.offset_37, ~M~0=v_~M~0_33, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_71|, ~sum2~0=v_~sum2~0_23, #length=|v_#length_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][203], [Black: 316#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 60#L85-1true, Black: 215#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), Black: 300#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 318#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~size#1| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 202#true, 292#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 86#thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 192#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), Black: 199#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 348#(or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))), 295#true, 185#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))), 39#L48-5true, 221#(and (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt |ULTIMATE.start_create_fresh_uint_array_~i~3#1| |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)))), 245#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 127#L56-5true, 270#(and (= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))), Black: 211#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (bvslt (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 232#(and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))), 178#(= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))]) [2023-08-30 00:41:14,993 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-30 00:41:14,994 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 00:41:14,994 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 00:41:14,994 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 00:41:15,241 INFO L130 PetriNetUnfolder]: 9379/13043 cut-off events. [2023-08-30 00:41:15,242 INFO L131 PetriNetUnfolder]: For 8945/9353 co-relation queries the response was YES. [2023-08-30 00:41:15,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33880 conditions, 13043 events. 9379/13043 cut-off events. For 8945/9353 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 74676 event pairs, 4857 based on Foata normal form. 408/9855 useless extension candidates. Maximal degree in co-relation 33858. Up to 3404 conditions per place. [2023-08-30 00:41:15,292 INFO L137 encePairwiseOnDemand]: 329/333 looper letters, 267 selfloop transitions, 12 changer transitions 0/283 dead transitions. [2023-08-30 00:41:15,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 283 transitions, 1466 flow [2023-08-30 00:41:15,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 00:41:15,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 00:41:15,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2028 transitions. [2023-08-30 00:41:15,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075075075075075 [2023-08-30 00:41:15,298 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2028 transitions. [2023-08-30 00:41:15,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2028 transitions. [2023-08-30 00:41:15,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:41:15,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2028 transitions. [2023-08-30 00:41:15,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 169.0) internal successors, (2028), 12 states have internal predecessors, (2028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:15,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 333.0) internal successors, (4329), 13 states have internal predecessors, (4329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:15,306 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 333.0) internal successors, (4329), 13 states have internal predecessors, (4329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:15,306 INFO L175 Difference]: Start difference. First operand has 57 places, 41 transitions, 181 flow. Second operand 12 states and 2028 transitions. [2023-08-30 00:41:15,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 283 transitions, 1466 flow [2023-08-30 00:41:15,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 283 transitions, 1456 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-30 00:41:15,311 INFO L231 Difference]: Finished difference. Result has 73 places, 48 transitions, 270 flow [2023-08-30 00:41:15,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=270, PETRI_PLACES=73, PETRI_TRANSITIONS=48} [2023-08-30 00:41:15,311 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 22 predicate places. [2023-08-30 00:41:15,311 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 48 transitions, 270 flow [2023-08-30 00:41:15,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 147.0) internal successors, (1764), 12 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:15,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:41:15,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 00:41:15,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-30 00:41:15,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:15,555 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:41:15,556 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:41:15,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1567315734, now seen corresponding path program 1 times [2023-08-30 00:41:15,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:41:15,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736532627] [2023-08-30 00:41:15,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:41:15,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:15,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:41:15,557 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:41:15,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-30 00:41:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:41:15,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-30 00:41:15,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:41:15,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 00:41:15,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 00:41:15,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 00:41:15,667 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-08-30 00:41:15,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 32 [2023-08-30 00:41:15,673 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 18 treesize of output 16 [2023-08-30 00:41:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:41:15,695 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 00:41:15,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:41:15,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736532627] [2023-08-30 00:41:15,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [736532627] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:41:15,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:41:15,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 00:41:15,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171013776] [2023-08-30 00:41:15,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:41:15,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 00:41:15,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:41:15,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 00:41:15,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 00:41:15,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 333 [2023-08-30 00:41:15,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 48 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:15,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:41:15,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 333 [2023-08-30 00:41:15,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:41:16,585 INFO L130 PetriNetUnfolder]: 8969/12345 cut-off events. [2023-08-30 00:41:16,585 INFO L131 PetriNetUnfolder]: For 8198/8510 co-relation queries the response was YES. [2023-08-30 00:41:16,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32218 conditions, 12345 events. 8969/12345 cut-off events. For 8198/8510 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 70648 event pairs, 4449 based on Foata normal form. 307/9014 useless extension candidates. Maximal degree in co-relation 32189. Up to 12057 conditions per place. [2023-08-30 00:41:16,634 INFO L137 encePairwiseOnDemand]: 330/333 looper letters, 41 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2023-08-30 00:41:16,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 46 transitions, 350 flow [2023-08-30 00:41:16,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 00:41:16,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 00:41:16,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 482 transitions. [2023-08-30 00:41:16,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4824824824824825 [2023-08-30 00:41:16,636 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 482 transitions. [2023-08-30 00:41:16,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 482 transitions. [2023-08-30 00:41:16,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:41:16,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 482 transitions. [2023-08-30 00:41:16,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:16,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:16,638 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:16,638 INFO L175 Difference]: Start difference. First operand has 73 places, 48 transitions, 270 flow. Second operand 3 states and 482 transitions. [2023-08-30 00:41:16,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 46 transitions, 350 flow [2023-08-30 00:41:16,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 46 transitions, 325 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-30 00:41:16,641 INFO L231 Difference]: Finished difference. Result has 69 places, 46 transitions, 243 flow [2023-08-30 00:41:16,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=243, PETRI_PLACES=69, PETRI_TRANSITIONS=46} [2023-08-30 00:41:16,642 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2023-08-30 00:41:16,642 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 46 transitions, 243 flow [2023-08-30 00:41:16,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:16,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:41:16,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 00:41:16,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-30 00:41:16,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:16,849 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:41:16,849 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:41:16,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1567315735, now seen corresponding path program 1 times [2023-08-30 00:41:16,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:41:16,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734753964] [2023-08-30 00:41:16,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:41:16,850 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:16,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:41:16,851 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:41:16,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-08-30 00:41:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:41:16,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-30 00:41:16,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:41:16,958 INFO L321 Elim1Store]: treesize reduction 105, result has 17.3 percent of original size [2023-08-30 00:41:16,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 44 [2023-08-30 00:41:16,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:41:16,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 00:41:16,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:41:16,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734753964] [2023-08-30 00:41:16,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734753964] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:41:16,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:41:16,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 00:41:16,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658757004] [2023-08-30 00:41:16,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:41:16,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 00:41:16,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:41:16,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 00:41:16,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 00:41:17,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 333 [2023-08-30 00:41:17,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 46 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:17,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:41:17,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 333 [2023-08-30 00:41:17,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:41:17,930 INFO L130 PetriNetUnfolder]: 8366/11454 cut-off events. [2023-08-30 00:41:17,931 INFO L131 PetriNetUnfolder]: For 7641/7919 co-relation queries the response was YES. [2023-08-30 00:41:17,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29942 conditions, 11454 events. 8366/11454 cut-off events. For 7641/7919 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 64108 event pairs, 4116 based on Foata normal form. 274/8581 useless extension candidates. Maximal degree in co-relation 29912. Up to 11175 conditions per place. [2023-08-30 00:41:17,968 INFO L137 encePairwiseOnDemand]: 330/333 looper letters, 39 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2023-08-30 00:41:17,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 44 transitions, 319 flow [2023-08-30 00:41:17,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 00:41:17,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 00:41:17,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 468 transitions. [2023-08-30 00:41:17,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46846846846846846 [2023-08-30 00:41:17,970 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 468 transitions. [2023-08-30 00:41:17,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 468 transitions. [2023-08-30 00:41:17,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:41:17,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 468 transitions. [2023-08-30 00:41:17,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:17,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:17,973 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:17,973 INFO L175 Difference]: Start difference. First operand has 69 places, 46 transitions, 243 flow. Second operand 3 states and 468 transitions. [2023-08-30 00:41:17,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 44 transitions, 319 flow [2023-08-30 00:41:17,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 44 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 00:41:17,975 INFO L231 Difference]: Finished difference. Result has 68 places, 44 transitions, 240 flow [2023-08-30 00:41:17,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=68, PETRI_TRANSITIONS=44} [2023-08-30 00:41:17,976 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2023-08-30 00:41:17,976 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 44 transitions, 240 flow [2023-08-30 00:41:17,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:17,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:41:17,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 00:41:17,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-08-30 00:41:18,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:18,185 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:41:18,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:41:18,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1342142762, now seen corresponding path program 1 times [2023-08-30 00:41:18,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:41:18,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364369787] [2023-08-30 00:41:18,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:41:18,186 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:18,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:41:18,187 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:41:18,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-08-30 00:41:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:41:18,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-30 00:41:18,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:41:18,317 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 00:41:18,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 00:41:18,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:41:18,421 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 00:41:18,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:41:18,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364369787] [2023-08-30 00:41:18,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364369787] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:41:18,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:41:18,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 00:41:18,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155441562] [2023-08-30 00:41:18,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:41:18,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:41:18,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:41:18,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:41:18,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:41:18,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 333 [2023-08-30 00:41:18,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 44 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 145.4) internal successors, (727), 5 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:18,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:41:18,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 333 [2023-08-30 00:41:18,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:41:19,944 INFO L130 PetriNetUnfolder]: 11246/15768 cut-off events. [2023-08-30 00:41:19,944 INFO L131 PetriNetUnfolder]: For 10377/10835 co-relation queries the response was YES. [2023-08-30 00:41:19,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41232 conditions, 15768 events. 11246/15768 cut-off events. For 10377/10835 co-relation queries the response was YES. Maximal size of possible extension queue 741. Compared 94639 event pairs, 3687 based on Foata normal form. 457/12935 useless extension candidates. Maximal degree in co-relation 41201. Up to 10314 conditions per place. [2023-08-30 00:41:19,999 INFO L137 encePairwiseOnDemand]: 328/333 looper letters, 51 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2023-08-30 00:41:19,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 62 transitions, 414 flow [2023-08-30 00:41:20,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:41:20,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:41:20,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 764 transitions. [2023-08-30 00:41:20,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45885885885885885 [2023-08-30 00:41:20,002 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 764 transitions. [2023-08-30 00:41:20,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 764 transitions. [2023-08-30 00:41:20,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:41:20,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 764 transitions. [2023-08-30 00:41:20,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:20,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:20,005 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:20,005 INFO L175 Difference]: Start difference. First operand has 68 places, 44 transitions, 240 flow. Second operand 5 states and 764 transitions. [2023-08-30 00:41:20,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 62 transitions, 414 flow [2023-08-30 00:41:20,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 62 transitions, 413 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 00:41:20,008 INFO L231 Difference]: Finished difference. Result has 72 places, 45 transitions, 267 flow [2023-08-30 00:41:20,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=267, PETRI_PLACES=72, PETRI_TRANSITIONS=45} [2023-08-30 00:41:20,009 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 21 predicate places. [2023-08-30 00:41:20,009 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 45 transitions, 267 flow [2023-08-30 00:41:20,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 145.4) internal successors, (727), 5 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:20,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:41:20,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 00:41:20,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-08-30 00:41:20,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:20,217 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:41:20,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:41:20,217 INFO L85 PathProgramCache]: Analyzing trace with hash 658995634, now seen corresponding path program 1 times [2023-08-30 00:41:20,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:41:20,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682461798] [2023-08-30 00:41:20,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:41:20,218 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:20,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:41:20,218 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:41:20,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-08-30 00:41:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:41:20,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-30 00:41:20,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:41:20,353 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 00:41:20,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 00:41:20,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 00:41:20,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:41:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 00:41:20,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:41:20,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682461798] [2023-08-30 00:41:20,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682461798] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:41:20,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 00:41:20,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2023-08-30 00:41:20,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942680017] [2023-08-30 00:41:20,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 00:41:20,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 00:41:20,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:41:20,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 00:41:20,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-30 00:41:22,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 333 [2023-08-30 00:41:22,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 45 transitions, 267 flow. Second operand has 10 states, 10 states have (on average 143.4) internal successors, (1434), 10 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:22,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:41:22,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 333 [2023-08-30 00:41:22,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:41:24,750 INFO L130 PetriNetUnfolder]: 16746/23154 cut-off events. [2023-08-30 00:41:24,750 INFO L131 PetriNetUnfolder]: For 21383/23612 co-relation queries the response was YES. [2023-08-30 00:41:24,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64827 conditions, 23154 events. 16746/23154 cut-off events. For 21383/23612 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 141959 event pairs, 2542 based on Foata normal form. 2173/22219 useless extension candidates. Maximal degree in co-relation 64794. Up to 6048 conditions per place. [2023-08-30 00:41:24,872 INFO L137 encePairwiseOnDemand]: 327/333 looper letters, 96 selfloop transitions, 14 changer transitions 0/112 dead transitions. [2023-08-30 00:41:24,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 112 transitions, 717 flow [2023-08-30 00:41:24,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 00:41:24,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 00:41:24,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1229 transitions. [2023-08-30 00:41:24,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46133633633633636 [2023-08-30 00:41:24,875 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1229 transitions. [2023-08-30 00:41:24,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1229 transitions. [2023-08-30 00:41:24,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:41:24,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1229 transitions. [2023-08-30 00:41:24,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 153.625) internal successors, (1229), 8 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:24,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 333.0) internal successors, (2997), 9 states have internal predecessors, (2997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:24,880 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 333.0) internal successors, (2997), 9 states have internal predecessors, (2997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:24,880 INFO L175 Difference]: Start difference. First operand has 72 places, 45 transitions, 267 flow. Second operand 8 states and 1229 transitions. [2023-08-30 00:41:24,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 112 transitions, 717 flow [2023-08-30 00:41:24,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 112 transitions, 699 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 00:41:24,884 INFO L231 Difference]: Finished difference. Result has 80 places, 50 transitions, 327 flow [2023-08-30 00:41:24,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=327, PETRI_PLACES=80, PETRI_TRANSITIONS=50} [2023-08-30 00:41:24,885 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 29 predicate places. [2023-08-30 00:41:24,885 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 50 transitions, 327 flow [2023-08-30 00:41:24,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 143.4) internal successors, (1434), 10 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:24,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:41:24,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 00:41:24,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-08-30 00:41:25,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:25,093 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:41:25,093 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:41:25,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1313961466, now seen corresponding path program 1 times [2023-08-30 00:41:25,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:41:25,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024639220] [2023-08-30 00:41:25,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:41:25,093 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:25,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:41:25,094 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:41:25,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-08-30 00:41:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:41:25,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-30 00:41:25,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:41:25,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:41:25,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 00:41:25,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:41:25,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024639220] [2023-08-30 00:41:25,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024639220] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:41:25,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:41:25,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 00:41:25,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814662768] [2023-08-30 00:41:25,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:41:25,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:41:25,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:41:25,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:41:25,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:41:25,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 333 [2023-08-30 00:41:25,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 50 transitions, 327 flow. Second operand has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:25,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:41:25,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 333 [2023-08-30 00:41:25,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:41:27,203 INFO L130 PetriNetUnfolder]: 14963/21272 cut-off events. [2023-08-30 00:41:27,204 INFO L131 PetriNetUnfolder]: For 46835/50364 co-relation queries the response was YES. [2023-08-30 00:41:27,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69089 conditions, 21272 events. 14963/21272 cut-off events. For 46835/50364 co-relation queries the response was YES. Maximal size of possible extension queue 900. Compared 129223 event pairs, 10718 based on Foata normal form. 3528/23240 useless extension candidates. Maximal degree in co-relation 69052. Up to 21110 conditions per place. [2023-08-30 00:41:27,302 INFO L137 encePairwiseOnDemand]: 328/333 looper letters, 66 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2023-08-30 00:41:27,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 73 transitions, 529 flow [2023-08-30 00:41:27,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:41:27,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:41:27,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 787 transitions. [2023-08-30 00:41:27,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47267267267267266 [2023-08-30 00:41:27,304 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 787 transitions. [2023-08-30 00:41:27,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 787 transitions. [2023-08-30 00:41:27,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:41:27,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 787 transitions. [2023-08-30 00:41:27,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 157.4) internal successors, (787), 5 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:27,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:27,308 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:27,308 INFO L175 Difference]: Start difference. First operand has 80 places, 50 transitions, 327 flow. Second operand 5 states and 787 transitions. [2023-08-30 00:41:27,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 73 transitions, 529 flow [2023-08-30 00:41:27,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 73 transitions, 511 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-30 00:41:27,325 INFO L231 Difference]: Finished difference. Result has 83 places, 51 transitions, 326 flow [2023-08-30 00:41:27,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=326, PETRI_PLACES=83, PETRI_TRANSITIONS=51} [2023-08-30 00:41:27,326 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 32 predicate places. [2023-08-30 00:41:27,326 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 51 transitions, 326 flow [2023-08-30 00:41:27,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:27,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:41:27,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 00:41:27,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-08-30 00:41:27,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:27,533 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:41:27,533 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:41:27,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2103695100, now seen corresponding path program 1 times [2023-08-30 00:41:27,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:41:27,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151154509] [2023-08-30 00:41:27,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:41:27,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:27,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:41:27,535 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:41:27,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-08-30 00:41:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:41:27,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-30 00:41:27,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:41:27,695 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 00:41:27,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 00:41:27,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 00:41:27,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:41:28,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 00:41:28,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:41:28,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1151154509] [2023-08-30 00:41:28,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1151154509] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:41:28,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 00:41:28,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2023-08-30 00:41:28,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650565916] [2023-08-30 00:41:28,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 00:41:28,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 00:41:28,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:41:28,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 00:41:28,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-30 00:41:29,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 333 [2023-08-30 00:41:29,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 51 transitions, 326 flow. Second operand has 10 states, 10 states have (on average 141.8) internal successors, (1418), 10 states have internal predecessors, (1418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:29,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:41:29,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 333 [2023-08-30 00:41:29,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:41:34,830 INFO L130 PetriNetUnfolder]: 34515/46595 cut-off events. [2023-08-30 00:41:34,830 INFO L131 PetriNetUnfolder]: For 64477/65439 co-relation queries the response was YES. [2023-08-30 00:41:35,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150902 conditions, 46595 events. 34515/46595 cut-off events. For 64477/65439 co-relation queries the response was YES. Maximal size of possible extension queue 1963. Compared 291607 event pairs, 5059 based on Foata normal form. 4237/50262 useless extension candidates. Maximal degree in co-relation 150863. Up to 12516 conditions per place. [2023-08-30 00:41:35,145 INFO L137 encePairwiseOnDemand]: 327/333 looper letters, 117 selfloop transitions, 13 changer transitions 0/134 dead transitions. [2023-08-30 00:41:35,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 134 transitions, 966 flow [2023-08-30 00:41:35,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 00:41:35,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 00:41:35,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1209 transitions. [2023-08-30 00:41:35,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45382882882882886 [2023-08-30 00:41:35,148 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1209 transitions. [2023-08-30 00:41:35,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1209 transitions. [2023-08-30 00:41:35,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:41:35,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1209 transitions. [2023-08-30 00:41:35,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 151.125) internal successors, (1209), 8 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:35,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 333.0) internal successors, (2997), 9 states have internal predecessors, (2997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:35,153 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 333.0) internal successors, (2997), 9 states have internal predecessors, (2997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:35,153 INFO L175 Difference]: Start difference. First operand has 83 places, 51 transitions, 326 flow. Second operand 8 states and 1209 transitions. [2023-08-30 00:41:35,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 134 transitions, 966 flow [2023-08-30 00:41:35,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 134 transitions, 961 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 00:41:35,318 INFO L231 Difference]: Finished difference. Result has 92 places, 56 transitions, 404 flow [2023-08-30 00:41:35,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=404, PETRI_PLACES=92, PETRI_TRANSITIONS=56} [2023-08-30 00:41:35,319 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 41 predicate places. [2023-08-30 00:41:35,319 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 56 transitions, 404 flow [2023-08-30 00:41:35,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.8) internal successors, (1418), 10 states have internal predecessors, (1418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:35,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:41:35,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 00:41:35,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-08-30 00:41:35,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:35,526 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:41:35,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:41:35,526 INFO L85 PathProgramCache]: Analyzing trace with hash 794906015, now seen corresponding path program 1 times [2023-08-30 00:41:35,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:41:35,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958827833] [2023-08-30 00:41:35,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:41:35,527 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:35,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:41:35,528 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:41:35,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-08-30 00:41:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:41:35,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-30 00:41:35,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:41:35,679 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 00:41:35,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 00:41:35,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:41:35,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:41:36,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:41:36,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:41:36,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958827833] [2023-08-30 00:41:36,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958827833] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:41:36,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 00:41:36,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2023-08-30 00:41:36,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553013600] [2023-08-30 00:41:36,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 00:41:36,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 00:41:36,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:41:36,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 00:41:36,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-08-30 00:41:39,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 333 [2023-08-30 00:41:39,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 56 transitions, 404 flow. Second operand has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:39,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:41:39,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 333 [2023-08-30 00:41:39,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:41:46,481 INFO L130 PetriNetUnfolder]: 29141/40429 cut-off events. [2023-08-30 00:41:46,481 INFO L131 PetriNetUnfolder]: For 126617/130962 co-relation queries the response was YES. [2023-08-30 00:41:46,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156516 conditions, 40429 events. 29141/40429 cut-off events. For 126617/130962 co-relation queries the response was YES. Maximal size of possible extension queue 1342. Compared 244603 event pairs, 13879 based on Foata normal form. 5093/45280 useless extension candidates. Maximal degree in co-relation 156473. Up to 20281 conditions per place. [2023-08-30 00:41:46,803 INFO L137 encePairwiseOnDemand]: 325/333 looper letters, 196 selfloop transitions, 18 changer transitions 0/217 dead transitions. [2023-08-30 00:41:46,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 217 transitions, 1761 flow [2023-08-30 00:41:46,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 00:41:46,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 00:41:46,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2041 transitions. [2023-08-30 00:41:46,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4377949377949378 [2023-08-30 00:41:46,809 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2041 transitions. [2023-08-30 00:41:46,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2041 transitions. [2023-08-30 00:41:46,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:41:46,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2041 transitions. [2023-08-30 00:41:46,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 145.78571428571428) internal successors, (2041), 14 states have internal predecessors, (2041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:46,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 333.0) internal successors, (4995), 15 states have internal predecessors, (4995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:46,816 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 333.0) internal successors, (4995), 15 states have internal predecessors, (4995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:46,816 INFO L175 Difference]: Start difference. First operand has 92 places, 56 transitions, 404 flow. Second operand 14 states and 2041 transitions. [2023-08-30 00:41:46,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 217 transitions, 1761 flow [2023-08-30 00:41:47,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 217 transitions, 1698 flow, removed 24 selfloop flow, removed 3 redundant places. [2023-08-30 00:41:47,032 INFO L231 Difference]: Finished difference. Result has 106 places, 62 transitions, 478 flow [2023-08-30 00:41:47,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=478, PETRI_PLACES=106, PETRI_TRANSITIONS=62} [2023-08-30 00:41:47,033 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 55 predicate places. [2023-08-30 00:41:47,033 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 62 transitions, 478 flow [2023-08-30 00:41:47,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:47,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:41:47,033 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-08-30 00:41:47,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-08-30 00:41:47,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:47,240 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:41:47,240 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:41:47,240 INFO L85 PathProgramCache]: Analyzing trace with hash -152326489, now seen corresponding path program 2 times [2023-08-30 00:41:47,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:41:47,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596169554] [2023-08-30 00:41:47,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 00:41:47,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:41:47,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:41:47,241 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:41:47,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-08-30 00:41:47,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 00:41:47,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 00:41:47,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-30 00:41:47,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:41:47,395 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 00:41:47,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 00:41:47,722 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:41:47,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:41:48,515 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:41:48,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:41:48,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596169554] [2023-08-30 00:41:48,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [596169554] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:41:48,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 00:41:48,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2023-08-30 00:41:48,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808672800] [2023-08-30 00:41:48,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 00:41:48,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-30 00:41:48,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:41:48,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-30 00:41:48,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2023-08-30 00:41:53,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 333 [2023-08-30 00:41:53,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 62 transitions, 478 flow. Second operand has 17 states, 17 states have (on average 139.1764705882353) internal successors, (2366), 17 states have internal predecessors, (2366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:41:53,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:41:53,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 333 [2023-08-30 00:41:53,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:42:02,642 INFO L130 PetriNetUnfolder]: 32361/44349 cut-off events. [2023-08-30 00:42:02,642 INFO L131 PetriNetUnfolder]: For 143168/150455 co-relation queries the response was YES. [2023-08-30 00:42:02,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186048 conditions, 44349 events. 32361/44349 cut-off events. For 143168/150455 co-relation queries the response was YES. Maximal size of possible extension queue 2013. Compared 283393 event pairs, 14453 based on Foata normal form. 6093/49688 useless extension candidates. Maximal degree in co-relation 186001. Up to 28090 conditions per place. [2023-08-30 00:42:02,985 INFO L137 encePairwiseOnDemand]: 324/333 looper letters, 302 selfloop transitions, 26 changer transitions 0/333 dead transitions. [2023-08-30 00:42:02,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 333 transitions, 2616 flow [2023-08-30 00:42:02,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-30 00:42:02,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-30 00:42:02,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2723 transitions. [2023-08-30 00:42:02,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4542876209542876 [2023-08-30 00:42:02,991 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2723 transitions. [2023-08-30 00:42:02,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2723 transitions. [2023-08-30 00:42:02,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:42:02,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2723 transitions. [2023-08-30 00:42:02,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 151.27777777777777) internal successors, (2723), 18 states have internal predecessors, (2723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:42:03,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 333.0) internal successors, (6327), 19 states have internal predecessors, (6327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:42:03,000 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 333.0) internal successors, (6327), 19 states have internal predecessors, (6327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:42:03,000 INFO L175 Difference]: Start difference. First operand has 106 places, 62 transitions, 478 flow. Second operand 18 states and 2723 transitions. [2023-08-30 00:42:03,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 333 transitions, 2616 flow [2023-08-30 00:42:03,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 333 transitions, 2556 flow, removed 14 selfloop flow, removed 11 redundant places. [2023-08-30 00:42:03,370 INFO L231 Difference]: Finished difference. Result has 118 places, 77 transitions, 634 flow [2023-08-30 00:42:03,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=634, PETRI_PLACES=118, PETRI_TRANSITIONS=77} [2023-08-30 00:42:03,371 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 67 predicate places. [2023-08-30 00:42:03,371 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 77 transitions, 634 flow [2023-08-30 00:42:03,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 139.1764705882353) internal successors, (2366), 17 states have internal predecessors, (2366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:42:03,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:42:03,371 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 00:42:03,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-08-30 00:42:03,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:42:03,573 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:42:03,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:42:03,573 INFO L85 PathProgramCache]: Analyzing trace with hash -979220145, now seen corresponding path program 2 times [2023-08-30 00:42:03,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:42:03,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521430348] [2023-08-30 00:42:03,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 00:42:03,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:42:03,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:42:03,575 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:42:03,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-08-30 00:42:03,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 00:42:03,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 00:42:03,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-30 00:42:03,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:42:03,739 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 00:42:03,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 00:42:04,003 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:42:04,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:42:04,750 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:42:04,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:42:04,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521430348] [2023-08-30 00:42:04,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521430348] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:42:04,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 00:42:04,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2023-08-30 00:42:04,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8211672] [2023-08-30 00:42:04,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 00:42:04,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-30 00:42:04,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:42:04,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-30 00:42:04,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2023-08-30 00:42:11,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 333 [2023-08-30 00:42:11,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 77 transitions, 634 flow. Second operand has 17 states, 17 states have (on average 139.41176470588235) internal successors, (2370), 17 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:42:11,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:42:11,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 333 [2023-08-30 00:42:11,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:42:20,623 INFO L130 PetriNetUnfolder]: 30603/42180 cut-off events. [2023-08-30 00:42:20,624 INFO L131 PetriNetUnfolder]: For 170570/175156 co-relation queries the response was YES. [2023-08-30 00:42:20,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190215 conditions, 42180 events. 30603/42180 cut-off events. For 170570/175156 co-relation queries the response was YES. Maximal size of possible extension queue 1964. Compared 270080 event pairs, 15280 based on Foata normal form. 3049/44230 useless extension candidates. Maximal degree in co-relation 190167. Up to 30358 conditions per place. [2023-08-30 00:42:20,979 INFO L137 encePairwiseOnDemand]: 324/333 looper letters, 278 selfloop transitions, 26 changer transitions 0/312 dead transitions. [2023-08-30 00:42:20,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 312 transitions, 2555 flow [2023-08-30 00:42:20,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-30 00:42:20,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-30 00:42:20,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2707 transitions. [2023-08-30 00:42:20,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45161828495161827 [2023-08-30 00:42:20,984 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2707 transitions. [2023-08-30 00:42:20,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2707 transitions. [2023-08-30 00:42:20,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:42:20,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2707 transitions. [2023-08-30 00:42:20,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 150.38888888888889) internal successors, (2707), 18 states have internal predecessors, (2707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:42:20,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 333.0) internal successors, (6327), 19 states have internal predecessors, (6327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:42:20,991 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 333.0) internal successors, (6327), 19 states have internal predecessors, (6327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:42:20,992 INFO L175 Difference]: Start difference. First operand has 118 places, 77 transitions, 634 flow. Second operand 18 states and 2707 transitions. [2023-08-30 00:42:20,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 312 transitions, 2555 flow [2023-08-30 00:42:21,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 312 transitions, 2488 flow, removed 26 selfloop flow, removed 5 redundant places. [2023-08-30 00:42:21,674 INFO L231 Difference]: Finished difference. Result has 136 places, 88 transitions, 795 flow [2023-08-30 00:42:21,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=795, PETRI_PLACES=136, PETRI_TRANSITIONS=88} [2023-08-30 00:42:21,675 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 85 predicate places. [2023-08-30 00:42:21,675 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 88 transitions, 795 flow [2023-08-30 00:42:21,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 139.41176470588235) internal successors, (2370), 17 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:42:21,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:42:21,675 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1] [2023-08-30 00:42:21,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-08-30 00:42:21,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:42:21,883 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:42:21,884 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:42:21,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1674697708, now seen corresponding path program 3 times [2023-08-30 00:42:21,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:42:21,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1463376975] [2023-08-30 00:42:21,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 00:42:21,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:42:21,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:42:21,885 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:42:21,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-08-30 00:42:22,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-08-30 00:42:22,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 00:42:22,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-30 00:42:22,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:42:22,100 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 00:42:22,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 00:42:22,351 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:42:22,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:42:24,113 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:42:24,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:42:24,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1463376975] [2023-08-30 00:42:24,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1463376975] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:42:24,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 00:42:24,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2023-08-30 00:42:24,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140412608] [2023-08-30 00:42:24,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 00:42:24,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-30 00:42:24,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:42:24,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-30 00:42:24,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2023-08-30 00:42:36,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 333 [2023-08-30 00:42:36,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 88 transitions, 795 flow. Second operand has 24 states, 24 states have (on average 147.0) internal successors, (3528), 24 states have internal predecessors, (3528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:42:36,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:42:36,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 333 [2023-08-30 00:42:36,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:43:02,205 INFO L130 PetriNetUnfolder]: 75695/103881 cut-off events. [2023-08-30 00:43:02,205 INFO L131 PetriNetUnfolder]: For 548522/567521 co-relation queries the response was YES. [2023-08-30 00:43:03,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502088 conditions, 103881 events. 75695/103881 cut-off events. For 548522/567521 co-relation queries the response was YES. Maximal size of possible extension queue 2666. Compared 688403 event pairs, 47981 based on Foata normal form. 12502/115749 useless extension candidates. Maximal degree in co-relation 502033. Up to 26863 conditions per place. [2023-08-30 00:43:03,467 INFO L137 encePairwiseOnDemand]: 329/333 looper letters, 734 selfloop transitions, 24 changer transitions 0/770 dead transitions. [2023-08-30 00:43:03,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 770 transitions, 7003 flow [2023-08-30 00:43:03,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-30 00:43:03,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-30 00:43:03,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4017 transitions. [2023-08-30 00:43:03,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5026276276276276 [2023-08-30 00:43:03,472 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4017 transitions. [2023-08-30 00:43:03,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4017 transitions. [2023-08-30 00:43:03,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:43:03,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4017 transitions. [2023-08-30 00:43:03,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 167.375) internal successors, (4017), 24 states have internal predecessors, (4017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:43:03,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 333.0) internal successors, (8325), 25 states have internal predecessors, (8325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:43:03,481 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 333.0) internal successors, (8325), 25 states have internal predecessors, (8325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:43:03,481 INFO L175 Difference]: Start difference. First operand has 136 places, 88 transitions, 795 flow. Second operand 24 states and 4017 transitions. [2023-08-30 00:43:03,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 770 transitions, 7003 flow [2023-08-30 00:43:07,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 770 transitions, 6978 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-30 00:43:07,108 INFO L231 Difference]: Finished difference. Result has 168 places, 101 transitions, 963 flow [2023-08-30 00:43:07,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=963, PETRI_PLACES=168, PETRI_TRANSITIONS=101} [2023-08-30 00:43:07,109 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 117 predicate places. [2023-08-30 00:43:07,109 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 101 transitions, 963 flow [2023-08-30 00:43:07,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 147.0) internal successors, (3528), 24 states have internal predecessors, (3528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:43:07,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:43:07,109 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 2, 1, 1, 1, 1, 1] [2023-08-30 00:43:07,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-08-30 00:43:07,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:43:07,310 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:43:07,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:43:07,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1023231657, now seen corresponding path program 3 times [2023-08-30 00:43:07,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:43:07,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334897585] [2023-08-30 00:43:07,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 00:43:07,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:43:07,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:43:07,311 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:43:07,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-08-30 00:43:07,461 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-30 00:43:07,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 00:43:07,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 19 conjunts are in the unsatisfiable core [2023-08-30 00:43:07,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:43:07,544 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 00:43:07,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 00:43:07,752 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 00:43:07,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:43:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 00:43:08,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:43:08,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334897585] [2023-08-30 00:43:08,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334897585] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:43:08,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 00:43:08,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-08-30 00:43:08,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269701649] [2023-08-30 00:43:08,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 00:43:08,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-30 00:43:08,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:43:08,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-30 00:43:08,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-08-30 00:43:11,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 333 [2023-08-30 00:43:11,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 101 transitions, 963 flow. Second operand has 16 states, 16 states have (on average 140.25) internal successors, (2244), 16 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:43:11,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:43:11,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 333 [2023-08-30 00:43:11,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:43:25,445 INFO L130 PetriNetUnfolder]: 73981/100921 cut-off events. [2023-08-30 00:43:25,445 INFO L131 PetriNetUnfolder]: For 495364/511171 co-relation queries the response was YES. [2023-08-30 00:43:26,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488430 conditions, 100921 events. 73981/100921 cut-off events. For 495364/511171 co-relation queries the response was YES. Maximal size of possible extension queue 2427. Compared 664060 event pairs, 44223 based on Foata normal form. 10016/109548 useless extension candidates. Maximal degree in co-relation 488361. Up to 94485 conditions per place. [2023-08-30 00:43:26,911 INFO L137 encePairwiseOnDemand]: 327/333 looper letters, 248 selfloop transitions, 17 changer transitions 0/273 dead transitions. [2023-08-30 00:43:26,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 273 transitions, 2579 flow [2023-08-30 00:43:26,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-30 00:43:26,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-30 00:43:26,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2254 transitions. [2023-08-30 00:43:26,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45125125125125126 [2023-08-30 00:43:26,914 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2254 transitions. [2023-08-30 00:43:26,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2254 transitions. [2023-08-30 00:43:26,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:43:26,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2254 transitions. [2023-08-30 00:43:26,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 150.26666666666668) internal successors, (2254), 15 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:43:26,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 333.0) internal successors, (5328), 16 states have internal predecessors, (5328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:43:26,919 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 333.0) internal successors, (5328), 16 states have internal predecessors, (5328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:43:26,919 INFO L175 Difference]: Start difference. First operand has 168 places, 101 transitions, 963 flow. Second operand 15 states and 2254 transitions. [2023-08-30 00:43:26,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 273 transitions, 2579 flow [2023-08-30 00:43:30,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 273 transitions, 2531 flow, removed 13 selfloop flow, removed 10 redundant places. [2023-08-30 00:43:30,506 INFO L231 Difference]: Finished difference. Result has 176 places, 104 transitions, 995 flow [2023-08-30 00:43:30,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=995, PETRI_PLACES=176, PETRI_TRANSITIONS=104} [2023-08-30 00:43:30,507 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 125 predicate places. [2023-08-30 00:43:30,507 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 104 transitions, 995 flow [2023-08-30 00:43:30,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 140.25) internal successors, (2244), 16 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:43:30,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:43:30,507 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 00:43:30,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-08-30 00:43:30,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:43:30,709 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:43:30,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:43:30,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1723796892, now seen corresponding path program 1 times [2023-08-30 00:43:30,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:43:30,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598027307] [2023-08-30 00:43:30,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 00:43:30,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:43:30,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:43:30,710 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:43:30,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-08-30 00:43:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 00:43:30,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-30 00:43:30,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:43:30,882 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 00:43:30,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 00:43:31,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:43:31,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:43:32,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:43:32,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:43:32,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598027307] [2023-08-30 00:43:32,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598027307] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:43:32,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 00:43:32,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2023-08-30 00:43:32,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581951537] [2023-08-30 00:43:32,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 00:43:32,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 00:43:32,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:43:32,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 00:43:32,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-08-30 00:43:40,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 333 [2023-08-30 00:43:40,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 104 transitions, 995 flow. Second operand has 14 states, 14 states have (on average 136.71428571428572) internal successors, (1914), 14 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:43:40,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:43:40,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 333 [2023-08-30 00:43:40,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:44:00,683 INFO L130 PetriNetUnfolder]: 75108/104731 cut-off events. [2023-08-30 00:44:00,683 INFO L131 PetriNetUnfolder]: For 568812/582262 co-relation queries the response was YES. [2023-08-30 00:44:01,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494303 conditions, 104731 events. 75108/104731 cut-off events. For 568812/582262 co-relation queries the response was YES. Maximal size of possible extension queue 2146. Compared 688174 event pairs, 34615 based on Foata normal form. 11824/115987 useless extension candidates. Maximal degree in co-relation 494229. Up to 54100 conditions per place. [2023-08-30 00:44:02,391 INFO L137 encePairwiseOnDemand]: 325/333 looper letters, 378 selfloop transitions, 43 changer transitions 0/430 dead transitions. [2023-08-30 00:44:02,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 430 transitions, 4402 flow [2023-08-30 00:44:02,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-30 00:44:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-30 00:44:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3338 transitions. [2023-08-30 00:44:02,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4358271314793054 [2023-08-30 00:44:02,398 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 3338 transitions. [2023-08-30 00:44:02,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 3338 transitions. [2023-08-30 00:44:02,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:44:02,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 3338 transitions. [2023-08-30 00:44:02,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 145.1304347826087) internal successors, (3338), 23 states have internal predecessors, (3338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:44:02,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 333.0) internal successors, (7992), 24 states have internal predecessors, (7992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:44:02,405 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 333.0) internal successors, (7992), 24 states have internal predecessors, (7992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:44:02,405 INFO L175 Difference]: Start difference. First operand has 176 places, 104 transitions, 995 flow. Second operand 23 states and 3338 transitions. [2023-08-30 00:44:02,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 430 transitions, 4402 flow [2023-08-30 00:44:05,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 430 transitions, 4370 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-08-30 00:44:05,895 INFO L231 Difference]: Finished difference. Result has 197 places, 129 transitions, 1319 flow [2023-08-30 00:44:05,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1319, PETRI_PLACES=197, PETRI_TRANSITIONS=129} [2023-08-30 00:44:05,896 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 146 predicate places. [2023-08-30 00:44:05,896 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 129 transitions, 1319 flow [2023-08-30 00:44:05,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 136.71428571428572) internal successors, (1914), 14 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:44:05,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:44:05,896 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 3, 1, 1, 1, 1, 1] [2023-08-30 00:44:05,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-08-30 00:44:06,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:44:06,097 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:44:06,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:44:06,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1973060498, now seen corresponding path program 4 times [2023-08-30 00:44:06,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:44:06,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97064574] [2023-08-30 00:44:06,097 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 00:44:06,097 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:44:06,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:44:06,098 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:44:06,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-08-30 00:44:06,192 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 00:44:06,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 00:44:06,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 23 conjunts are in the unsatisfiable core [2023-08-30 00:44:06,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:44:06,271 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 00:44:06,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 00:44:06,494 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 00:44:06,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:44:07,807 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:44:07,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:44:07,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97064574] [2023-08-30 00:44:07,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97064574] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:44:07,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 00:44:07,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2023-08-30 00:44:07,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409045814] [2023-08-30 00:44:07,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 00:44:07,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-30 00:44:07,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:44:07,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-30 00:44:07,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2023-08-30 00:44:21,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 333 [2023-08-30 00:44:21,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 129 transitions, 1319 flow. Second operand has 22 states, 22 states have (on average 138.1818181818182) internal successors, (3040), 22 states have internal predecessors, (3040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:44:21,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:44:21,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 333 [2023-08-30 00:44:21,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:44:40,490 INFO L130 PetriNetUnfolder]: 76746/104803 cut-off events. [2023-08-30 00:44:40,490 INFO L131 PetriNetUnfolder]: For 810357/828094 co-relation queries the response was YES. [2023-08-30 00:44:41,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584121 conditions, 104803 events. 76746/104803 cut-off events. For 810357/828094 co-relation queries the response was YES. Maximal size of possible extension queue 2506. Compared 686811 event pairs, 41272 based on Foata normal form. 11113/113707 useless extension candidates. Maximal degree in co-relation 584041. Up to 88262 conditions per place. [2023-08-30 00:44:42,432 INFO L137 encePairwiseOnDemand]: 325/333 looper letters, 435 selfloop transitions, 50 changer transitions 0/495 dead transitions. [2023-08-30 00:44:42,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 495 transitions, 5074 flow [2023-08-30 00:44:42,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-30 00:44:42,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-30 00:44:42,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3591 transitions. [2023-08-30 00:44:42,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44932432432432434 [2023-08-30 00:44:42,435 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3591 transitions. [2023-08-30 00:44:42,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3591 transitions. [2023-08-30 00:44:42,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:44:42,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3591 transitions. [2023-08-30 00:44:42,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 149.625) internal successors, (3591), 24 states have internal predecessors, (3591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:44:42,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 333.0) internal successors, (8325), 25 states have internal predecessors, (8325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:44:42,442 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 333.0) internal successors, (8325), 25 states have internal predecessors, (8325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:44:42,442 INFO L175 Difference]: Start difference. First operand has 197 places, 129 transitions, 1319 flow. Second operand 24 states and 3591 transitions. [2023-08-30 00:44:42,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 495 transitions, 5074 flow [2023-08-30 00:44:47,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 495 transitions, 4822 flow, removed 100 selfloop flow, removed 10 redundant places. [2023-08-30 00:44:47,717 INFO L231 Difference]: Finished difference. Result has 211 places, 146 transitions, 1639 flow [2023-08-30 00:44:47,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=1207, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1639, PETRI_PLACES=211, PETRI_TRANSITIONS=146} [2023-08-30 00:44:47,717 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 160 predicate places. [2023-08-30 00:44:47,717 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 146 transitions, 1639 flow [2023-08-30 00:44:47,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 138.1818181818182) internal successors, (3040), 22 states have internal predecessors, (3040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:44:47,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:44:47,718 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 00:44:47,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-08-30 00:44:47,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:44:47,921 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:44:47,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:44:47,921 INFO L85 PathProgramCache]: Analyzing trace with hash -10700998, now seen corresponding path program 2 times [2023-08-30 00:44:47,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:44:47,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [69291037] [2023-08-30 00:44:47,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 00:44:47,922 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:44:47,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:44:47,923 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:44:47,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-08-30 00:44:48,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 00:44:48,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 00:44:48,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-30 00:44:48,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:44:48,092 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 00:44:48,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 00:44:48,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-30 00:44:48,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 00:44:48,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:44:48,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [69291037] [2023-08-30 00:44:48,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [69291037] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 00:44:48,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 00:44:48,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 00:44:48,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46419644] [2023-08-30 00:44:48,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 00:44:48,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 00:44:48,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:44:48,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 00:44:48,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 00:44:48,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 333 [2023-08-30 00:44:48,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 146 transitions, 1639 flow. Second operand has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:44:48,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:44:48,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 333 [2023-08-30 00:44:48,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:44:58,925 INFO L130 PetriNetUnfolder]: 59502/83028 cut-off events. [2023-08-30 00:44:58,925 INFO L131 PetriNetUnfolder]: For 756545/767832 co-relation queries the response was YES. [2023-08-30 00:44:59,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448272 conditions, 83028 events. 59502/83028 cut-off events. For 756545/767832 co-relation queries the response was YES. Maximal size of possible extension queue 1652. Compared 534579 event pairs, 12826 based on Foata normal form. 14046/96105 useless extension candidates. Maximal degree in co-relation 448193. Up to 55866 conditions per place. [2023-08-30 00:45:00,256 INFO L137 encePairwiseOnDemand]: 329/333 looper letters, 173 selfloop transitions, 16 changer transitions 0/198 dead transitions. [2023-08-30 00:45:00,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 198 transitions, 2696 flow [2023-08-30 00:45:00,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 00:45:00,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 00:45:00,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 752 transitions. [2023-08-30 00:45:00,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45165165165165166 [2023-08-30 00:45:00,259 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 752 transitions. [2023-08-30 00:45:00,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 752 transitions. [2023-08-30 00:45:00,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:45:00,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 752 transitions. [2023-08-30 00:45:00,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:45:00,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:45:00,261 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:45:00,261 INFO L175 Difference]: Start difference. First operand has 211 places, 146 transitions, 1639 flow. Second operand 5 states and 752 transitions. [2023-08-30 00:45:00,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 198 transitions, 2696 flow [2023-08-30 00:45:04,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 198 transitions, 2368 flow, removed 109 selfloop flow, removed 23 redundant places. [2023-08-30 00:45:04,418 INFO L231 Difference]: Finished difference. Result has 191 places, 145 transitions, 1444 flow [2023-08-30 00:45:04,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=1412, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1444, PETRI_PLACES=191, PETRI_TRANSITIONS=145} [2023-08-30 00:45:04,419 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 140 predicate places. [2023-08-30 00:45:04,419 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 145 transitions, 1444 flow [2023-08-30 00:45:04,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:45:04,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:45:04,419 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1] [2023-08-30 00:45:04,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-08-30 00:45:04,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:45:04,621 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:45:04,621 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:45:04,621 INFO L85 PathProgramCache]: Analyzing trace with hash -957933502, now seen corresponding path program 5 times [2023-08-30 00:45:04,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:45:04,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977294901] [2023-08-30 00:45:04,621 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 00:45:04,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:45:04,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:45:04,623 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:45:04,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-08-30 00:45:04,742 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-30 00:45:04,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 00:45:04,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 26 conjunts are in the unsatisfiable core [2023-08-30 00:45:04,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:45:04,819 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 00:45:04,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 00:45:05,144 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:45:05,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:45:06,783 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:45:06,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:45:06,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977294901] [2023-08-30 00:45:06,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977294901] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:45:06,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 00:45:06,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2023-08-30 00:45:06,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901424096] [2023-08-30 00:45:06,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 00:45:06,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-30 00:45:06,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:45:06,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-30 00:45:06,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2023-08-30 00:45:21,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 333 [2023-08-30 00:45:21,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 145 transitions, 1444 flow. Second operand has 24 states, 24 states have (on average 137.08333333333334) internal successors, (3290), 24 states have internal predecessors, (3290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:45:21,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:45:21,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 333 [2023-08-30 00:45:21,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:45:53,299 INFO L130 PetriNetUnfolder]: 80373/108254 cut-off events. [2023-08-30 00:45:53,299 INFO L131 PetriNetUnfolder]: For 1288853/1308304 co-relation queries the response was YES. [2023-08-30 00:45:54,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 610849 conditions, 108254 events. 80373/108254 cut-off events. For 1288853/1308304 co-relation queries the response was YES. Maximal size of possible extension queue 2083. Compared 686709 event pairs, 4141 based on Foata normal form. 24729/132592 useless extension candidates. Maximal degree in co-relation 610777. Up to 29001 conditions per place. [2023-08-30 00:45:55,069 INFO L137 encePairwiseOnDemand]: 326/333 looper letters, 828 selfloop transitions, 56 changer transitions 0/894 dead transitions. [2023-08-30 00:45:55,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 894 transitions, 9841 flow [2023-08-30 00:45:55,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-08-30 00:45:55,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2023-08-30 00:45:55,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 6333 transitions. [2023-08-30 00:45:55,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44227948879111667 [2023-08-30 00:45:55,077 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 6333 transitions. [2023-08-30 00:45:55,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 6333 transitions. [2023-08-30 00:45:55,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:45:55,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 6333 transitions. [2023-08-30 00:45:55,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 147.27906976744185) internal successors, (6333), 43 states have internal predecessors, (6333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:45:55,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 333.0) internal successors, (14652), 44 states have internal predecessors, (14652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:45:55,092 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 333.0) internal successors, (14652), 44 states have internal predecessors, (14652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:45:55,092 INFO L175 Difference]: Start difference. First operand has 191 places, 145 transitions, 1444 flow. Second operand 43 states and 6333 transitions. [2023-08-30 00:45:55,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 894 transitions, 9841 flow [2023-08-30 00:45:58,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 894 transitions, 9815 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 00:45:58,617 INFO L231 Difference]: Finished difference. Result has 230 places, 165 transitions, 1656 flow [2023-08-30 00:45:58,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=1656, PETRI_PLACES=230, PETRI_TRANSITIONS=165} [2023-08-30 00:45:58,617 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 179 predicate places. [2023-08-30 00:45:58,618 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 165 transitions, 1656 flow [2023-08-30 00:45:58,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 137.08333333333334) internal successors, (3290), 24 states have internal predecessors, (3290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:45:58,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:45:58,618 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 00:45:58,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-08-30 00:45:58,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:45:58,825 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:45:58,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:45:58,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1895274271, now seen corresponding path program 3 times [2023-08-30 00:45:58,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:45:58,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132128162] [2023-08-30 00:45:58,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 00:45:58,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:45:58,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:45:58,826 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:45:58,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-08-30 00:45:58,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-30 00:45:58,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 00:45:58,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-30 00:45:58,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:45:59,062 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 00:45:59,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 00:45:59,302 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:45:59,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:46:00,483 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:46:00,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:46:00,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132128162] [2023-08-30 00:46:00,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2132128162] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:46:00,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 00:46:00,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2023-08-30 00:46:00,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505103204] [2023-08-30 00:46:00,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 00:46:00,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-30 00:46:00,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:46:00,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-30 00:46:00,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2023-08-30 00:46:10,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 333 [2023-08-30 00:46:10,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 165 transitions, 1656 flow. Second operand has 21 states, 21 states have (on average 139.33333333333334) internal successors, (2926), 21 states have internal predecessors, (2926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:46:10,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:46:10,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 333 [2023-08-30 00:46:10,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:46:32,095 INFO L130 PetriNetUnfolder]: 88786/119937 cut-off events. [2023-08-30 00:46:32,095 INFO L131 PetriNetUnfolder]: For 1244191/1256334 co-relation queries the response was YES. [2023-08-30 00:46:33,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 707019 conditions, 119937 events. 88786/119937 cut-off events. For 1244191/1256334 co-relation queries the response was YES. Maximal size of possible extension queue 2358. Compared 754523 event pairs, 45207 based on Foata normal form. 5662/124161 useless extension candidates. Maximal degree in co-relation 706947. Up to 93287 conditions per place. [2023-08-30 00:46:34,134 INFO L137 encePairwiseOnDemand]: 324/333 looper letters, 630 selfloop transitions, 59 changer transitions 0/700 dead transitions. [2023-08-30 00:46:34,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 700 transitions, 7087 flow [2023-08-30 00:46:34,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-30 00:46:34,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-30 00:46:34,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3757 transitions. [2023-08-30 00:46:34,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4512912912912913 [2023-08-30 00:46:34,145 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3757 transitions. [2023-08-30 00:46:34,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3757 transitions. [2023-08-30 00:46:34,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:46:34,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3757 transitions. [2023-08-30 00:46:34,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 150.28) internal successors, (3757), 25 states have internal predecessors, (3757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:46:34,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 333.0) internal successors, (8658), 26 states have internal predecessors, (8658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:46:34,153 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 333.0) internal successors, (8658), 26 states have internal predecessors, (8658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:46:34,153 INFO L175 Difference]: Start difference. First operand has 230 places, 165 transitions, 1656 flow. Second operand 25 states and 3757 transitions. [2023-08-30 00:46:34,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 700 transitions, 7087 flow [2023-08-30 00:46:38,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 700 transitions, 5761 flow, removed 368 selfloop flow, removed 25 redundant places. [2023-08-30 00:46:38,364 INFO L231 Difference]: Finished difference. Result has 237 places, 181 transitions, 1807 flow [2023-08-30 00:46:38,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1807, PETRI_PLACES=237, PETRI_TRANSITIONS=181} [2023-08-30 00:46:38,364 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 186 predicate places. [2023-08-30 00:46:38,364 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 181 transitions, 1807 flow [2023-08-30 00:46:38,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 139.33333333333334) internal successors, (2926), 21 states have internal predecessors, (2926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:46:38,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:46:38,365 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 00:46:38,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-08-30 00:46:38,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:46:38,567 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:46:38,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:46:38,568 INFO L85 PathProgramCache]: Analyzing trace with hash -2073446358, now seen corresponding path program 4 times [2023-08-30 00:46:38,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:46:38,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817803244] [2023-08-30 00:46:38,568 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 00:46:38,568 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:46:38,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:46:38,569 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:46:38,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-08-30 00:46:38,677 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 00:46:38,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 00:46:38,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 23 conjunts are in the unsatisfiable core [2023-08-30 00:46:38,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:46:38,757 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 00:46:38,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 00:46:39,030 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-30 00:46:39,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:46:39,847 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-30 00:46:39,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:46:39,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817803244] [2023-08-30 00:46:39,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817803244] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:46:39,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 00:46:39,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2023-08-30 00:46:39,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100072194] [2023-08-30 00:46:39,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 00:46:39,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-30 00:46:39,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:46:39,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-30 00:46:39,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-08-30 00:46:46,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 333 [2023-08-30 00:46:46,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 181 transitions, 1807 flow. Second operand has 16 states, 16 states have (on average 142.5) internal successors, (2280), 16 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:46:46,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:46:46,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 333 [2023-08-30 00:46:46,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 00:47:27,874 INFO L130 PetriNetUnfolder]: 181128/245980 cut-off events. [2023-08-30 00:47:27,874 INFO L131 PetriNetUnfolder]: For 2599782/2621348 co-relation queries the response was YES. [2023-08-30 00:47:30,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1385973 conditions, 245980 events. 181128/245980 cut-off events. For 2599782/2621348 co-relation queries the response was YES. Maximal size of possible extension queue 4724. Compared 1733878 event pairs, 14466 based on Foata normal form. 21982/264037 useless extension candidates. Maximal degree in co-relation 1385902. Up to 66309 conditions per place. [2023-08-30 00:47:31,768 INFO L137 encePairwiseOnDemand]: 327/333 looper letters, 683 selfloop transitions, 58 changer transitions 0/752 dead transitions. [2023-08-30 00:47:31,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 752 transitions, 6745 flow [2023-08-30 00:47:31,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 00:47:31,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 00:47:31,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2161 transitions. [2023-08-30 00:47:31,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46353496353496354 [2023-08-30 00:47:31,771 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2161 transitions. [2023-08-30 00:47:31,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2161 transitions. [2023-08-30 00:47:31,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 00:47:31,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2161 transitions. [2023-08-30 00:47:31,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 154.35714285714286) internal successors, (2161), 14 states have internal predecessors, (2161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:47:31,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 333.0) internal successors, (4995), 15 states have internal predecessors, (4995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:47:31,776 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 333.0) internal successors, (4995), 15 states have internal predecessors, (4995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:47:31,776 INFO L175 Difference]: Start difference. First operand has 237 places, 181 transitions, 1807 flow. Second operand 14 states and 2161 transitions. [2023-08-30 00:47:31,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 752 transitions, 6745 flow [2023-08-30 00:47:43,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 752 transitions, 6524 flow, removed 20 selfloop flow, removed 11 redundant places. [2023-08-30 00:47:43,984 INFO L231 Difference]: Finished difference. Result has 246 places, 192 transitions, 2084 flow [2023-08-30 00:47:43,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=1709, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2084, PETRI_PLACES=246, PETRI_TRANSITIONS=192} [2023-08-30 00:47:43,984 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 195 predicate places. [2023-08-30 00:47:43,984 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 192 transitions, 2084 flow [2023-08-30 00:47:43,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 142.5) internal successors, (2280), 16 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:47:43,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 00:47:43,985 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 4, 1, 1, 1, 1, 1] [2023-08-30 00:47:43,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-08-30 00:47:44,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:47:44,193 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-30 00:47:44,193 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 00:47:44,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1934412834, now seen corresponding path program 6 times [2023-08-30 00:47:44,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 00:47:44,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990026584] [2023-08-30 00:47:44,194 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 00:47:44,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 00:47:44,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 00:47:44,195 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 00:47:44,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-08-30 00:47:44,501 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2023-08-30 00:47:44,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 00:47:44,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-30 00:47:44,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 00:47:44,582 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2023-08-30 00:47:44,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 44 [2023-08-30 00:47:45,093 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:47:45,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 00:47:48,379 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 00:47:48,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 00:47:48,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990026584] [2023-08-30 00:47:48,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [990026584] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 00:47:48,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 00:47:48,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2023-08-30 00:47:48,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174216518] [2023-08-30 00:47:48,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 00:47:48,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-30 00:47:48,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 00:47:48,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-30 00:47:48,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=987, Unknown=0, NotChecked=0, Total=1190 [2023-08-30 00:48:19,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 333 [2023-08-30 00:48:19,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 192 transitions, 2084 flow. Second operand has 35 states, 35 states have (on average 139.0857142857143) internal successors, (4868), 35 states have internal predecessors, (4868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 00:48:19,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 00:48:19,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 333 [2023-08-30 00:48:19,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand