./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-ext/09_fmaxsym.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --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/pthread-ext/09_fmaxsym.i -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 0bf02669c3dd381b0745ab8dce392518dfe698af15c4a94bd383f1dab20a8c06 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:29:39,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:29:39,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:29:39,500 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:29:39,502 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:29:39,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:29:39,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:29:39,509 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:29:39,511 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:29:39,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:29:39,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:29:39,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:29:39,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:29:39,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:29:39,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:29:39,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:29:39,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:29:39,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:29:39,527 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:29:39,532 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:29:39,534 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:29:39,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:29:39,538 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:29:39,539 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:29:39,544 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:29:39,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:29:39,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:29:39,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:29:39,548 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:29:39,549 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:29:39,549 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:29:39,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:29:39,553 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:29:39,554 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:29:39,555 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:29:39,555 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:29:39,556 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:29:39,556 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:29:39,556 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:29:39,557 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:29:39,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:29:39,559 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 02:29:39,597 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:29:39,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:29:39,598 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:29:39,598 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:29:39,599 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:29:39,599 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:29:39,600 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:29:39,600 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:29:39,600 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:29:39,600 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:29:39,601 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:29:39,601 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:29:39,601 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:29:39,601 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:29:39,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:29:39,602 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:29:39,602 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:29:39,602 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:29:39,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:29:39,602 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:29:39,603 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:29:39,603 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:29:39,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:29:39,603 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:29:39,603 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:29:39,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:29:39,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:29:39,604 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:29:39,604 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:29:39,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:29:39,604 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:29:39,605 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:29:39,605 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:29:39,605 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:29:39,605 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 -> 0bf02669c3dd381b0745ab8dce392518dfe698af15c4a94bd383f1dab20a8c06 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 -> TOGETHER [2023-08-30 02:29:39,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:29:39,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:29:39,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:29:39,921 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:29:39,921 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:29:39,922 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/09_fmaxsym.i [2023-08-30 02:29:41,131 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:29:41,382 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:29:41,382 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/09_fmaxsym.i [2023-08-30 02:29:41,407 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d68648317/72cb160140fb4f2b8653b6008563e667/FLAG59e1b8667 [2023-08-30 02:29:41,424 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d68648317/72cb160140fb4f2b8653b6008563e667 [2023-08-30 02:29:41,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:29:41,428 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:29:41,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:29:41,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:29:41,433 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:29:41,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:29:41" (1/1) ... [2023-08-30 02:29:41,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a15e06a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:29:41, skipping insertion in model container [2023-08-30 02:29:41,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:29:41" (1/1) ... [2023-08-30 02:29:41,439 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:29:41,486 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:29:41,795 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/09_fmaxsym.i[30422,30435] [2023-08-30 02:29:41,801 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:29:41,834 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:29:41,891 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/09_fmaxsym.i[30422,30435] [2023-08-30 02:29:41,895 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:29:41,927 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:29:41,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:29:41 WrapperNode [2023-08-30 02:29:41,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:29:41,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:29:41,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:29:41,930 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:29:41,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:29:41" (1/1) ... [2023-08-30 02:29:41,946 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:29:41" (1/1) ... [2023-08-30 02:29:41,962 INFO L138 Inliner]: procedures = 171, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 78 [2023-08-30 02:29:41,962 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:29:41,963 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:29:41,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:29:41,963 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:29:41,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:29:41" (1/1) ... [2023-08-30 02:29:41,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:29:41" (1/1) ... [2023-08-30 02:29:41,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:29:41" (1/1) ... [2023-08-30 02:29:41,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:29:41" (1/1) ... [2023-08-30 02:29:41,977 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:29:41" (1/1) ... [2023-08-30 02:29:41,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:29:41" (1/1) ... [2023-08-30 02:29:41,981 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:29:41" (1/1) ... [2023-08-30 02:29:41,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:29:41" (1/1) ... [2023-08-30 02:29:41,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:29:41,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:29:41,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:29:41,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:29:41,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:29:41" (1/1) ... [2023-08-30 02:29:41,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:29:42,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:29:42,014 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 02:29:42,021 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 02:29:42,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 02:29:42,041 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-30 02:29:42,041 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-30 02:29:42,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:29:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:29:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:29:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:29:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:29:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:29:42,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:29:42,044 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 02:29:42,161 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:29:42,166 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:29:42,336 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:29:42,376 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:29:42,377 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-30 02:29:42,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:29:42 BoogieIcfgContainer [2023-08-30 02:29:42,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:29:42,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:29:42,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:29:42,383 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:29:42,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:29:41" (1/3) ... [2023-08-30 02:29:42,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d294c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:29:42, skipping insertion in model container [2023-08-30 02:29:42,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:29:41" (2/3) ... [2023-08-30 02:29:42,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d294c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:29:42, skipping insertion in model container [2023-08-30 02:29:42,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:29:42" (3/3) ... [2023-08-30 02:29:42,386 INFO L112 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym.i [2023-08-30 02:29:42,400 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:29:42,400 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-30 02:29:42,400 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:29:42,456 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:29:42,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 80 transitions, 165 flow [2023-08-30 02:29:42,531 INFO L130 PetriNetUnfolder]: 7/95 cut-off events. [2023-08-30 02:29:42,531 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:29:42,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 95 events. 7/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 122 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2023-08-30 02:29:42,536 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 80 transitions, 165 flow [2023-08-30 02:29:42,539 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 80 transitions, 165 flow [2023-08-30 02:29:42,550 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:29:42,562 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 80 transitions, 165 flow [2023-08-30 02:29:42,570 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 80 transitions, 165 flow [2023-08-30 02:29:42,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 80 transitions, 165 flow [2023-08-30 02:29:42,609 INFO L130 PetriNetUnfolder]: 7/95 cut-off events. [2023-08-30 02:29:42,609 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:29:42,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 95 events. 7/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 122 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2023-08-30 02:29:42,612 INFO L119 LiptonReduction]: Number of co-enabled transitions 1440 [2023-08-30 02:29:45,434 INFO L134 LiptonReduction]: Checked pairs total: 1568 [2023-08-30 02:29:45,434 INFO L136 LiptonReduction]: Total number of compositions: 87 [2023-08-30 02:29:45,446 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:29:45,451 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;@4a5fc5d8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:29:45,451 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-30 02:29:45,453 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 02:29:45,456 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:29:45,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:29:45,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 02:29:45,457 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-08-30 02:29:45,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:29:45,461 INFO L85 PathProgramCache]: Analyzing trace with hash 12198, now seen corresponding path program 1 times [2023-08-30 02:29:45,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:29:45,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072887035] [2023-08-30 02:29:45,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:29:45,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:29:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:29:45,594 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 02:29:45,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:29:45,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072887035] [2023-08-30 02:29:45,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072887035] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:29:45,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:29:45,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:29:45,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296477555] [2023-08-30 02:29:45,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:29:45,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:29:45,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:29:45,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:29:45,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:29:45,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 167 [2023-08-30 02:29:45,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 15 transitions, 35 flow. Second operand has 2 states, 2 states have (on average 72.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 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 02:29:45,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:29:45,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 167 [2023-08-30 02:29:45,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:29:45,663 INFO L130 PetriNetUnfolder]: 21/51 cut-off events. [2023-08-30 02:29:45,663 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:29:45,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 51 events. 21/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 135 event pairs, 16 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 90. Up to 51 conditions per place. [2023-08-30 02:29:45,665 INFO L137 encePairwiseOnDemand]: 164/167 looper letters, 11 selfloop transitions, 0 changer transitions 0/12 dead transitions. [2023-08-30 02:29:45,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 15 places, 12 transitions, 51 flow [2023-08-30 02:29:45,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:29:45,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:29:45,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 156 transitions. [2023-08-30 02:29:45,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46706586826347307 [2023-08-30 02:29:45,676 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 156 transitions. [2023-08-30 02:29:45,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 156 transitions. [2023-08-30 02:29:45,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:29:45,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 156 transitions. [2023-08-30 02:29:45,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 78.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 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 02:29:45,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 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 02:29:45,685 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 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 02:29:45,686 INFO L175 Difference]: Start difference. First operand has 17 places, 15 transitions, 35 flow. Second operand 2 states and 156 transitions. [2023-08-30 02:29:45,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 15 places, 12 transitions, 51 flow [2023-08-30 02:29:45,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 12 transitions, 51 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:29:45,690 INFO L231 Difference]: Finished difference. Result has 15 places, 12 transitions, 29 flow [2023-08-30 02:29:45,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=29, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=29, PETRI_PLACES=15, PETRI_TRANSITIONS=12} [2023-08-30 02:29:45,694 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, -2 predicate places. [2023-08-30 02:29:45,694 INFO L495 AbstractCegarLoop]: Abstraction has has 15 places, 12 transitions, 29 flow [2023-08-30 02:29:45,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 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 02:29:45,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:29:45,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 02:29:45,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:29:45,696 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-08-30 02:29:45,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:29:45,696 INFO L85 PathProgramCache]: Analyzing trace with hash 12206, now seen corresponding path program 1 times [2023-08-30 02:29:45,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:29:45,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780112939] [2023-08-30 02:29:45,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:29:45,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:29:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:29:45,814 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 02:29:45,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:29:45,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780112939] [2023-08-30 02:29:45,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780112939] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:29:45,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:29:45,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:29:45,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713135373] [2023-08-30 02:29:45,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:29:45,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:29:45,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:29:45,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:29:45,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:29:45,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 167 [2023-08-30 02:29:45,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 15 places, 12 transitions, 29 flow. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 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 02:29:45,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:29:45,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 167 [2023-08-30 02:29:45,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:29:45,860 INFO L130 PetriNetUnfolder]: 16/40 cut-off events. [2023-08-30 02:29:45,864 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:29:45,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 40 events. 16/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 94 event pairs, 12 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 82. Up to 39 conditions per place. [2023-08-30 02:29:45,865 INFO L137 encePairwiseOnDemand]: 165/167 looper letters, 9 selfloop transitions, 1 changer transitions 0/11 dead transitions. [2023-08-30 02:29:45,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 16 places, 11 transitions, 47 flow [2023-08-30 02:29:45,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:29:45,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:29:45,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2023-08-30 02:29:45,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4111776447105788 [2023-08-30 02:29:45,868 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 206 transitions. [2023-08-30 02:29:45,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 206 transitions. [2023-08-30 02:29:45,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:29:45,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 206 transitions. [2023-08-30 02:29:45,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 02:29:45,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 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 02:29:45,874 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 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 02:29:45,874 INFO L175 Difference]: Start difference. First operand has 15 places, 12 transitions, 29 flow. Second operand 3 states and 206 transitions. [2023-08-30 02:29:45,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 16 places, 11 transitions, 47 flow [2023-08-30 02:29:45,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 11 transitions, 47 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:29:45,875 INFO L231 Difference]: Finished difference. Result has 16 places, 11 transitions, 29 flow [2023-08-30 02:29:45,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=27, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=29, PETRI_PLACES=16, PETRI_TRANSITIONS=11} [2023-08-30 02:29:45,876 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, -1 predicate places. [2023-08-30 02:29:45,877 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 11 transitions, 29 flow [2023-08-30 02:29:45,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 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 02:29:45,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:29:45,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 02:29:45,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:29:45,878 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-08-30 02:29:45,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:29:45,885 INFO L85 PathProgramCache]: Analyzing trace with hash 12207, now seen corresponding path program 1 times [2023-08-30 02:29:45,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:29:45,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137931162] [2023-08-30 02:29:45,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:29:45,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:29:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:29:45,997 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 02:29:45,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:29:45,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137931162] [2023-08-30 02:29:45,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137931162] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:29:45,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:29:45,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:29:46,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581409807] [2023-08-30 02:29:46,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:29:46,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:29:46,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:29:46,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:29:46,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:29:46,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 167 [2023-08-30 02:29:46,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 11 transitions, 29 flow. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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 02:29:46,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:29:46,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 167 [2023-08-30 02:29:46,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:29:46,048 INFO L130 PetriNetUnfolder]: 11/29 cut-off events. [2023-08-30 02:29:46,048 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:29:46,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 29 events. 11/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 57 event pairs, 8 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 61. Up to 28 conditions per place. [2023-08-30 02:29:46,049 INFO L137 encePairwiseOnDemand]: 165/167 looper letters, 8 selfloop transitions, 1 changer transitions 0/10 dead transitions. [2023-08-30 02:29:46,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 10 transitions, 45 flow [2023-08-30 02:29:46,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:29:46,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:29:46,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 211 transitions. [2023-08-30 02:29:46,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42115768463073855 [2023-08-30 02:29:46,055 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 211 transitions. [2023-08-30 02:29:46,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 211 transitions. [2023-08-30 02:29:46,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:29:46,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 211 transitions. [2023-08-30 02:29:46,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 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 02:29:46,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 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 02:29:46,060 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 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 02:29:46,060 INFO L175 Difference]: Start difference. First operand has 16 places, 11 transitions, 29 flow. Second operand 3 states and 211 transitions. [2023-08-30 02:29:46,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 10 transitions, 45 flow [2023-08-30 02:29:46,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 10 transitions, 44 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:29:46,061 INFO L231 Difference]: Finished difference. Result has 16 places, 10 transitions, 28 flow [2023-08-30 02:29:46,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=26, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=10, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=28, PETRI_PLACES=16, PETRI_TRANSITIONS=10} [2023-08-30 02:29:46,063 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, -1 predicate places. [2023-08-30 02:29:46,066 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 10 transitions, 28 flow [2023-08-30 02:29:46,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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 02:29:46,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:29:46,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:29:46,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:29:46,068 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-08-30 02:29:46,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:29:46,069 INFO L85 PathProgramCache]: Analyzing trace with hash 363868994, now seen corresponding path program 1 times [2023-08-30 02:29:46,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:29:46,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943436911] [2023-08-30 02:29:46,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:29:46,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:29:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:29:46,263 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 02:29:46,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:29:46,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943436911] [2023-08-30 02:29:46,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943436911] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:29:46,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:29:46,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:29:46,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846427901] [2023-08-30 02:29:46,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:29:46,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:29:46,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:29:46,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:29:46,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:29:46,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 167 [2023-08-30 02:29:46,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 10 transitions, 28 flow. Second operand has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 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 02:29:46,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:29:46,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 167 [2023-08-30 02:29:46,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:29:46,373 INFO L130 PetriNetUnfolder]: 15/39 cut-off events. [2023-08-30 02:29:46,374 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:29:46,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 39 events. 15/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 88 event pairs, 8 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 82. Up to 28 conditions per place. [2023-08-30 02:29:46,374 INFO L137 encePairwiseOnDemand]: 162/167 looper letters, 10 selfloop transitions, 3 changer transitions 0/14 dead transitions. [2023-08-30 02:29:46,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 14 transitions, 62 flow [2023-08-30 02:29:46,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:29:46,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:29:46,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions. [2023-08-30 02:29:46,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3997005988023952 [2023-08-30 02:29:46,376 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 267 transitions. [2023-08-30 02:29:46,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 267 transitions. [2023-08-30 02:29:46,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:29:46,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 267 transitions. [2023-08-30 02:29:46,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 66.75) internal successors, (267), 4 states have internal predecessors, (267), 0 states have call successors, (0), 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 02:29:46,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 0 states have call successors, (0), 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 02:29:46,379 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 0 states have call successors, (0), 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 02:29:46,380 INFO L175 Difference]: Start difference. First operand has 16 places, 10 transitions, 28 flow. Second operand 4 states and 267 transitions. [2023-08-30 02:29:46,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 14 transitions, 62 flow [2023-08-30 02:29:46,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 14 transitions, 61 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:29:46,381 INFO L231 Difference]: Finished difference. Result has 19 places, 11 transitions, 43 flow [2023-08-30 02:29:46,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=27, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=10, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=43, PETRI_PLACES=19, PETRI_TRANSITIONS=11} [2023-08-30 02:29:46,381 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, 2 predicate places. [2023-08-30 02:29:46,382 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 11 transitions, 43 flow [2023-08-30 02:29:46,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 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 02:29:46,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:29:46,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:29:46,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:29:46,383 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-08-30 02:29:46,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:29:46,383 INFO L85 PathProgramCache]: Analyzing trace with hash 363868993, now seen corresponding path program 1 times [2023-08-30 02:29:46,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:29:46,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600878472] [2023-08-30 02:29:46,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:29:46,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:29:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:29:46,451 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 02:29:46,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:29:46,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600878472] [2023-08-30 02:29:46,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600878472] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:29:46,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:29:46,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:29:46,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640449275] [2023-08-30 02:29:46,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:29:46,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:29:46,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:29:46,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:29:46,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:29:46,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 167 [2023-08-30 02:29:46,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 11 transitions, 43 flow. Second operand has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 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 02:29:46,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:29:46,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 167 [2023-08-30 02:29:46,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:29:46,525 INFO L130 PetriNetUnfolder]: 11/29 cut-off events. [2023-08-30 02:29:46,526 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-30 02:29:46,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 29 events. 11/29 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 46 event pairs, 8 based on Foata normal form. 6/29 useless extension candidates. Maximal degree in co-relation 81. Up to 28 conditions per place. [2023-08-30 02:29:46,526 INFO L137 encePairwiseOnDemand]: 165/167 looper letters, 8 selfloop transitions, 1 changer transitions 0/10 dead transitions. [2023-08-30 02:29:46,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 10 transitions, 59 flow [2023-08-30 02:29:46,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:29:46,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:29:46,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2023-08-30 02:29:46,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38922155688622756 [2023-08-30 02:29:46,528 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 195 transitions. [2023-08-30 02:29:46,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 195 transitions. [2023-08-30 02:29:46,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:29:46,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 195 transitions. [2023-08-30 02:29:46,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 02:29:46,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 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 02:29:46,531 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 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 02:29:46,531 INFO L175 Difference]: Start difference. First operand has 19 places, 11 transitions, 43 flow. Second operand 3 states and 195 transitions. [2023-08-30 02:29:46,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 10 transitions, 59 flow [2023-08-30 02:29:46,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 10 transitions, 53 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:29:46,532 INFO L231 Difference]: Finished difference. Result has 18 places, 10 transitions, 37 flow [2023-08-30 02:29:46,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=35, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=10, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=37, PETRI_PLACES=18, PETRI_TRANSITIONS=10} [2023-08-30 02:29:46,532 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, 1 predicate places. [2023-08-30 02:29:46,533 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 10 transitions, 37 flow [2023-08-30 02:29:46,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 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 02:29:46,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:29:46,533 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-30 02:29:46,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:29:46,534 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-08-30 02:29:46,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:29:46,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1605026015, now seen corresponding path program 1 times [2023-08-30 02:29:46,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:29:46,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255850859] [2023-08-30 02:29:46,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:29:46,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:29:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:29:46,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:29:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:29:46,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:29:46,574 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:29:46,575 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2023-08-30 02:29:46,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2023-08-30 02:29:46,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-30 02:29:46,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (6 of 10 remaining) [2023-08-30 02:29:46,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-30 02:29:46,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-30 02:29:46,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-30 02:29:46,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 10 remaining) [2023-08-30 02:29:46,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2023-08-30 02:29:46,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-30 02:29:46,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:29:46,579 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-30 02:29:46,581 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-30 02:29:46,581 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-30 02:29:46,616 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:29:46,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 121 transitions, 254 flow [2023-08-30 02:29:46,652 INFO L130 PetriNetUnfolder]: 13/153 cut-off events. [2023-08-30 02:29:46,652 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 02:29:46,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 153 events. 13/153 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 333 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 97. Up to 6 conditions per place. [2023-08-30 02:29:46,654 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 121 transitions, 254 flow [2023-08-30 02:29:46,655 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 121 transitions, 254 flow [2023-08-30 02:29:46,655 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:29:46,655 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 121 transitions, 254 flow [2023-08-30 02:29:46,656 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 121 transitions, 254 flow [2023-08-30 02:29:46,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 121 transitions, 254 flow [2023-08-30 02:29:46,670 INFO L130 PetriNetUnfolder]: 13/153 cut-off events. [2023-08-30 02:29:46,671 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 02:29:46,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 153 events. 13/153 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 333 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 97. Up to 6 conditions per place. [2023-08-30 02:29:46,676 INFO L119 LiptonReduction]: Number of co-enabled transitions 6160 [2023-08-30 02:29:48,739 INFO L134 LiptonReduction]: Checked pairs total: 11202 [2023-08-30 02:29:48,739 INFO L136 LiptonReduction]: Total number of compositions: 114 [2023-08-30 02:29:48,741 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:29:48,742 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;@4a5fc5d8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:29:48,742 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-30 02:29:48,743 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 02:29:48,743 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:29:48,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:29:48,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 02:29:48,744 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-08-30 02:29:48,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:29:48,744 INFO L85 PathProgramCache]: Analyzing trace with hash 21060, now seen corresponding path program 1 times [2023-08-30 02:29:48,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:29:48,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730873518] [2023-08-30 02:29:48,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:29:48,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:29:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:29:48,776 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 02:29:48,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:29:48,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730873518] [2023-08-30 02:29:48,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730873518] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:29:48,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:29:48,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:29:48,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642111520] [2023-08-30 02:29:48,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:29:48,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:29:48,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:29:48,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:29:48,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:29:48,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 235 [2023-08-30 02:29:48,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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 02:29:48,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:29:48,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 235 [2023-08-30 02:29:48,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:29:48,913 INFO L130 PetriNetUnfolder]: 463/822 cut-off events. [2023-08-30 02:29:48,914 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2023-08-30 02:29:48,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1577 conditions, 822 events. 463/822 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4598 event pairs, 376 based on Foata normal form. 0/458 useless extension candidates. Maximal degree in co-relation 317. Up to 706 conditions per place. [2023-08-30 02:29:48,920 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 22 selfloop transitions, 1 changer transitions 0/32 dead transitions. [2023-08-30 02:29:48,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 122 flow [2023-08-30 02:29:48,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:29:48,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:29:48,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-08-30 02:29:48,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4581560283687943 [2023-08-30 02:29:48,922 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-08-30 02:29:48,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-08-30 02:29:48,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:29:48,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-08-30 02:29:48,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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 02:29:48,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 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 02:29:48,926 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 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 02:29:48,926 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 82 flow. Second operand 3 states and 323 transitions. [2023-08-30 02:29:48,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 122 flow [2023-08-30 02:29:48,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 120 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-30 02:29:48,928 INFO L231 Difference]: Finished difference. Result has 35 places, 32 transitions, 76 flow [2023-08-30 02:29:48,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=35, PETRI_TRANSITIONS=32} [2023-08-30 02:29:48,929 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2023-08-30 02:29:48,932 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 76 flow [2023-08-30 02:29:48,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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 02:29:48,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:29:48,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 02:29:48,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:29:48,933 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-08-30 02:29:48,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:29:48,933 INFO L85 PathProgramCache]: Analyzing trace with hash 21062, now seen corresponding path program 1 times [2023-08-30 02:29:48,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:29:48,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149310168] [2023-08-30 02:29:48,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:29:48,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:29:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:29:48,964 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 02:29:48,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:29:48,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149310168] [2023-08-30 02:29:48,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149310168] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:29:48,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:29:48,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:29:48,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300603286] [2023-08-30 02:29:48,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:29:48,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:29:48,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:29:48,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:29:48,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:29:48,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 235 [2023-08-30 02:29:48,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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 02:29:48,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:29:48,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 235 [2023-08-30 02:29:48,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:29:49,053 INFO L130 PetriNetUnfolder]: 282/530 cut-off events. [2023-08-30 02:29:49,053 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2023-08-30 02:29:49,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1017 conditions, 530 events. 282/530 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2672 event pairs, 224 based on Foata normal form. 0/343 useless extension candidates. Maximal degree in co-relation 1009. Up to 444 conditions per place. [2023-08-30 02:29:49,056 INFO L137 encePairwiseOnDemand]: 233/235 looper letters, 21 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2023-08-30 02:29:49,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 118 flow [2023-08-30 02:29:49,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:29:49,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:29:49,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions. [2023-08-30 02:29:49,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4624113475177305 [2023-08-30 02:29:49,058 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 326 transitions. [2023-08-30 02:29:49,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 326 transitions. [2023-08-30 02:29:49,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:29:49,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 326 transitions. [2023-08-30 02:29:49,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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 02:29:49,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 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 02:29:49,061 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 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 02:29:49,061 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 76 flow. Second operand 3 states and 326 transitions. [2023-08-30 02:29:49,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 118 flow [2023-08-30 02:29:49,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 117 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:29:49,062 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 75 flow [2023-08-30 02:29:49,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2023-08-30 02:29:49,063 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2023-08-30 02:29:49,064 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 75 flow [2023-08-30 02:29:49,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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 02:29:49,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:29:49,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:29:49,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:29:49,064 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-08-30 02:29:49,065 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:29:49,065 INFO L85 PathProgramCache]: Analyzing trace with hash 627945252, now seen corresponding path program 1 times [2023-08-30 02:29:49,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:29:49,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568080057] [2023-08-30 02:29:49,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:29:49,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:29:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:29:49,135 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 02:29:49,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:29:49,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568080057] [2023-08-30 02:29:49,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568080057] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:29:49,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:29:49,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:29:49,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030726518] [2023-08-30 02:29:49,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:29:49,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:29:49,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:29:49,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:29:49,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:29:49,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 235 [2023-08-30 02:29:49,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 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 02:29:49,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:29:49,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 235 [2023-08-30 02:29:49,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:29:49,241 INFO L130 PetriNetUnfolder]: 227/432 cut-off events. [2023-08-30 02:29:49,242 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2023-08-30 02:29:49,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 827 conditions, 432 events. 227/432 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2053 event pairs, 175 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 818. Up to 355 conditions per place. [2023-08-30 02:29:49,244 INFO L137 encePairwiseOnDemand]: 232/235 looper letters, 19 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2023-08-30 02:29:49,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 111 flow [2023-08-30 02:29:49,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:29:49,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:29:49,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2023-08-30 02:29:49,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43120567375886526 [2023-08-30 02:29:49,247 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2023-08-30 02:29:49,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2023-08-30 02:29:49,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:29:49,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2023-08-30 02:29:49,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 02:29:49,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 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 02:29:49,258 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 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 02:29:49,258 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 75 flow. Second operand 3 states and 304 transitions. [2023-08-30 02:29:49,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 111 flow [2023-08-30 02:29:49,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 110 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:29:49,260 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 72 flow [2023-08-30 02:29:49,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=34, PETRI_TRANSITIONS=29} [2023-08-30 02:29:49,262 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2023-08-30 02:29:49,263 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 72 flow [2023-08-30 02:29:49,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 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 02:29:49,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:29:49,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:29:49,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:29:49,263 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-08-30 02:29:49,264 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:29:49,265 INFO L85 PathProgramCache]: Analyzing trace with hash 627945253, now seen corresponding path program 1 times [2023-08-30 02:29:49,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:29:49,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746289091] [2023-08-30 02:29:49,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:29:49,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:29:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:29:49,409 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 02:29:49,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:29:49,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746289091] [2023-08-30 02:29:49,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746289091] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:29:49,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:29:49,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:29:49,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516646714] [2023-08-30 02:29:49,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:29:49,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:29:49,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:29:49,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:29:49,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:29:49,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 235 [2023-08-30 02:29:49,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 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 02:29:49,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:29:49,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 235 [2023-08-30 02:29:49,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:29:49,558 INFO L130 PetriNetUnfolder]: 373/685 cut-off events. [2023-08-30 02:29:49,559 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2023-08-30 02:29:49,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1311 conditions, 685 events. 373/685 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3536 event pairs, 175 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 1301. Up to 355 conditions per place. [2023-08-30 02:29:49,562 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 32 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2023-08-30 02:29:49,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 177 flow [2023-08-30 02:29:49,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:29:49,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:29:49,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2023-08-30 02:29:49,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4521276595744681 [2023-08-30 02:29:49,564 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 425 transitions. [2023-08-30 02:29:49,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 425 transitions. [2023-08-30 02:29:49,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:29:49,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 425 transitions. [2023-08-30 02:29:49,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 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 02:29:49,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 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 02:29:49,567 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 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 02:29:49,568 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 72 flow. Second operand 4 states and 425 transitions. [2023-08-30 02:29:49,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 177 flow [2023-08-30 02:29:49,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:29:49,569 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 87 flow [2023-08-30 02:29:49,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2023-08-30 02:29:49,570 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2023-08-30 02:29:49,570 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 87 flow [2023-08-30 02:29:49,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 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 02:29:49,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:29:49,570 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:29:49,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 02:29:49,571 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-08-30 02:29:49,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:29:49,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1468746515, now seen corresponding path program 1 times [2023-08-30 02:29:49,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:29:49,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565519800] [2023-08-30 02:29:49,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:29:49,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:29:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:29:49,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 02:29:49,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:29:49,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565519800] [2023-08-30 02:29:49,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565519800] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:29:49,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:29:49,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:29:49,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790075560] [2023-08-30 02:29:49,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:29:49,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:29:49,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:29:49,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:29:49,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:29:49,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 235 [2023-08-30 02:29:49,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 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 02:29:49,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:29:49,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 235 [2023-08-30 02:29:49,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:29:49,859 INFO L130 PetriNetUnfolder]: 451/824 cut-off events. [2023-08-30 02:29:49,860 INFO L131 PetriNetUnfolder]: For 153/153 co-relation queries the response was YES. [2023-08-30 02:29:49,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1717 conditions, 824 events. 451/824 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4413 event pairs, 147 based on Foata normal form. 0/659 useless extension candidates. Maximal degree in co-relation 1705. Up to 416 conditions per place. [2023-08-30 02:29:49,864 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 29 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2023-08-30 02:29:49,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 189 flow [2023-08-30 02:29:49,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:29:49,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:29:49,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 420 transitions. [2023-08-30 02:29:49,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44680851063829785 [2023-08-30 02:29:49,866 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 420 transitions. [2023-08-30 02:29:49,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 420 transitions. [2023-08-30 02:29:49,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:29:49,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 420 transitions. [2023-08-30 02:29:49,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 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 02:29:49,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 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 02:29:49,870 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 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 02:29:49,870 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 87 flow. Second operand 4 states and 420 transitions. [2023-08-30 02:29:49,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 189 flow [2023-08-30 02:29:49,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 42 transitions, 183 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:29:49,871 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 104 flow [2023-08-30 02:29:49,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2023-08-30 02:29:49,873 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2023-08-30 02:29:49,873 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 104 flow [2023-08-30 02:29:49,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 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 02:29:49,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:29:49,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:29:49,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 02:29:49,874 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-08-30 02:29:49,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:29:49,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1287948514, now seen corresponding path program 1 times [2023-08-30 02:29:49,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:29:49,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602114910] [2023-08-30 02:29:49,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:29:49,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:29:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:29:49,898 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 02:29:49,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:29:49,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602114910] [2023-08-30 02:29:49,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602114910] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:29:49,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:29:49,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:29:49,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463554772] [2023-08-30 02:29:49,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:29:49,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:29:49,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:29:49,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:29:49,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:29:49,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 235 [2023-08-30 02:29:49,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 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 02:29:49,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:29:49,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 235 [2023-08-30 02:29:49,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:29:50,047 INFO L130 PetriNetUnfolder]: 794/1336 cut-off events. [2023-08-30 02:29:50,047 INFO L131 PetriNetUnfolder]: For 364/364 co-relation queries the response was YES. [2023-08-30 02:29:50,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3169 conditions, 1336 events. 794/1336 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7223 event pairs, 319 based on Foata normal form. 44/1260 useless extension candidates. Maximal degree in co-relation 3155. Up to 774 conditions per place. [2023-08-30 02:29:50,055 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 38 selfloop transitions, 6 changer transitions 0/49 dead transitions. [2023-08-30 02:29:50,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 257 flow [2023-08-30 02:29:50,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:29:50,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:29:50,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions. [2023-08-30 02:29:50,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4624113475177305 [2023-08-30 02:29:50,057 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 326 transitions. [2023-08-30 02:29:50,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 326 transitions. [2023-08-30 02:29:50,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:29:50,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 326 transitions. [2023-08-30 02:29:50,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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 02:29:50,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 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 02:29:50,060 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 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 02:29:50,060 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 104 flow. Second operand 3 states and 326 transitions. [2023-08-30 02:29:50,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 257 flow [2023-08-30 02:29:50,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:29:50,064 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 146 flow [2023-08-30 02:29:50,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-08-30 02:29:50,065 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2023-08-30 02:29:50,065 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 146 flow [2023-08-30 02:29:50,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 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 02:29:50,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:29:50,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:29:50,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 02:29:50,066 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-08-30 02:29:50,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:29:50,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1271701137, now seen corresponding path program 1 times [2023-08-30 02:29:50,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:29:50,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695269251] [2023-08-30 02:29:50,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:29:50,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:29:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:29:50,267 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 02:29:50,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:29:50,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695269251] [2023-08-30 02:29:50,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695269251] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:29:50,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273585930] [2023-08-30 02:29:50,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:29:50,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:29:50,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:29:50,275 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:29:50,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-30 02:29:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:29:50,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-30 02:29:50,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:29:50,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:29:50,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-30 02:29:50,670 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 02:29:50,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:29:50,796 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 02:29:50,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273585930] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:29:50,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:29:50,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2023-08-30 02:29:50,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104708548] [2023-08-30 02:29:50,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:29:50,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 02:29:50,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:29:50,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 02:29:50,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2023-08-30 02:29:51,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 235 [2023-08-30 02:29:51,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 146 flow. Second operand has 14 states, 14 states have (on average 95.92857142857143) internal successors, (1343), 14 states have internal predecessors, (1343), 0 states have call successors, (0), 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 02:29:51,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:29:51,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 235 [2023-08-30 02:29:51,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:29:51,610 INFO L130 PetriNetUnfolder]: 975/1737 cut-off events. [2023-08-30 02:29:51,610 INFO L131 PetriNetUnfolder]: For 1043/1061 co-relation queries the response was YES. [2023-08-30 02:29:51,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4493 conditions, 1737 events. 975/1737 cut-off events. For 1043/1061 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10064 event pairs, 248 based on Foata normal form. 0/1657 useless extension candidates. Maximal degree in co-relation 4478. Up to 479 conditions per place. [2023-08-30 02:29:51,621 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 60 selfloop transitions, 10 changer transitions 0/80 dead transitions. [2023-08-30 02:29:51,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 80 transitions, 454 flow [2023-08-30 02:29:51,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:29:51,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:29:51,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 626 transitions. [2023-08-30 02:29:51,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44397163120567373 [2023-08-30 02:29:51,624 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 626 transitions. [2023-08-30 02:29:51,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 626 transitions. [2023-08-30 02:29:51,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:29:51,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 626 transitions. [2023-08-30 02:29:51,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 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 02:29:51,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 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 02:29:51,628 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 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 02:29:51,628 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 146 flow. Second operand 6 states and 626 transitions. [2023-08-30 02:29:51,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 80 transitions, 454 flow [2023-08-30 02:29:51,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 80 transitions, 438 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:29:51,632 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 192 flow [2023-08-30 02:29:51,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2023-08-30 02:29:51,632 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2023-08-30 02:29:51,633 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 192 flow [2023-08-30 02:29:51,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 95.92857142857143) internal successors, (1343), 14 states have internal predecessors, (1343), 0 states have call successors, (0), 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 02:29:51,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:29:51,634 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-30 02:29:51,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-30 02:29:51,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-30 02:29:51,839 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-08-30 02:29:51,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:29:51,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1571595378, now seen corresponding path program 1 times [2023-08-30 02:29:51,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:29:51,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695987761] [2023-08-30 02:29:51,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:29:51,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:29:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:29:51,855 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:29:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:29:51,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:29:51,865 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:29:51,865 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2023-08-30 02:29:51,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2023-08-30 02:29:51,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-30 02:29:51,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (9 of 13 remaining) [2023-08-30 02:29:51,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-30 02:29:51,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-30 02:29:51,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (6 of 13 remaining) [2023-08-30 02:29:51,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-30 02:29:51,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2023-08-30 02:29:51,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (3 of 13 remaining) [2023-08-30 02:29:51,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 13 remaining) [2023-08-30 02:29:51,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2023-08-30 02:29:51,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-30 02:29:51,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 02:29:51,867 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:29:51,868 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-30 02:29:51,868 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-08-30 02:29:51,893 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:29:51,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 162 transitions, 345 flow [2023-08-30 02:29:51,915 INFO L130 PetriNetUnfolder]: 19/211 cut-off events. [2023-08-30 02:29:51,916 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-30 02:29:51,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 211 events. 19/211 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 583 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 157. Up to 8 conditions per place. [2023-08-30 02:29:51,917 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 162 transitions, 345 flow [2023-08-30 02:29:51,918 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 162 transitions, 345 flow [2023-08-30 02:29:51,918 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:29:51,918 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 162 transitions, 345 flow [2023-08-30 02:29:51,919 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 162 transitions, 345 flow [2023-08-30 02:29:51,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 162 transitions, 345 flow [2023-08-30 02:29:51,946 INFO L130 PetriNetUnfolder]: 19/211 cut-off events. [2023-08-30 02:29:51,946 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-30 02:29:51,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 211 events. 19/211 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 583 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 157. Up to 8 conditions per place. [2023-08-30 02:29:51,953 INFO L119 LiptonReduction]: Number of co-enabled transitions 14160 [2023-08-30 02:29:54,609 INFO L134 LiptonReduction]: Checked pairs total: 24046 [2023-08-30 02:29:54,610 INFO L136 LiptonReduction]: Total number of compositions: 155 [2023-08-30 02:29:54,613 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:29:54,613 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;@4a5fc5d8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:29:54,613 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:29:54,614 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 02:29:54,614 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:29:54,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:29:54,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 02:29:54,615 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-08-30 02:29:54,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:29:54,615 INFO L85 PathProgramCache]: Analyzing trace with hash 32409, now seen corresponding path program 1 times [2023-08-30 02:29:54,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:29:54,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421522069] [2023-08-30 02:29:54,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:29:54,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:29:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:29:54,632 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 02:29:54,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:29:54,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421522069] [2023-08-30 02:29:54,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421522069] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:29:54,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:29:54,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:29:54,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114108383] [2023-08-30 02:29:54,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:29:54,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:29:54,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:29:54,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:29:54,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:29:54,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 317 [2023-08-30 02:29:54,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 48 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 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 02:29:54,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:29:54,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 317 [2023-08-30 02:29:54,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:29:55,430 INFO L130 PetriNetUnfolder]: 6619/9859 cut-off events. [2023-08-30 02:29:55,431 INFO L131 PetriNetUnfolder]: For 703/703 co-relation queries the response was YES. [2023-08-30 02:29:55,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19239 conditions, 9859 events. 6619/9859 cut-off events. For 703/703 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 63767 event pairs, 5560 based on Foata normal form. 0/5517 useless extension candidates. Maximal degree in co-relation 1591. Up to 8806 conditions per place. [2023-08-30 02:29:55,493 INFO L137 encePairwiseOnDemand]: 313/317 looper letters, 32 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2023-08-30 02:29:55,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 45 transitions, 177 flow [2023-08-30 02:29:55,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:29:55,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:29:55,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-08-30 02:29:55,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45741324921135645 [2023-08-30 02:29:55,495 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-08-30 02:29:55,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-08-30 02:29:55,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:29:55,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-08-30 02:29:55,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 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 02:29:55,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 0 states have call successors, (0), 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 02:29:55,498 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 0 states have call successors, (0), 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 02:29:55,498 INFO L175 Difference]: Start difference. First operand has 49 places, 48 transitions, 117 flow. Second operand 3 states and 435 transitions. [2023-08-30 02:29:55,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 45 transitions, 177 flow [2023-08-30 02:29:55,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 45 transitions, 171 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-30 02:29:55,501 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 107 flow [2023-08-30 02:29:55,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2023-08-30 02:29:55,501 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2023-08-30 02:29:55,501 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 107 flow [2023-08-30 02:29:55,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 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 02:29:55,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:29:55,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 02:29:55,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 02:29:55,502 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-08-30 02:29:55,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:29:55,503 INFO L85 PathProgramCache]: Analyzing trace with hash 32411, now seen corresponding path program 1 times [2023-08-30 02:29:55,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:29:55,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458447431] [2023-08-30 02:29:55,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:29:55,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:29:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:29:55,524 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 02:29:55,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:29:55,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458447431] [2023-08-30 02:29:55,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458447431] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:29:55,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:29:55,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:29:55,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096840396] [2023-08-30 02:29:55,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:29:55,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:29:55,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:29:55,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:29:55,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:29:55,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 317 [2023-08-30 02:29:55,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 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 02:29:55,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:29:55,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 317 [2023-08-30 02:29:55,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:29:56,057 INFO L130 PetriNetUnfolder]: 4170/6408 cut-off events. [2023-08-30 02:29:56,058 INFO L131 PetriNetUnfolder]: For 252/252 co-relation queries the response was YES. [2023-08-30 02:29:56,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12387 conditions, 6408 events. 4170/6408 cut-off events. For 252/252 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 39640 event pairs, 3464 based on Foata normal form. 0/4025 useless extension candidates. Maximal degree in co-relation 12378. Up to 5628 conditions per place. [2023-08-30 02:29:56,096 INFO L137 encePairwiseOnDemand]: 315/317 looper letters, 31 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2023-08-30 02:29:56,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 169 flow [2023-08-30 02:29:56,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:29:56,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:29:56,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2023-08-30 02:29:56,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4605678233438486 [2023-08-30 02:29:56,098 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2023-08-30 02:29:56,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2023-08-30 02:29:56,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:29:56,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2023-08-30 02:29:56,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 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 02:29:56,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 0 states have call successors, (0), 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 02:29:56,102 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 0 states have call successors, (0), 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 02:29:56,102 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 107 flow. Second operand 3 states and 438 transitions. [2023-08-30 02:29:56,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 169 flow [2023-08-30 02:29:56,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:29:56,104 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 106 flow [2023-08-30 02:29:56,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=46, 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=106, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2023-08-30 02:29:56,104 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2023-08-30 02:29:56,104 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 106 flow [2023-08-30 02:29:56,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 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 02:29:56,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:29:56,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:29:56,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 02:29:56,105 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-08-30 02:29:56,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:29:56,106 INFO L85 PathProgramCache]: Analyzing trace with hash 966358383, now seen corresponding path program 1 times [2023-08-30 02:29:56,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:29:56,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392241941] [2023-08-30 02:29:56,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:29:56,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:29:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:29:56,149 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 02:29:56,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:29:56,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392241941] [2023-08-30 02:29:56,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392241941] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:29:56,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:29:56,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:29:56,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503344737] [2023-08-30 02:29:56,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:29:56,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:29:56,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:29:56,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:29:56,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:29:56,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 317 [2023-08-30 02:29:56,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 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 02:29:56,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:29:56,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 317 [2023-08-30 02:29:56,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:29:56,623 INFO L130 PetriNetUnfolder]: 2979/4625 cut-off events. [2023-08-30 02:29:56,623 INFO L131 PetriNetUnfolder]: For 200/200 co-relation queries the response was YES. [2023-08-30 02:29:56,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8910 conditions, 4625 events. 2979/4625 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 27284 event pairs, 2415 based on Foata normal form. 0/3140 useless extension candidates. Maximal degree in co-relation 8900. Up to 4003 conditions per place. [2023-08-30 02:29:56,645 INFO L137 encePairwiseOnDemand]: 313/317 looper letters, 28 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-08-30 02:29:56,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 158 flow [2023-08-30 02:29:56,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:29:56,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:29:56,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-08-30 02:29:56,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43112513144058884 [2023-08-30 02:29:56,648 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-08-30 02:29:56,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-08-30 02:29:56,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:29:56,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-08-30 02:29:56,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 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 02:29:56,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 0 states have call successors, (0), 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 02:29:56,651 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 0 states have call successors, (0), 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 02:29:56,651 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 106 flow. Second operand 3 states and 410 transitions. [2023-08-30 02:29:56,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 158 flow [2023-08-30 02:29:56,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 157 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:29:56,652 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 101 flow [2023-08-30 02:29:56,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=44, 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=101, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2023-08-30 02:29:56,653 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2023-08-30 02:29:56,653 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 101 flow [2023-08-30 02:29:56,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 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 02:29:56,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:29:56,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:29:56,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 02:29:56,654 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-08-30 02:29:56,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:29:56,654 INFO L85 PathProgramCache]: Analyzing trace with hash 966358381, now seen corresponding path program 1 times [2023-08-30 02:29:56,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:29:56,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930869112] [2023-08-30 02:29:56,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:29:56,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:29:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:29:56,728 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 02:29:56,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:29:56,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930869112] [2023-08-30 02:29:56,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930869112] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:29:56,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:29:56,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:29:56,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944221782] [2023-08-30 02:29:56,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:29:56,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:29:56,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:29:56,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:29:56,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:29:56,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 317 [2023-08-30 02:29:56,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 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 02:29:56,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:29:56,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 317 [2023-08-30 02:29:56,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:29:57,326 INFO L130 PetriNetUnfolder]: 3755/5735 cut-off events. [2023-08-30 02:29:57,326 INFO L131 PetriNetUnfolder]: For 264/264 co-relation queries the response was YES. [2023-08-30 02:29:57,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11047 conditions, 5735 events. 3755/5735 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 35954 event pairs, 1135 based on Foata normal form. 0/3848 useless extension candidates. Maximal degree in co-relation 11036. Up to 3146 conditions per place. [2023-08-30 02:29:57,418 INFO L137 encePairwiseOnDemand]: 312/317 looper letters, 46 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2023-08-30 02:29:57,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 253 flow [2023-08-30 02:29:57,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:29:57,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:29:57,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 575 transitions. [2023-08-30 02:29:57,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45347003154574134 [2023-08-30 02:29:57,421 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 575 transitions. [2023-08-30 02:29:57,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 575 transitions. [2023-08-30 02:29:57,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:29:57,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 575 transitions. [2023-08-30 02:29:57,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 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 02:29:57,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 317.0) internal successors, (1585), 5 states have internal predecessors, (1585), 0 states have call successors, (0), 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 02:29:57,424 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 317.0) internal successors, (1585), 5 states have internal predecessors, (1585), 0 states have call successors, (0), 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 02:29:57,424 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 101 flow. Second operand 4 states and 575 transitions. [2023-08-30 02:29:57,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 253 flow [2023-08-30 02:29:57,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 62 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:29:57,426 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 121 flow [2023-08-30 02:29:57,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-30 02:29:57,426 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2023-08-30 02:29:57,427 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 121 flow [2023-08-30 02:29:57,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 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 02:29:57,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:29:57,427 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:29:57,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 02:29:57,427 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-08-30 02:29:57,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:29:57,427 INFO L85 PathProgramCache]: Analyzing trace with hash 216802375, now seen corresponding path program 1 times [2023-08-30 02:29:57,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:29:57,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290667176] [2023-08-30 02:29:57,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:29:57,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:29:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:29:57,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 02:29:57,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:29:57,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290667176] [2023-08-30 02:29:57,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290667176] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:29:57,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:29:57,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:29:57,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885282934] [2023-08-30 02:29:57,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:29:57,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:29:57,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:29:57,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:29:57,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:29:57,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 317 [2023-08-30 02:29:57,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 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 02:29:57,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:29:57,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 317 [2023-08-30 02:29:57,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:29:58,218 INFO L130 PetriNetUnfolder]: 6123/9323 cut-off events. [2023-08-30 02:29:58,218 INFO L131 PetriNetUnfolder]: For 2970/2970 co-relation queries the response was YES. [2023-08-30 02:29:58,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19768 conditions, 9323 events. 6123/9323 cut-off events. For 2970/2970 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 59805 event pairs, 3055 based on Foata normal form. 0/7325 useless extension candidates. Maximal degree in co-relation 19754. Up to 5003 conditions per place. [2023-08-30 02:29:58,274 INFO L137 encePairwiseOnDemand]: 312/317 looper letters, 51 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2023-08-30 02:29:58,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 66 transitions, 298 flow [2023-08-30 02:29:58,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:29:58,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:29:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 578 transitions. [2023-08-30 02:29:58,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4558359621451104 [2023-08-30 02:29:58,276 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 578 transitions. [2023-08-30 02:29:58,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 578 transitions. [2023-08-30 02:29:58,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:29:58,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 578 transitions. [2023-08-30 02:29:58,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 0 states have call successors, (0), 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 02:29:58,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 317.0) internal successors, (1585), 5 states have internal predecessors, (1585), 0 states have call successors, (0), 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 02:29:58,280 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 317.0) internal successors, (1585), 5 states have internal predecessors, (1585), 0 states have call successors, (0), 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 02:29:58,280 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 121 flow. Second operand 4 states and 578 transitions. [2023-08-30 02:29:58,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 66 transitions, 298 flow [2023-08-30 02:29:58,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 291 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:29:58,282 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 133 flow [2023-08-30 02:29:58,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-08-30 02:29:58,283 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2023-08-30 02:29:58,283 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 133 flow [2023-08-30 02:29:58,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 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 02:29:58,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:29:58,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:29:58,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 02:29:58,284 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-08-30 02:29:58,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:29:58,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1033288941, now seen corresponding path program 1 times [2023-08-30 02:29:58,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:29:58,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353383531] [2023-08-30 02:29:58,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:29:58,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:29:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:29:58,303 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 02:29:58,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:29:58,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353383531] [2023-08-30 02:29:58,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353383531] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:29:58,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:29:58,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:29:58,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397995542] [2023-08-30 02:29:58,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:29:58,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:29:58,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:29:58,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:29:58,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:29:58,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 317 [2023-08-30 02:29:58,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 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 02:29:58,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:29:58,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 317 [2023-08-30 02:29:58,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:29:59,633 INFO L130 PetriNetUnfolder]: 13461/19292 cut-off events. [2023-08-30 02:29:59,633 INFO L131 PetriNetUnfolder]: For 4786/4786 co-relation queries the response was YES. [2023-08-30 02:29:59,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43134 conditions, 19292 events. 13461/19292 cut-off events. For 4786/4786 co-relation queries the response was YES. Maximal size of possible extension queue 964. Compared 125793 event pairs, 5929 based on Foata normal form. 282/16782 useless extension candidates. Maximal degree in co-relation 43118. Up to 11778 conditions per place. [2023-08-30 02:29:59,862 INFO L137 encePairwiseOnDemand]: 310/317 looper letters, 58 selfloop transitions, 6 changer transitions 0/71 dead transitions. [2023-08-30 02:29:59,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 347 flow [2023-08-30 02:29:59,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:29:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:29:59,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-08-30 02:29:59,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46898002103049424 [2023-08-30 02:29:59,870 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-08-30 02:29:59,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-08-30 02:29:59,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:29:59,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-08-30 02:29:59,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 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 02:29:59,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 0 states have call successors, (0), 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 02:29:59,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 0 states have call successors, (0), 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 02:29:59,873 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 133 flow. Second operand 3 states and 446 transitions. [2023-08-30 02:29:59,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 347 flow [2023-08-30 02:29:59,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 341 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:29:59,917 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 174 flow [2023-08-30 02:29:59,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2023-08-30 02:29:59,917 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2023-08-30 02:29:59,917 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 174 flow [2023-08-30 02:29:59,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 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 02:29:59,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:29:59,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:29:59,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-30 02:29:59,918 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-08-30 02:29:59,919 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:29:59,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1967189292, now seen corresponding path program 1 times [2023-08-30 02:29:59,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:29:59,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685645810] [2023-08-30 02:29:59,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:29:59,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:29:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:30:00,102 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 02:30:00,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:30:00,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685645810] [2023-08-30 02:30:00,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685645810] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:30:00,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514153730] [2023-08-30 02:30:00,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:30:00,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:30:00,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:30:00,105 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:30:00,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-30 02:30:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:30:00,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-30 02:30:00,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:30:00,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:30:00,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-30 02:30:00,371 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 02:30:00,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:30:00,495 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 02:30:00,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514153730] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:30:00,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:30:00,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2023-08-30 02:30:00,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053709942] [2023-08-30 02:30:00,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:30:00,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 02:30:00,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:30:00,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 02:30:00,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2023-08-30 02:30:00,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 317 [2023-08-30 02:30:00,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 174 flow. Second operand has 14 states, 14 states have (on average 131.92857142857142) internal successors, (1847), 14 states have internal predecessors, (1847), 0 states have call successors, (0), 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 02:30:00,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:30:00,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 317 [2023-08-30 02:30:00,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:30:02,625 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 265#(and (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 17#L713true, 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:02,626 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-30 02:30:02,626 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:30:02,626 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:30:02,626 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:30:02,875 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 97#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 265#(and (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:02,876 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-30 02:30:02,876 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:30:02,876 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:30:02,876 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:30:02,876 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 265#(and (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 115#L713true, 25#L705-6true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:02,876 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-30 02:30:02,876 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:30:02,877 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:30:02,877 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:30:02,989 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 4#L706-1true, 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:02,989 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:30:02,989 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:30:02,989 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:30:02,989 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:30:02,989 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L713true, 124#thr1EXITtrue, Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:02,989 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:30:02,989 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:30:02,990 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:30:02,990 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:30:02,990 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 132#L706-1true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 265#(and (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:02,990 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:30:02,990 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:30:02,990 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:30:02,990 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:30:02,991 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 265#(and (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, 12#thr1EXITtrue, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:02,991 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:30:02,991 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:30:02,991 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:30:02,991 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:30:02,992 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 265#(and (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, 67#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:02,992 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:30:02,992 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:30:02,992 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:30:02,993 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:30:03,056 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 265#(and (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 17#L713true, 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,056 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,056 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:30:03,056 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 02:30:03,056 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:30:03,093 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 97#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 4#L706-1true, 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,093 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,093 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 02:30:03,093 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:30:03,093 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:30:03,094 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 25#L705-6true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 4#L706-1true, 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,094 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,094 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 02:30:03,094 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:30:03,094 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:30:03,095 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 97#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 124#thr1EXITtrue, Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,095 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,095 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 02:30:03,095 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:30:03,095 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:30:03,095 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 25#L705-6true, 124#thr1EXITtrue, Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,095 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,095 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 02:30:03,096 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:30:03,096 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:30:03,096 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 44#L707-1true, 29#L725-5true, 88#L713true, 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 265#(and (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,096 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,096 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 02:30:03,096 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:30:03,096 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:30:03,171 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 97#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 265#(and (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,171 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:30:03,171 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 02:30:03,171 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 02:30:03,172 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 02:30:03,172 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 265#(and (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 25#L705-6true, 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,172 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:30:03,172 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 02:30:03,172 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:30:03,173 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 02:30:03,210 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 132#L706-1true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 4#L706-1true, 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,210 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:30:03,210 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:30:03,210 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 02:30:03,211 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 02:30:03,211 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 4#L706-1true, 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, 12#thr1EXITtrue, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,211 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:30:03,211 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 02:30:03,211 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 02:30:03,212 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:30:03,212 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 4#L706-1true, 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 67#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,212 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:30:03,212 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:30:03,212 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 02:30:03,213 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 02:30:03,213 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 132#L706-1true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 124#thr1EXITtrue, Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,213 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:30:03,213 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:30:03,213 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 02:30:03,214 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 02:30:03,214 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 124#thr1EXITtrue, Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, 12#thr1EXITtrue, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,214 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:30:03,214 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 02:30:03,214 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:30:03,215 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 02:30:03,215 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 124#thr1EXITtrue, Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, 67#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,215 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:30:03,215 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:30:03,215 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 02:30:03,215 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 02:30:03,291 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 4#L706-1true, 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,291 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:30:03,292 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 02:30:03,292 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 02:30:03,292 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 02:30:03,292 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L713true, 124#thr1EXITtrue, Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,292 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:30:03,292 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 02:30:03,292 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 02:30:03,292 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 02:30:03,293 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 132#L706-1true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 265#(and (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,293 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:30:03,293 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:30:03,293 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 02:30:03,293 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 02:30:03,294 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 265#(and (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, 12#thr1EXITtrue, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,294 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:30:03,294 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 02:30:03,294 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 02:30:03,294 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:30:03,295 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 265#(and (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, 67#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,295 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:30:03,295 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 02:30:03,295 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 02:30:03,296 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:30:03,321 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#L713true, 17#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,321 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:30:03,321 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 02:30:03,321 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 02:30:03,321 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 02:30:03,321 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 44#L707-1true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 4#L706-1true, 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,322 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:30:03,322 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 02:30:03,322 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 02:30:03,322 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:30:03,322 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 44#L707-1true, 29#L725-5true, 88#L713true, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 124#thr1EXITtrue, Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,322 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:30:03,322 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:30:03,322 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 02:30:03,322 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 02:30:03,363 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 97#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 4#L706-1true, 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,363 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:30:03,363 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 02:30:03,363 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,363 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 02:30:03,364 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 4#L706-1true, 25#L705-6true, 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,364 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:30:03,364 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,364 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 02:30:03,364 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:30:03,364 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 97#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 124#thr1EXITtrue, Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,365 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:30:03,365 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,365 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 02:30:03,365 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 02:30:03,365 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 25#L705-6true, 124#thr1EXITtrue, Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,366 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:30:03,366 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,366 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:30:03,366 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 02:30:03,367 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 44#L707-1true, 88#L713true, 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 265#(and (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,367 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:30:03,367 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:30:03,367 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,367 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 02:30:03,390 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 97#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,390 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:30:03,391 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 02:30:03,391 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,391 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 02:30:03,391 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 25#L705-6true, 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,392 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:30:03,392 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,392 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:30:03,392 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 02:30:03,427 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 132#L706-1true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 4#L706-1true, 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,427 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:30:03,427 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:30:03,427 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,427 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:30:03,427 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 4#L706-1true, 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, 12#thr1EXITtrue, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,427 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:30:03,428 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:30:03,428 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,428 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:30:03,428 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 4#L706-1true, 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, 67#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,428 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:30:03,428 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:30:03,428 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:30:03,428 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,428 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 132#L706-1true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 124#thr1EXITtrue, Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,429 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:30:03,429 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,429 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:30:03,429 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:30:03,429 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 124#thr1EXITtrue, Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 12#thr1EXITtrue, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,429 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:30:03,429 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:30:03,429 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:30:03,429 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,430 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 124#thr1EXITtrue, Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 67#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,430 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:30:03,430 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:30:03,430 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:30:03,430 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,442 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 70#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L713true, Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,443 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:30:03,443 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,443 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:30:03,443 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,444 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L713true, 124#thr1EXITtrue, Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,444 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:30:03,444 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,444 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,444 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:30:03,445 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 132#L706-1true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,445 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:30:03,445 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,445 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:30:03,445 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:30:03,446 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, 12#thr1EXITtrue, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,446 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:30:03,446 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,446 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:30:03,446 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:30:03,447 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, 67#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,447 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:30:03,447 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:30:03,447 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:30:03,447 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,471 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#L713true, 17#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,471 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-30 02:30:03,471 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:30:03,471 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:30:03,471 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:30:03,472 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 44#L707-1true, 88#L713true, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 4#L706-1true, 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,472 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-30 02:30:03,472 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:30:03,472 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:30:03,472 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:30:03,472 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 44#L707-1true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 124#thr1EXITtrue, Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,472 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-30 02:30:03,472 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:30:03,472 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:30:03,473 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:30:03,479 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 70#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 97#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,479 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-30 02:30:03,479 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:30:03,479 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:30:03,479 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:30:03,480 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 70#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 25#L705-6true, Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,480 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-30 02:30:03,480 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:30:03,480 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:30:03,480 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:30:03,480 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 97#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 124#thr1EXITtrue, Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,480 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-30 02:30:03,480 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:30:03,480 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:30:03,480 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:30:03,481 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 25#L705-6true, 124#thr1EXITtrue, Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,481 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-30 02:30:03,481 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:30:03,481 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:30:03,481 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:30:03,481 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 44#L707-1true, 29#L725-5true, 88#L713true, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,481 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-30 02:30:03,482 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:30:03,482 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:30:03,482 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:30:03,500 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 97#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,501 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-30 02:30:03,501 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,501 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:30:03,501 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:30:03,501 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#L713true, 25#L705-6true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,501 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-30 02:30:03,501 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 02:30:03,501 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,501 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:30:03,506 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 132#L706-1true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 70#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,506 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-30 02:30:03,506 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 02:30:03,506 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:30:03,506 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,507 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 132#L706-1true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 124#thr1EXITtrue, Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,507 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-30 02:30:03,507 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 02:30:03,507 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:30:03,507 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,507 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 70#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, 12#thr1EXITtrue, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,507 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-30 02:30:03,507 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:30:03,507 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,508 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 02:30:03,508 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 124#thr1EXITtrue, Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, 12#thr1EXITtrue, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,508 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-30 02:30:03,508 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:30:03,508 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,508 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 02:30:03,508 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 70#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, 67#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,508 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-30 02:30:03,509 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:30:03,509 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,509 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 02:30:03,509 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 124#thr1EXITtrue, Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, 67#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,509 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-30 02:30:03,509 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:30:03,509 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,510 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 02:30:03,625 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 70#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L713true, Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,626 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-30 02:30:03,626 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:30:03,626 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,626 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,626 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L713true, Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 124#thr1EXITtrue, 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,626 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-30 02:30:03,626 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:30:03,626 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,626 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,627 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 132#L706-1true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,633 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-30 02:30:03,633 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 02:30:03,633 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:30:03,634 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,634 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, 12#thr1EXITtrue, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,634 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-30 02:30:03,635 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 02:30:03,635 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:30:03,635 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,635 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, 67#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,635 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-30 02:30:03,635 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:30:03,636 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,636 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 02:30:03,637 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][103], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 269#(and (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) 4) (select |#length| |~#storage~0.base|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L713true, 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,637 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-30 02:30:03,638 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,638 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:30:03,638 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,638 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 44#L707-1true, 29#L725-5true, 88#L713true, 70#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,638 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-30 02:30:03,639 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 02:30:03,639 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,639 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:30:03,639 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 44#L707-1true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 124#thr1EXITtrue, Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,639 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-30 02:30:03,640 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 02:30:03,640 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,640 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:30:03,648 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 70#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 97#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,648 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-30 02:30:03,648 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:30:03,648 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:30:03,648 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:30:03,649 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 70#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 25#L705-6true, Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,649 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-30 02:30:03,649 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:30:03,649 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:30:03,649 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 02:30:03,650 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 97#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 124#thr1EXITtrue, 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,650 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-30 02:30:03,650 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:30:03,650 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:30:03,650 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:30:03,650 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 25#L705-6true, Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 124#thr1EXITtrue, 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,650 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-30 02:30:03,651 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:30:03,651 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:30:03,651 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 02:30:03,651 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][73], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 44#L707-1true, 88#L713true, 267#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (<= 4 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,652 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-30 02:30:03,652 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:30:03,652 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:30:03,652 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 02:30:03,653 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][103], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 269#(and (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) 4) (select |#length| |~#storage~0.base|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 97#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,653 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-30 02:30:03,653 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:30:03,653 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:30:03,653 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:30:03,654 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][103], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 269#(and (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) 4) (select |#length| |~#storage~0.base|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 25#L705-6true, 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,654 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-30 02:30:03,654 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 02:30:03,654 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:30:03,654 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:30:03,660 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 132#L706-1true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 70#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,660 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-30 02:30:03,660 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,660 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:30:03,660 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:30:03,661 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 132#L706-1true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 124#thr1EXITtrue, 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,661 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-30 02:30:03,661 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:30:03,661 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:30:03,661 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,661 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 70#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, 12#thr1EXITtrue, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,662 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-30 02:30:03,662 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:30:03,662 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:30:03,662 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,662 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 124#thr1EXITtrue, 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, 12#thr1EXITtrue, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,662 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-30 02:30:03,662 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,663 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:30:03,663 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:30:03,663 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 70#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, 67#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,663 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-30 02:30:03,663 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:30:03,663 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,664 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:30:03,664 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 124#thr1EXITtrue, 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, 67#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,664 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-30 02:30:03,664 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:30:03,664 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:30:03,664 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,665 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][103], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 132#L706-1true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 269#(and (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) 4) (select |#length| |~#storage~0.base|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,665 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-30 02:30:03,666 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:30:03,666 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:30:03,666 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,666 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][103], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 269#(and (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) 4) (select |#length| |~#storage~0.base|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 12#thr1EXITtrue, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,666 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-30 02:30:03,667 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,667 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:30:03,667 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:30:03,667 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][103], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 29#L725-5true, 88#L713true, 269#(and (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) 4) (select |#length| |~#storage~0.base|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, 67#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,667 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-30 02:30:03,667 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:30:03,668 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:30:03,668 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:30:03,670 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][103], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 269#(and (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) 4) (select |#length| |~#storage~0.base|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#L713true, 17#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,670 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-30 02:30:03,670 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:30:03,670 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:30:03,670 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:30:03,671 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 44#L707-1true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 70#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,672 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-30 02:30:03,672 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:30:03,672 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:30:03,672 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:30:03,672 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][34], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 44#L707-1true, 88#L713true, 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 263#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 176#(and (<= 0 |~#storage~0.offset|) (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 124#thr1EXITtrue, 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,673 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-30 02:30:03,673 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:30:03,673 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:30:03,673 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:30:03,673 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][103], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 44#L707-1true, 29#L725-5true, 88#L713true, 269#(and (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) 4) (select |#length| |~#storage~0.base|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,674 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-30 02:30:03,674 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:30:03,674 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:30:03,674 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:30:03,675 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][103], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 269#(and (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) 4) (select |#length| |~#storage~0.base|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 97#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,675 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-30 02:30:03,675 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:30:03,675 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:30:03,676 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:30:03,676 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][103], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 269#(and (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) 4) (select |#length| |~#storage~0.base|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 25#L705-6true, 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,676 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-30 02:30:03,676 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:30:03,676 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:30:03,677 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:30:03,677 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][103], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 132#L706-1true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 269#(and (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) 4) (select |#length| |~#storage~0.base|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,678 INFO L383 tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event [2023-08-30 02:30:03,678 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:30:03,678 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-30 02:30:03,678 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,679 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][103], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 269#(and (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) 4) (select |#length| |~#storage~0.base|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, 12#thr1EXITtrue, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,679 INFO L383 tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event [2023-08-30 02:30:03,679 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,679 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:30:03,679 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-30 02:30:03,680 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][103], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 269#(and (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) 4) (select |#length| |~#storage~0.base|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, 67#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,680 INFO L383 tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event [2023-08-30 02:30:03,680 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:30:03,680 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:30:03,680 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-30 02:30:03,681 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L709-1-->L713: Formula: (and (= v_~m~0_26 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0)) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_26, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][103], [Black: 190#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 113#L725-4true, 44#L707-1true, 162#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 88#L713true, 269#(and (<= (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4) 4) (select |#length| |~#storage~0.base|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 0 (+ |~#storage~0.offset| (* |thr1Thread1of3ForFork0_findMax_~i~0#1| 4)))), 158#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#L713true, Black: 173#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 185#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|)) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread2of3ForFork0_findMax_~offset#1| 4) |~#storage~0.offset|) 20) (= (select |#length| |~#storage~0.base|) 24) (= |thr1Thread2of3ForFork0_findMax_~i~0#1| |thr1Thread2of3ForFork0_findMax_~offset#1|)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 169#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread3of3ForFork0InUse, 188#true]) [2023-08-30 02:30:03,681 INFO L383 tUnfolder$Statistics]: this new event has 50 ancestors and is cut-off event [2023-08-30 02:30:03,681 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-30 02:30:03,681 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-30 02:30:03,681 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:30:03,681 INFO L130 PetriNetUnfolder]: 24025/35008 cut-off events. [2023-08-30 02:30:03,682 INFO L131 PetriNetUnfolder]: For 15969/16668 co-relation queries the response was YES. [2023-08-30 02:30:03,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86486 conditions, 35008 events. 24025/35008 cut-off events. For 15969/16668 co-relation queries the response was YES. Maximal size of possible extension queue 1329. Compared 244444 event pairs, 5744 based on Foata normal form. 550/30767 useless extension candidates. Maximal degree in co-relation 86470. Up to 10747 conditions per place. [2023-08-30 02:30:03,928 INFO L137 encePairwiseOnDemand]: 312/317 looper letters, 98 selfloop transitions, 9 changer transitions 0/121 dead transitions. [2023-08-30 02:30:03,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 121 transitions, 635 flow [2023-08-30 02:30:03,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:30:03,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:30:03,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 879 transitions. [2023-08-30 02:30:03,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46214511041009465 [2023-08-30 02:30:03,931 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 879 transitions. [2023-08-30 02:30:03,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 879 transitions. [2023-08-30 02:30:03,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:30:03,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 879 transitions. [2023-08-30 02:30:03,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 146.5) internal successors, (879), 6 states have internal predecessors, (879), 0 states have call successors, (0), 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 02:30:03,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 317.0) internal successors, (2219), 7 states have internal predecessors, (2219), 0 states have call successors, (0), 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 02:30:03,937 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 317.0) internal successors, (2219), 7 states have internal predecessors, (2219), 0 states have call successors, (0), 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 02:30:03,937 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 174 flow. Second operand 6 states and 879 transitions. [2023-08-30 02:30:03,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 121 transitions, 635 flow [2023-08-30 02:30:03,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 121 transitions, 617 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:30:03,966 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 228 flow [2023-08-30 02:30:03,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=228, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2023-08-30 02:30:03,968 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2023-08-30 02:30:03,968 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 228 flow [2023-08-30 02:30:03,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 131.92857142857142) internal successors, (1847), 14 states have internal predecessors, (1847), 0 states have call successors, (0), 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 02:30:03,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:30:03,969 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 02:30:03,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-30 02:30:04,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-08-30 02:30:04,174 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-08-30 02:30:04,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:30:04,175 INFO L85 PathProgramCache]: Analyzing trace with hash -2007912543, now seen corresponding path program 1 times [2023-08-30 02:30:04,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:30:04,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552756956] [2023-08-30 02:30:04,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:30:04,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:30:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:30:04,319 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-30 02:30:04,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:30:04,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552756956] [2023-08-30 02:30:04,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552756956] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:30:04,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:30:04,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:30:04,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156231068] [2023-08-30 02:30:04,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:30:04,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:30:04,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:30:04,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:30:04,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:30:04,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 317 [2023-08-30 02:30:04,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 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 02:30:04,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:30:04,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 317 [2023-08-30 02:30:04,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:30:06,984 INFO L130 PetriNetUnfolder]: 25715/37906 cut-off events. [2023-08-30 02:30:06,985 INFO L131 PetriNetUnfolder]: For 34391/34539 co-relation queries the response was YES. [2023-08-30 02:30:07,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94122 conditions, 37906 events. 25715/37906 cut-off events. For 34391/34539 co-relation queries the response was YES. Maximal size of possible extension queue 1458. Compared 275344 event pairs, 8487 based on Foata normal form. 5/31950 useless extension candidates. Maximal degree in co-relation 94103. Up to 19654 conditions per place. [2023-08-30 02:30:07,234 INFO L137 encePairwiseOnDemand]: 312/317 looper letters, 62 selfloop transitions, 4 changer transitions 0/80 dead transitions. [2023-08-30 02:30:07,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 80 transitions, 505 flow [2023-08-30 02:30:07,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:30:07,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:30:07,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 573 transitions. [2023-08-30 02:30:07,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4518927444794953 [2023-08-30 02:30:07,237 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 573 transitions. [2023-08-30 02:30:07,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 573 transitions. [2023-08-30 02:30:07,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:30:07,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 573 transitions. [2023-08-30 02:30:07,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 0 states have call successors, (0), 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 02:30:07,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 317.0) internal successors, (1585), 5 states have internal predecessors, (1585), 0 states have call successors, (0), 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 02:30:07,241 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 317.0) internal successors, (1585), 5 states have internal predecessors, (1585), 0 states have call successors, (0), 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 02:30:07,241 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 228 flow. Second operand 4 states and 573 transitions. [2023-08-30 02:30:07,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 80 transitions, 505 flow [2023-08-30 02:30:07,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 80 transitions, 504 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:30:07,251 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 248 flow [2023-08-30 02:30:07,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=248, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2023-08-30 02:30:07,251 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2023-08-30 02:30:07,251 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 248 flow [2023-08-30 02:30:07,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 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 02:30:07,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:30:07,252 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:30:07,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-30 02:30:07,252 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-08-30 02:30:07,253 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:30:07,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1212985656, now seen corresponding path program 1 times [2023-08-30 02:30:07,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:30:07,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023204202] [2023-08-30 02:30:07,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:30:07,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:30:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:30:07,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 02:30:07,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:30:07,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023204202] [2023-08-30 02:30:07,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023204202] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:30:07,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:30:07,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:30:07,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588238550] [2023-08-30 02:30:07,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:30:07,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:30:07,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:30:07,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:30:07,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:30:07,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 317 [2023-08-30 02:30:07,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 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 02:30:07,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:30:07,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 317 [2023-08-30 02:30:07,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:30:12,423 INFO L130 PetriNetUnfolder]: 51156/71536 cut-off events. [2023-08-30 02:30:12,423 INFO L131 PetriNetUnfolder]: For 71576/71640 co-relation queries the response was YES. [2023-08-30 02:30:12,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195153 conditions, 71536 events. 51156/71536 cut-off events. For 71576/71640 co-relation queries the response was YES. Maximal size of possible extension queue 2580. Compared 506471 event pairs, 21781 based on Foata normal form. 1668/69298 useless extension candidates. Maximal degree in co-relation 195131. Up to 42207 conditions per place. [2023-08-30 02:30:12,847 INFO L137 encePairwiseOnDemand]: 310/317 looper letters, 74 selfloop transitions, 9 changer transitions 0/90 dead transitions. [2023-08-30 02:30:12,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 90 transitions, 602 flow [2023-08-30 02:30:12,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:30:12,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:30:12,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-08-30 02:30:12,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4679284963196635 [2023-08-30 02:30:12,849 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-08-30 02:30:12,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-08-30 02:30:12,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:30:12,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-08-30 02:30:12,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 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 02:30:12,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 0 states have call successors, (0), 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 02:30:12,852 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 0 states have call successors, (0), 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 02:30:12,852 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 248 flow. Second operand 3 states and 445 transitions. [2023-08-30 02:30:12,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 90 transitions, 602 flow [2023-08-30 02:30:12,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 90 transitions, 595 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:30:12,952 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 316 flow [2023-08-30 02:30:12,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2023-08-30 02:30:12,952 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 16 predicate places. [2023-08-30 02:30:12,953 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 316 flow [2023-08-30 02:30:12,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 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 02:30:12,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:30:12,953 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:30:12,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-30 02:30:12,953 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-08-30 02:30:12,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:30:12,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1052153842, now seen corresponding path program 1 times [2023-08-30 02:30:12,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:30:12,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024899195] [2023-08-30 02:30:12,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:30:12,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:30:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:30:13,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 02:30:13,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:30:13,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024899195] [2023-08-30 02:30:13,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024899195] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:30:13,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478882847] [2023-08-30 02:30:13,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:30:13,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:30:13,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:30:13,365 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:30:13,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-30 02:30:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:30:13,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-30 02:30:13,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:30:13,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:30:13,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-30 02:30:13,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 02:30:13,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:30:13,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 02:30:13,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478882847] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:30:13,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:30:13,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 15 [2023-08-30 02:30:13,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039580428] [2023-08-30 02:30:13,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:30:13,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-30 02:30:13,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:30:13,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-30 02:30:13,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2023-08-30 02:30:15,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 317 [2023-08-30 02:30:15,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 316 flow. Second operand has 17 states, 17 states have (on average 120.0) internal successors, (2040), 17 states have internal predecessors, (2040), 0 states have call successors, (0), 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 02:30:15,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:30:15,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 317 [2023-08-30 02:30:15,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:30:29,970 INFO L130 PetriNetUnfolder]: 130778/184381 cut-off events. [2023-08-30 02:30:29,971 INFO L131 PetriNetUnfolder]: For 252792/252798 co-relation queries the response was YES. [2023-08-30 02:30:30,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550742 conditions, 184381 events. 130778/184381 cut-off events. For 252792/252798 co-relation queries the response was YES. Maximal size of possible extension queue 6333. Compared 1450040 event pairs, 14615 based on Foata normal form. 0/181535 useless extension candidates. Maximal degree in co-relation 550719. Up to 35565 conditions per place. [2023-08-30 02:30:31,473 INFO L137 encePairwiseOnDemand]: 307/317 looper letters, 447 selfloop transitions, 46 changer transitions 0/501 dead transitions. [2023-08-30 02:30:31,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 501 transitions, 3752 flow [2023-08-30 02:30:31,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-30 02:30:31,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-30 02:30:31,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2226 transitions. [2023-08-30 02:30:31,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4388801261829653 [2023-08-30 02:30:31,480 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2226 transitions. [2023-08-30 02:30:31,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2226 transitions. [2023-08-30 02:30:31,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:30:31,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2226 transitions. [2023-08-30 02:30:31,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 139.125) internal successors, (2226), 16 states have internal predecessors, (2226), 0 states have call successors, (0), 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 02:30:31,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 317.0) internal successors, (5389), 17 states have internal predecessors, (5389), 0 states have call successors, (0), 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 02:30:31,491 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 317.0) internal successors, (5389), 17 states have internal predecessors, (5389), 0 states have call successors, (0), 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 02:30:31,491 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 316 flow. Second operand 16 states and 2226 transitions. [2023-08-30 02:30:31,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 501 transitions, 3752 flow [2023-08-30 02:30:34,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 501 transitions, 3630 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:30:34,857 INFO L231 Difference]: Finished difference. Result has 88 places, 99 transitions, 749 flow [2023-08-30 02:30:34,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=749, PETRI_PLACES=88, PETRI_TRANSITIONS=99} [2023-08-30 02:30:34,858 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 39 predicate places. [2023-08-30 02:30:34,858 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 99 transitions, 749 flow [2023-08-30 02:30:34,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 120.0) internal successors, (2040), 17 states have internal predecessors, (2040), 0 states have call successors, (0), 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 02:30:34,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:30:34,859 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2023-08-30 02:30:34,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-30 02:30:35,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:30:35,064 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-08-30 02:30:35,065 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:30:35,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1173294672, now seen corresponding path program 1 times [2023-08-30 02:30:35,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:30:35,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546622017] [2023-08-30 02:30:35,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:30:35,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:30:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:30:35,075 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:30:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:30:35,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:30:35,090 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:30:35,091 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2023-08-30 02:30:35,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2023-08-30 02:30:35,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:30:35,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (12 of 16 remaining) [2023-08-30 02:30:35,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:30:35,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:30:35,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (9 of 16 remaining) [2023-08-30 02:30:35,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:30:35,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:30:35,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (6 of 16 remaining) [2023-08-30 02:30:35,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2023-08-30 02:30:35,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2023-08-30 02:30:35,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (3 of 16 remaining) [2023-08-30 02:30:35,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2023-08-30 02:30:35,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2023-08-30 02:30:35,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:30:35,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-30 02:30:35,093 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:30:35,094 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-30 02:30:35,094 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-08-30 02:30:35,124 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:30:35,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 203 transitions, 438 flow [2023-08-30 02:30:35,148 INFO L130 PetriNetUnfolder]: 25/269 cut-off events. [2023-08-30 02:30:35,149 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-30 02:30:35,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 269 events. 25/269 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 856 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 219. Up to 10 conditions per place. [2023-08-30 02:30:35,150 INFO L82 GeneralOperation]: Start removeDead. Operand has 191 places, 203 transitions, 438 flow [2023-08-30 02:30:35,152 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 191 places, 203 transitions, 438 flow [2023-08-30 02:30:35,152 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:30:35,153 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 203 transitions, 438 flow [2023-08-30 02:30:35,153 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 203 transitions, 438 flow [2023-08-30 02:30:35,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 203 transitions, 438 flow [2023-08-30 02:30:35,177 INFO L130 PetriNetUnfolder]: 25/269 cut-off events. [2023-08-30 02:30:35,177 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-30 02:30:35,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 269 events. 25/269 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 856 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 219. Up to 10 conditions per place. [2023-08-30 02:30:35,193 INFO L119 LiptonReduction]: Number of co-enabled transitions 25440 [2023-08-30 02:30:38,307 INFO L134 LiptonReduction]: Checked pairs total: 45279 [2023-08-30 02:30:38,308 INFO L136 LiptonReduction]: Total number of compositions: 189 [2023-08-30 02:30:38,309 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:30:38,309 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;@4a5fc5d8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:30:38,309 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2023-08-30 02:30:38,310 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 02:30:38,310 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:30:38,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:30:38,311 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 02:30:38,311 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2023-08-30 02:30:38,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:30:38,311 INFO L85 PathProgramCache]: Analyzing trace with hash 46388, now seen corresponding path program 1 times [2023-08-30 02:30:38,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:30:38,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057023285] [2023-08-30 02:30:38,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:30:38,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:30:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:30:38,322 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 02:30:38,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:30:38,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057023285] [2023-08-30 02:30:38,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057023285] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:30:38,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:30:38,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:30:38,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101883461] [2023-08-30 02:30:38,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:30:38,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:30:38,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:30:38,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:30:38,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:30:38,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 392 [2023-08-30 02:30:38,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 154 flow. Second operand has 2 states, 2 states have (on average 174.0) internal successors, (348), 2 states have internal predecessors, (348), 0 states have call successors, (0), 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 02:30:38,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:30:38,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 392 [2023-08-30 02:30:38,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:30:45,741 INFO L130 PetriNetUnfolder]: 111128/149318 cut-off events. [2023-08-30 02:30:45,741 INFO L131 PetriNetUnfolder]: For 11377/11377 co-relation queries the response was YES. [2023-08-30 02:30:46,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293286 conditions, 149318 events. 111128/149318 cut-off events. For 11377/11377 co-relation queries the response was YES. Maximal size of possible extension queue 7561. Compared 1063366 event pairs, 95136 based on Foata normal form. 0/79517 useless extension candidates. Maximal degree in co-relation 26026. Up to 137373 conditions per place. [2023-08-30 02:30:46,795 INFO L137 encePairwiseOnDemand]: 390/392 looper letters, 44 selfloop transitions, 0 changer transitions 0/59 dead transitions. [2023-08-30 02:30:46,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 59 transitions, 238 flow [2023-08-30 02:30:46,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:30:46,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:30:46,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 392 transitions. [2023-08-30 02:30:46,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-30 02:30:46,797 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 392 transitions. [2023-08-30 02:30:46,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 392 transitions. [2023-08-30 02:30:46,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:30:46,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 392 transitions. [2023-08-30 02:30:46,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 196.0) internal successors, (392), 2 states have internal predecessors, (392), 0 states have call successors, (0), 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 02:30:46,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 0 states have call successors, (0), 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 02:30:46,799 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 0 states have call successors, (0), 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 02:30:46,799 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 154 flow. Second operand 2 states and 392 transitions. [2023-08-30 02:30:46,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 59 transitions, 238 flow [2023-08-30 02:30:46,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 59 transitions, 226 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-08-30 02:30:46,808 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 138 flow [2023-08-30 02:30:46,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=392, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=138, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2023-08-30 02:30:46,808 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2023-08-30 02:30:46,809 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 138 flow [2023-08-30 02:30:46,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 174.0) internal successors, (348), 2 states have internal predecessors, (348), 0 states have call successors, (0), 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 02:30:46,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:30:46,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 02:30:46,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-30 02:30:46,809 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2023-08-30 02:30:46,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:30:46,810 INFO L85 PathProgramCache]: Analyzing trace with hash 46377, now seen corresponding path program 1 times [2023-08-30 02:30:46,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:30:46,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189946605] [2023-08-30 02:30:46,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:30:46,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:30:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:30:46,825 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 02:30:46,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:30:46,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189946605] [2023-08-30 02:30:46,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189946605] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:30:46,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:30:46,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:30:46,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722251078] [2023-08-30 02:30:46,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:30:46,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:30:46,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:30:46,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:30:46,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:30:46,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 392 [2023-08-30 02:30:46,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 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 02:30:46,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:30:46,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 392 [2023-08-30 02:30:46,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:30:54,739 INFO L130 PetriNetUnfolder]: 81706/110875 cut-off events. [2023-08-30 02:30:54,740 INFO L131 PetriNetUnfolder]: For 2295/2295 co-relation queries the response was YES. [2023-08-30 02:30:54,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215378 conditions, 110875 events. 81706/110875 cut-off events. For 2295/2295 co-relation queries the response was YES. Maximal size of possible extension queue 5489. Compared 776031 event pairs, 69712 based on Foata normal form. 0/61987 useless extension candidates. Maximal degree in co-relation 215371. Up to 101389 conditions per place. [2023-08-30 02:30:55,322 INFO L137 encePairwiseOnDemand]: 390/392 looper letters, 42 selfloop transitions, 1 changer transitions 0/58 dead transitions. [2023-08-30 02:30:55,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 222 flow [2023-08-30 02:30:55,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:30:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:30:55,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 545 transitions. [2023-08-30 02:30:55,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46343537414965985 [2023-08-30 02:30:55,324 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 545 transitions. [2023-08-30 02:30:55,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 545 transitions. [2023-08-30 02:30:55,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:30:55,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 545 transitions. [2023-08-30 02:30:55,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 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 02:30:55,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 392.0) internal successors, (1568), 4 states have internal predecessors, (1568), 0 states have call successors, (0), 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 02:30:55,328 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 392.0) internal successors, (1568), 4 states have internal predecessors, (1568), 0 states have call successors, (0), 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 02:30:55,328 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 138 flow. Second operand 3 states and 545 transitions. [2023-08-30 02:30:55,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 222 flow [2023-08-30 02:30:55,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 58 transitions, 222 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:30:55,329 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 138 flow [2023-08-30 02:30:55,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=392, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2023-08-30 02:30:55,330 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 0 predicate places. [2023-08-30 02:30:55,330 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 138 flow [2023-08-30 02:30:55,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 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 02:30:55,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:30:55,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 02:30:55,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-30 02:30:55,330 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2023-08-30 02:30:55,331 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:30:55,331 INFO L85 PathProgramCache]: Analyzing trace with hash 46379, now seen corresponding path program 1 times [2023-08-30 02:30:55,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:30:55,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481728508] [2023-08-30 02:30:55,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:30:55,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:30:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:30:55,378 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 02:30:55,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:30:55,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481728508] [2023-08-30 02:30:55,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481728508] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:30:55,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:30:55,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:30:55,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182750442] [2023-08-30 02:30:55,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:30:55,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:30:55,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:30:55,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:30:55,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:30:55,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 392 [2023-08-30 02:30:55,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 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 02:30:55,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:30:55,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 392 [2023-08-30 02:30:55,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:30:59,489 INFO L130 PetriNetUnfolder]: 52284/72432 cut-off events. [2023-08-30 02:30:59,489 INFO L131 PetriNetUnfolder]: For 2295/2295 co-relation queries the response was YES. [2023-08-30 02:30:59,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140954 conditions, 72432 events. 52284/72432 cut-off events. For 2295/2295 co-relation queries the response was YES. Maximal size of possible extension queue 3403. Compared 496686 event pairs, 44288 based on Foata normal form. 0/44457 useless extension candidates. Maximal degree in co-relation 140946. Up to 65406 conditions per place. [2023-08-30 02:30:59,897 INFO L137 encePairwiseOnDemand]: 390/392 looper letters, 41 selfloop transitions, 1 changer transitions 0/57 dead transitions. [2023-08-30 02:30:59,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 57 transitions, 220 flow [2023-08-30 02:30:59,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:30:59,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:30:59,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 550 transitions. [2023-08-30 02:30:59,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.467687074829932 [2023-08-30 02:30:59,899 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 550 transitions. [2023-08-30 02:30:59,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 550 transitions. [2023-08-30 02:30:59,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:30:59,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 550 transitions. [2023-08-30 02:30:59,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 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 02:30:59,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 392.0) internal successors, (1568), 4 states have internal predecessors, (1568), 0 states have call successors, (0), 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 02:30:59,902 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 392.0) internal successors, (1568), 4 states have internal predecessors, (1568), 0 states have call successors, (0), 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 02:30:59,902 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 138 flow. Second operand 3 states and 550 transitions. [2023-08-30 02:30:59,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 57 transitions, 220 flow [2023-08-30 02:30:59,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 57 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:30:59,904 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 137 flow [2023-08-30 02:30:59,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=392, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2023-08-30 02:30:59,905 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 0 predicate places. [2023-08-30 02:30:59,905 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 137 flow [2023-08-30 02:30:59,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 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 02:30:59,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:30:59,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:30:59,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-30 02:30:59,906 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2023-08-30 02:30:59,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:30:59,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1382875354, now seen corresponding path program 1 times [2023-08-30 02:30:59,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:30:59,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496834302] [2023-08-30 02:30:59,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:30:59,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:30:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:30:59,953 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 02:30:59,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:30:59,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496834302] [2023-08-30 02:30:59,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496834302] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:30:59,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:30:59,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:30:59,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883031414] [2023-08-30 02:30:59,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:30:59,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:30:59,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:30:59,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:30:59,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:31:00,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 392 [2023-08-30 02:31:00,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 159.25) internal successors, (637), 4 states have internal predecessors, (637), 0 states have call successors, (0), 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 02:31:00,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:00,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 392 [2023-08-30 02:31:00,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:02,751 INFO L130 PetriNetUnfolder]: 33187/46361 cut-off events. [2023-08-30 02:31:02,751 INFO L131 PetriNetUnfolder]: For 1624/1624 co-relation queries the response was YES. [2023-08-30 02:31:02,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89952 conditions, 46361 events. 33187/46361 cut-off events. For 1624/1624 co-relation queries the response was YES. Maximal size of possible extension queue 2077. Compared 305006 event pairs, 27503 based on Foata normal form. 0/30991 useless extension candidates. Maximal degree in co-relation 89944. Up to 41379 conditions per place. [2023-08-30 02:31:02,991 INFO L137 encePairwiseOnDemand]: 387/392 looper letters, 37 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2023-08-30 02:31:02,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 53 transitions, 205 flow [2023-08-30 02:31:02,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:31:02,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:31:02,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 516 transitions. [2023-08-30 02:31:02,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4387755102040816 [2023-08-30 02:31:02,993 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 516 transitions. [2023-08-30 02:31:02,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 516 transitions. [2023-08-30 02:31:02,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:02,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 516 transitions. [2023-08-30 02:31:02,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 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 02:31:02,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 392.0) internal successors, (1568), 4 states have internal predecessors, (1568), 0 states have call successors, (0), 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 02:31:02,997 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 392.0) internal successors, (1568), 4 states have internal predecessors, (1568), 0 states have call successors, (0), 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 02:31:02,997 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 137 flow. Second operand 3 states and 516 transitions. [2023-08-30 02:31:02,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 53 transitions, 205 flow [2023-08-30 02:31:02,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 53 transitions, 204 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:31:02,998 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 130 flow [2023-08-30 02:31:02,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=392, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2023-08-30 02:31:02,999 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2023-08-30 02:31:02,999 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 130 flow [2023-08-30 02:31:02,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.25) internal successors, (637), 4 states have internal predecessors, (637), 0 states have call successors, (0), 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 02:31:02,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:02,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:31:02,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-30 02:31:03,000 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2023-08-30 02:31:03,000 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:03,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1382875355, now seen corresponding path program 1 times [2023-08-30 02:31:03,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:03,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128034083] [2023-08-30 02:31:03,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:03,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:03,085 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 02:31:03,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:03,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128034083] [2023-08-30 02:31:03,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128034083] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:03,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:31:03,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:31:03,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8176173] [2023-08-30 02:31:03,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:03,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:31:03,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:03,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:31:03,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:31:03,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 392 [2023-08-30 02:31:03,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 166.25) internal successors, (665), 4 states have internal predecessors, (665), 0 states have call successors, (0), 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 02:31:03,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:03,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 392 [2023-08-30 02:31:03,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:07,620 INFO L130 PetriNetUnfolder]: 54367/75679 cut-off events. [2023-08-30 02:31:07,620 INFO L131 PetriNetUnfolder]: For 2771/2771 co-relation queries the response was YES. [2023-08-30 02:31:07,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146226 conditions, 75679 events. 54367/75679 cut-off events. For 2771/2771 co-relation queries the response was YES. Maximal size of possible extension queue 2880. Compared 533065 event pairs, 27503 based on Foata normal form. 0/51713 useless extension candidates. Maximal degree in co-relation 146218. Up to 41379 conditions per place. [2023-08-30 02:31:08,067 INFO L137 encePairwiseOnDemand]: 387/392 looper letters, 68 selfloop transitions, 3 changer transitions 0/86 dead transitions. [2023-08-30 02:31:08,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 86 transitions, 353 flow [2023-08-30 02:31:08,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:31:08,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:31:08,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 733 transitions. [2023-08-30 02:31:08,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4674744897959184 [2023-08-30 02:31:08,070 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 733 transitions. [2023-08-30 02:31:08,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 733 transitions. [2023-08-30 02:31:08,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:08,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 733 transitions. [2023-08-30 02:31:08,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 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 02:31:08,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 392.0) internal successors, (1960), 5 states have internal predecessors, (1960), 0 states have call successors, (0), 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 02:31:08,074 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 392.0) internal successors, (1960), 5 states have internal predecessors, (1960), 0 states have call successors, (0), 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 02:31:08,074 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 130 flow. Second operand 4 states and 733 transitions. [2023-08-30 02:31:08,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 86 transitions, 353 flow [2023-08-30 02:31:08,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 86 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:31:08,080 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 145 flow [2023-08-30 02:31:08,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=392, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2023-08-30 02:31:08,081 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 0 predicate places. [2023-08-30 02:31:08,081 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 145 flow [2023-08-30 02:31:08,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 166.25) internal successors, (665), 4 states have internal predecessors, (665), 0 states have call successors, (0), 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 02:31:08,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:08,081 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:31:08,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-30 02:31:08,082 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2023-08-30 02:31:08,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:08,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1336032414, now seen corresponding path program 1 times [2023-08-30 02:31:08,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:08,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891477148] [2023-08-30 02:31:08,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:08,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:08,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 02:31:08,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:08,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891477148] [2023-08-30 02:31:08,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891477148] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:08,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:31:08,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:31:08,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784151874] [2023-08-30 02:31:08,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:08,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:31:08,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:08,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:31:08,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:31:08,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 392 [2023-08-30 02:31:08,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 166.5) internal successors, (666), 4 states have internal predecessors, (666), 0 states have call successors, (0), 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 02:31:08,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:08,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 392 [2023-08-30 02:31:08,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand